On factorials expressible as sums of at most three Fibonacci numbers

DOI10.1017/S0013091508000874zbMath1253.11048OpenAlexW2146719080MaRDI QIDQ4933550

Florian Luca, Samir Siksek

Publication date: 14 October 2010

Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0013091508000874

zbMATH Keywords

Fibonacci numbersLucas numbersDiophantine equationexponential equationfactorialsChebyshev's function

Mathematics Subject Classification ID

Exponential Diophantine equations (11D61) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Representation problems (11D85)

Related Items (8)

Unnamed Item ⋮ Unnamed Item ⋮ ON SOLUTIONS OF THE DIOPHANTINE EQUATION Fn1 + Fn2 + Fn3 + Fn4 = 2^a ⋮ Powers of two as sums of three Pell numbers ⋮ Repdigits in Narayana's Cows Sequence and their Consequences ⋮ Unnamed Item ⋮ On The diophantine equationFn+F_m=2^a ⋮ On a Diophantine equation involving Fibonacci numbers and the Ramanujan \(\tau\)-function of factorials

Cites Work

• The Magma algebra system. I: The user language
• Sums of factorials in binary recurrence sequences
• Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
• The Number of Non-Zero Digits of n!
• On polynomial-factorial diophantine equations
• Unsolved problems in number theory

This page was built for publication: On factorials expressible as sums of at most three Fibonacci numbers