AbstractWe prove that the product of k consecutive terms of a primitive arithmetic progression is never a perfect fifth power when 3⩽k⩽54. We also provide a more precise statement, concerning the case where the product is an “almost” fifth power. Our theorems yield considerable improvements and extensions, in the fifth power case, of recent results due to Győry, Hajdu and Pintér. While the earlier results have been proved by classical (mainly algebraic number theoretical) methods, our proofs are based upon a new tool: we apply genus 2 curves and the Chabauty method (both the classical and the elliptic verison)
Let R k (n) denote the number of representations of a natural number n as the sum of three cubes and...
AbstractThe Erdős–Moser conjecture states that the Diophantine equation Sk(m)=mk, where Sk(m)=1k+2k+...
AbstractIn this paper, we show that the product of sufficiently many distinct members of a Lucas seq...
AbstractWe prove that the product of k consecutive terms of a primitive arithmetic progression is ne...
AbstractLet k ≥ 4 be an integer. We find all integers of the form byl where l ≥ 2 and the greatest p...
Perfect powers in products of terms in an arithmetical progression III by T. N. Shorey (Bombay) and ...
AbstractWe show that there exists an upper bound for the number of squares in arithmetic progression...
In this paper, using a deep result on the existence of primitive divisors of Lehmer numbers due to Y...
In this paper, using a deep result on the existence of primitive divisors of Lehmer numbers due to Y...
AbstractLet a, b, c, d be given nonnegative integers with a,d⩾1. Using Chebyshevʼs inequalities for ...
AbstractIt is proven that the Diophantine equation x2 + 11 = 3n has as its only solution (x, n) = (4...
AbstractIn this paper, we construct, given an integer r≥5, an infinite family of r non-overlapping b...
AbstractErdős estimated the maximal number of integers selected from {1,2,…,N}, so that none of them...
§1. Introduction, By a remarkable result of Erdos and Selfridge [3] in 1975. the diophantine equatio...
In this paper I make the following conjecture: for any arithmetic progression a + b*k, where at leas...
Let R k (n) denote the number of representations of a natural number n as the sum of three cubes and...
AbstractThe Erdős–Moser conjecture states that the Diophantine equation Sk(m)=mk, where Sk(m)=1k+2k+...
AbstractIn this paper, we show that the product of sufficiently many distinct members of a Lucas seq...
AbstractWe prove that the product of k consecutive terms of a primitive arithmetic progression is ne...
AbstractLet k ≥ 4 be an integer. We find all integers of the form byl where l ≥ 2 and the greatest p...
Perfect powers in products of terms in an arithmetical progression III by T. N. Shorey (Bombay) and ...
AbstractWe show that there exists an upper bound for the number of squares in arithmetic progression...
In this paper, using a deep result on the existence of primitive divisors of Lehmer numbers due to Y...
In this paper, using a deep result on the existence of primitive divisors of Lehmer numbers due to Y...
AbstractLet a, b, c, d be given nonnegative integers with a,d⩾1. Using Chebyshevʼs inequalities for ...
AbstractIt is proven that the Diophantine equation x2 + 11 = 3n has as its only solution (x, n) = (4...
AbstractIn this paper, we construct, given an integer r≥5, an infinite family of r non-overlapping b...
AbstractErdős estimated the maximal number of integers selected from {1,2,…,N}, so that none of them...
§1. Introduction, By a remarkable result of Erdos and Selfridge [3] in 1975. the diophantine equatio...
In this paper I make the following conjecture: for any arithmetic progression a + b*k, where at leas...
Let R k (n) denote the number of representations of a natural number n as the sum of three cubes and...
AbstractThe Erdős–Moser conjecture states that the Diophantine equation Sk(m)=mk, where Sk(m)=1k+2k+...
AbstractIn this paper, we show that the product of sufficiently many distinct members of a Lucas seq...