Ratios of sums of two Fibonacci numbers equal to powers of 2

被引:0
|
作者
Bravo, Jhon J. [1 ]
Diaz, Maribel [1 ]
Luca, Florian [2 ,3 ,4 ]
机构
[1] Univ Cauca, Dept Matemat, Calle 5 4-70, Popayan, Colombia
[2] Univ Witwatersrand, Sch Math, Private Bag 3, ZA-2050 Johannesburg, South Africa
[3] King Abdulaziz Univ, Res Grp Algebra Struct & Applicat, Al Ehtifalat St, Jeddah 21589, Saudi Arabia
[4] Max Planck Inst Math, Vivatsgasse 7, D-53111 Bonn, Germany
关键词
Fibonacci number; Zeckendorf representation; linear form in logarithms; reduction method;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we find all solutions to the Diophantine equation F-n + F-m = 2(a)(F-r + F-s), where {F-k}(k >= 0) is the Fibonacci sequence. This paper continues and extends previous work, which investigated the powers of 2 that are sums of two Fibonacci numbers.
引用
收藏
页码:185 / 199
页数:15
相关论文
共 50 条