Almost perfect powers in arithmetic progression
N. Saradha, T. N. Shorey (2001)
Acta Arithmetica
Similarity:
Displaying similar documents to “Almost squares in arithmetic progression (II)”
Almost perfect powers in arithmetic progression
Squares in arithmetic progression with at most two terms omitted
Shanta Laishram, T. N. Shorey (2008)
Acta Arithmetica
Similarity:
The equation n(n+d) ⋯ (n+(k-1)d) = by² with ω(d) ≤ 6 or d ≤ 10¹⁰
Shanta Laishram, T. N. Shorey (2007)
Acta Arithmetica
Similarity:
Squares in products in arithmetic progression with at most one term omitted and common difference a prime power
Shanta Laishram, T. N. Shorey, Szabolcs Tengely (2008)
Acta Arithmetica
Similarity:
Some extensions and refinements of a theorem of Sylvester
N. Saradha, T. N. Shorey, R. Tijdeman (2002)
Acta Arithmetica
Similarity:
On some arithmetic properties of polynomial expressions involving Stirling numbers of the second kind
Martin Klazar, Florian Luca (2003)
Acta Arithmetica
Similarity:
Application of the explicit abc-conjecture to two Diophantine equations
N. Saradha (2012)
Acta Arithmetica
Similarity:
Squares in Lehmer sequences and some Diophantine applications
Florian Luca, P. G. Walsh (2001)
Acta Arithmetica
Similarity:
Finding almost squares. V.
Chan, Tsz Ho (2010)
Integers
Similarity:
Squares in Lehmer sequences and the Diophantine equation Ax⁴ - By² = 2
Pingzhi Yuan, Yuan Li (2009)
Acta Arithmetica
Similarity:
On the exponential Diophantine equations of the form .
Acu, Dumitru (2001)
General Mathematics
Similarity:
Solving an exponential Diophantine equation
Mario Huicochea (2010)
Acta Arithmetica
Similarity:
An extension of a theorem of Euler
Noriko Hirata-Kohno, Shanta Laishram, T. N. Shorey, R. Tijdeman (2007)
Acta Arithmetica
Similarity:
On the Diophantine equation x² - dy⁴ = 1 with prime discriminant II
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...
The Diophantine equation x(x+1)...(x+(m-1)) + r = yⁿ
Yu. F. Bilu, M. Kulkarni, B. Sury (2004)
Acta Arithmetica
Similarity:
Mean square value of exponential sums related to the representation of integers as sums of squares
Jens Marklof (2005)
Acta Arithmetica
Similarity: