Solving \(n(n + d) \cdots (n + (k - 1)d) = by^{2}\) with \(P(b) \leq Ck\). (Q3116594)
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 6009237
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving \(n(n + d) \cdots (n + (k - 1)d) = by^{2}\) with \(P(b) \leq Ck\). |
scientific article; zbMATH DE number 6009237 |
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
0.839294970035553
0 references
0.839294970035553
0 references
0.8246673345565796
0 references
0.8227076530456543
0 references
0.7955850958824158
0 references
