Let P and Q be nonzero integers. The sequences of generalized Fibonacci and Lucas numbers are defined by U₀ = 0, U₁ = 1 and for n ≥ 1, and V₀ = 2, V₁ = P and for n ≥ 1, respectively. In this paper, we assume that P ≥ 1, Q is odd, (P,Q) = 1, Vₘ ≠ 1, and . We show that there is no integer x such that when m ≥ 1 and r is an even integer. Also we completely solve the equation for m ≥ 1 and r ≥ 1 when Q ≡ 7 (mod 8) and x is an even integer. Then we show that when P ≡ 3 (mod 4) and Q ≡ 1 (mod...
Let P and Q be nonzero integers. The generalized Fibonacci and Lucas sequences are defined respectively as follows: U₀ = 0, U₁ = 1, V₀ = 2, V₁ = P and , for n ≥ 1. In this paper, when w ∈ 1,2,3,6, for all odd relatively prime values of P and Q such that P ≥ 1 and P² + 4Q > 0, we determine all n and m satisfying the equation Uₙ = wUₘx². In particular, when k|P and k > 1, we solve the equations Uₙ = kx² and Uₙ = 2kx². As a result, we determine all n such that Uₙ = 6x².
In this study, we determine when the Diophantine equation has an infinite number of positive integer solutions and for Moreover, we give all positive integer solutions of the same equation for in terms of generalized Fibonacci sequence. Lastly, we formulate a conjecture related to the Diophantine equation .
Download Results (CSV)