The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 161 –
180 of
239
Let and define , the -generalized Fibonacci sequence whose terms satisfy the recurrence relation , with initial conditions ( terms) and such that the first nonzero term is . The sequences and are the known Fibonacci and Tribonacci sequences, respectively. In 2005, Noe and Post made a conjecture related to the possible solutions of the Diophantine equation . In this note, we use transcendental tools to provide a general method for finding the intersections which gives evidence supporting...
We completely solve the Diophantine equations (for q = 17, 29, 41). We also determine all and , where are fixed primes satisfying certain conditions. The corresponding Diophantine equations x² + C = yⁿ may be studied by the method used by Abu Muriefah et al. (2008) and Luca and Togbé (2009).
In this paper, we find all Pell and Pell-Lucas numbers written in the form , in nonnegative integers , , , with .
Currently displaying 161 –
180 of
239