SOLVING n(n + d) ⋯ (n + (k - 1)d) = by<sup>2</sup>WITH P(b) ≤ Ck (Q3116594): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 10:46, 5 March 2024
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
