Diophantine equations with binary recurrences associated to the Brocard-Ramanujan problem (Q692859)

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.