The Fibonacci version of the Brocard-Ramanujan Diophantine equation
From MaRDI portal
Publication:555198
DOI10.4171/PM/1887zbMath1272.11051MaRDI QIDQ555198
Publication date: 22 July 2011
Published in: Portugaliae Mathematica. Nova Série (Search for Journal in Brave)
Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Diophantine equations (11D99)
Related Items (4)
Variations on the Brocard-Ramanujan equation ⋮ Product of arbitrary Fibonacci numbers with distance 1 to Fibonomial coefficient ⋮ Diophantine equations with binary recurrences associated to the Brocard-Ramanujan problem ⋮ Unnamed Item
Cites Work
- Fibonacci numbers at most one away from a perfect power
- On the Brocard-Ramanujan Diophantine equation \(n! + 1 = m^2\)
- Variants of the Diophantine equation \(n! + 1 = y^2\)
- Existence of primitive divisors of Lucas and Lehmer numbers
- Diophantine equations with products of consecutive terms in Lucas sequences II
- My Numbers, My Friends
- Unnamed Item
- Unnamed Item
This page was built for publication: The Fibonacci version of the Brocard-Ramanujan Diophantine equation
