On the exponential diophantine equation $$U_{n}^x+U_{n+1}^x=U_m$$

Author:

Batte HerbertORCID,Ddamulira MahadiORCID,Kasozi JumaORCID,Luca FlorianORCID

Abstract

AbstractLet $$ \{U_n\}_{n\ge 0} $$ { U n } n 0 be the Lucas sequence. For integers x, n and m, we find all solutions to $$U_{n}^x+U_{n+1}^x=U_m$$ U n x + U n + 1 x = U m . The equation was studied and claimed to be solved completely in Ddamulira and Luca (Ramanujan J 56(2):651–684, 2021) but there are some computational bugs in that publication because of the wrong statement of Mignotte’s bound from Mignotte (A kit on linear forms in three logarithms. http://irma.math.unistra.fr/~bugeaud/travaux/kit.pdf, 2008). In this paper, the main result remains the same as in Ddamulira and Luca (Ramanujan J 56(2):651–684, 2021) but we focus on correcting the computational mistakes in Ddamulira and Luca (Ramanujan J 56(2):651–684, 2021), involving the application of Theorem 2.1 from Mignotte (A kit on linear forms in three logarithms. http://irma.math.unistra.fr/~bugeaud/travaux/kit.pdf, 2008).

Funder

University of the Witwatersrand

Publisher

Springer Science and Business Media LLC

Subject

Algebra and Number Theory

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3