Sums of factorials in binary recurrence sequences
From MaRDI portal
Publication:1604981
DOI10.1006/jnth.2001.2718zbMath0995.11008OpenAlexW2080889471MaRDI QIDQ1604981
Publication date: 10 July 2002
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f3b9fb3f2aa79b630712658119dbd0e8c2ec3b7b
linear forms in logarithms of algebraic numberslargest Fibonacci and Lucas numbersnondegenerate binary linear recurrencesums or differences of two factorials
Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Linear forms in logarithms; Baker's method (11J86) Diophantine equations (11D99)
Related Items (8)
Exponential Diophantine Equations ⋮ Unnamed Item ⋮ On the solutions of the Diophantine equation \(F_n \pm \frac{a (10^m - 1)}{9} = k!\) ⋮ Additive Diophantine equations with binary recurrences, \(\mathcal{S}\)-units and several factorials ⋮ Linear combinations of factorials and \(S\)-units in a binary recurrence sequence ⋮ On factorials expressible as sums of at most three Fibonacci numbers ⋮ Arithmetic properties of the sequence of derangements ⋮ On a Diophantine equation involving Fibonacci numbers and the Ramanujan \(\tau\)-function of factorials
Cites Work
This page was built for publication: Sums of factorials in binary recurrence sequences