Diophantine equations with binary recurrences associated to the Brocard-Ramanujan problem
Summary: Applying the Primitive Divisor Theorem, we solve completely the Diophantine equation \[ G_{n_1}G_{n_2}\cdots G_{n_k}+1=G_m^2 \] in non-negative integers \(k>0, m\) and \(n_1 < n_2 < \dots < n_k\) if the binary recurrence \(\{G_n\}_{n=0}^\infty\) is either the Fibonacci sequence, or the Lucas sequence, or it satisfies the recurrence relation \(G_n=AG_{n-1} - G_{n-2}\) with \(G_0=0, G_1=1\) and an arbitrary positive integer \(A\). The more specific case \[ G_{n}G_{n+1}\dots G_{n+k-1}+1=G_m^2 \] was investigated by \textit{D. Marques} [Port. Math. (N.S.) 68, No. 2, 185--189 (2011; Zbl 1272.11051)] in the case of the Fibonacci sequence.
- Fibonacci and Lucas numbers associated with Brocard-Ramanujan equation
- scientific article; zbMATH DE number 7523832
- A Brocard-Ramanujan-type equation with Lucas and associated Lucas sequences
- The Fibonacci version of the Brocard-Ramanujan Diophantine equation
- Diophantine equations with balancing-like sequences associated to Brocard-Ramanujan-type problem
- Diophantine equations with products of consecutive members of binary recurrences
- Additive Diophantine equations with binary recurrences, \(\mathcal{S}\)-units and several factorials
- Diophantine triples with values in binary recurrences
- On the shifted product of binary recurrences
- A balancing problem on a binary recurrence and its associate
- A Brocard-Ramanujan-type equation with Lucas and associated Lucas sequences
- Fibonacci and Lucas numbers associated with Brocard-Ramanujan equation
- How can the product of two binary recurrences be constant?
- scientific article; zbMATH DE number 7012753 (Why is no real title available?)
- Product of arbitrary Fibonacci numbers with distance 1 to Fibonomial coefficient
- The Fibonacci version of a variant of the Brocard-Ramanujan Diophantine equation
- Diophantine equations with balancing-like sequences associated to Brocard-Ramanujan-type problem
- Balancing Diophantine triples with distance 1
- The Fibonacci version of the Brocard-Ramanujan Diophantine equation
- Diophantine triples with distinct binary recurrences
This page was built for publication: Diophantine equations with binary recurrences associated to the Brocard-Ramanujan problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692859)