Two equations for linear recurrence sequences
V. Losert (2005)
Acta Arithmetica
Similarity:
V. Losert (2005)
Acta Arithmetica
Similarity:
Andrica, Dorin, Tudor, Gheorghe M. (2004)
General Mathematics
Similarity:
Szalay, László (2007)
Annales Mathematicae et Informaticae
Similarity:
T. N. Shorey (1975-1976)
Séminaire Delange-Pisot-Poitou. Théorie des nombres
Similarity:
Zdeněk Polický (2005)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
In this paper the special diophantine equation with integer coefficients is discussed and integer solutions are sought. This equation is solved completely just for four prime divisors of .
Grytczuk, Aleksander (2006)
Annales Mathematicae et Informaticae
Similarity:
Pingzhi Yuan, Yuan Li (2009)
Acta Arithmetica
Similarity:
Luo, Jiagui, Yuan, Pingzhi (2010)
Journal of Integer Sequences [electronic only]
Similarity:
Pingzhi Yuan, Jiagui Luo (2010)
Acta Arithmetica
Similarity:
Muriefah, Fadwa S.Abu, Bugeaud, Yann (2006)
Revista Colombiana de Matemáticas
Similarity:
Florian Luca, T. N. Shorey (2008)
Acta Arithmetica
Similarity:
D. Poulakis, P. G. Walsh (2006)
Colloquium Mathematicae
Similarity:
Let p denote a prime number. P. Samuel recently solved the problem of determining all squares in the linear recurrence sequence {Tₙ}, where Tₙ and Uₙ satisfy Tₙ² - pUₙ² = 1. Samuel left open the problem of determining all squares in the sequence {Uₙ}. This problem was recently solved by the authors. In the present paper, we extend our previous joint work by completely solving the equation Uₙ = bx², where b is a fixed positive squarefree integer. This result also extends previous work...
Susil Kumar Jena (2014)
Bulletin of the Polish Academy of Sciences. Mathematics
Similarity:
The Diophantine equation A² + nB⁴ = C³ has infinitely many integral solutions A, B, C for any fixed integer n. The case n = 0 is trivial. By using a new polynomial identity we generate these solutions, and then give conditions when the solutions are pairwise co-prime.