The Fibonacci version of the Brocard-Ramanujan Diophantine equation (Q555198)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Fibonacci version of the Brocard-Ramanujan Diophantine equation |
scientific article |
Statements
The Fibonacci version of the Brocard-Ramanujan Diophantine equation (English)
0 references
22 July 2011
0 references
Let \(F_k\) denote the \(k\)-th Fibonacci number. In this note the author considers the Diophantine equation \[ F_n \ldots F_1 + 1 = F_m^2 \] in unknown positive integers \(n,m\), which is the Fibonacci version of the Brocard-Ramanujan Diophantine equation \(n! + 1 = m^2\). He proves the unsolubility of a more general equation, namely, it is proved that the product of \(k\) consecutive Fibonacci numbers \(+ 1\) is never a square of a Fibonacci number. The proof depends on the Primitive Divisor Theorem.
0 references
Diophantine equation
0 references
Fibonacci numbers
0 references
Brocard-Ramanujan
0 references