Let $ \{F_n\}_{n\geq 0} $ be a sequence of Fibonacci numbers defined by $$ F_{0}=0, ~ F_{1}=1 ~~ \text{and} ~~ F_{n} = F_{n-1}+ F_{n-2} ~~ \text{for} ~~ n\geq 2. $$ In this research, we find all integers $c$ with at least ...