The greatest prime divisor of a product of terms in an arithmetic progression (Q855791)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The greatest prime divisor of a product of terms in an arithmetic progression |
scientific article; zbMATH DE number 5078186
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The greatest prime divisor of a product of terms in an arithmetic progression |
scientific article; zbMATH DE number 5078186 |
Statements
The greatest prime divisor of a product of terms in an arithmetic progression (English)
0 references
7 December 2006
0 references
The main result of this paper is the following: Theorem. Let \(d\) and \(k\) be rational integers \({}\geq 3\), then the greatest prime factor of the product \(n(n+d)\cdots (n+(k-1)d)\) is \({}>2k\), except for finitely many (explicitly given) exceptions. The proof is very delicate and contains the study of many subcases. The results used are also numerous and of a great variety.
0 references
greatest prime factor products of integers in arithmetic progressions
0 references
0 references
