Squares in products with terms in an arithmetic progression (Q4236027)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1268466
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Squares in products with terms in an arithmetic progression |
scientific article; zbMATH DE number 1268466 |
Statements
Squares in products with terms in an arithmetic progression (English)
0 references
10 September 1999
0 references
squares
0 references
arithmetic progression
0 references
product of consecutive positive integers
0 references
diophantine equations
0 references
0.8464741110801697
0 references
0.840164840221405
0 references
0.839936375617981
0 references
Let \(d,k,l,n\) and \(y\) be positive integers, with \(k\) and \(l\) at least 2 and \(n,d\) relatively prime. \textit{P. Erdős} [J. Lond. Math. Soc. 14, 194-198 (1939; Zbl 0021.20704)] and \textit{O. Rigge} [9th Congr. Math. Scand. 155-160; Zbl 0021.01003)] proved that a product of two or more consecutive positive integers is never a square. Further, \textit{P. Erdős} and \textit{J. Selfridge} [Ill. J. Math. 19, 292-301 (1975; Zbl 0295.10017)] proved that the product of \(k\) consecutive integers is never a power. In a previous paper [\textit{N. Saradha}, Acta Arith. 82, 147-172 (1997)] the author showed that the equation \[ n(n+d) \dots\bigl(n+ (k-1)d \bigr)= y^l \] with integers \(k\geq 3\), \(l>2\), \(n\geq 1\), \(y\geq 1\) never holds for \(1<d\leq 6\). In the present paper the author sets \(l=2\) and shows that the resulting equation has no solutions for \(1<d\leq 22\). This is a consequence of the main theorem of the paper: Let \(k\geq 3\), \(n\geq 1\) and \(1<d\leq 22\). Then there exists a prime exceeding \(k\) which divides \(n(n+d)\dots(n+(k-1)d)\) to an odd power except when \((n,d,k)\) is one of the triples (2, 7, 3), (18, 7, 3) or (64, 17, 3).
0 references