SOLVING n(n + d) ⋯ (n + (k - 1)d) = by<sup>2</sup>WITH P(b) ≤ Ck (Q3116594)
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: SOLVING n(n + d) ⋯ (n + (k - 1)d) = by2WITH P(b) ≤ Ck |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | SOLVING n(n + d) ⋯ (n + (k - 1)d) = by<sup>2</sup>WITH P(b) ≤ Ck |
scientific article |
Statements
SOLVING n(n + d) ⋯ (n + (k - 1)d) = by<sup>2</sup>WITH P(b) ≤ Ck (English)
0 references
24 February 2012
0 references
Diophantine equations
0 references
arithmetic progression
0 references
large prime divisiors
0 references
0 references
