J. Integer Seq. 14(9), Article 11.9.3, 12 p., electronic only (2011)
Summary
Summary: In this paper, by using some congruences concerning with Fibonacci and Lucas numbers, we completely solve the Diophantine equations $L_{n} = 2L_{m}x^{2}, F_{n} = 2F_{m}x^{2}, L_{n} = 6L_{m}x^{2}, F_{n} = 3F_{m}x^{2}$, and $F_{n} = 6F_{m}x^{2}$.