2023/103/3-4 (7)
—
DOI: 10.5486/PMD.2023.9498
—
pp. 407-434
On the Diophantine equation $F_{n_1} + F_{n_2} + F_{n_3} = p_1^{z_1} \cdots p_{s}^{z_{s}}$
Abstract:
Let $F_{n}$ denote the $n$-th Fibonacci number, and $p_i$ the $i$-th prime number. In this paper, we consider the Diophantine equation $F_{n_1}+F_{n_2}+F_{n_3}=p_1^{z_1}\cdots p_{s}^{z_s}$ in non-negative integers $n_1\geq n_2\geq n_3\geq 0$ and non-negative integers $z_i$ with $1\leq i\leq s$. In particular, we completely solve the case that $s=12$.
Keywords: Diophantine equations, linear forms in logarithms, recurrence sequences, Fibonacci sequences
Mathematics Subject Classification: 11D61, 11B39, 11J86, 11Y50
