SOLVING n(n + d) ⋯ (n + (k - 1)d) = by<sup>2</sup>WITH P(b) ≤ Ck (Q3116594): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: POWERS FROM PRODUCTS OF CONSECUTIVE TERMS IN ARITHMETIC PROGRESSION / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving Thue equations of high degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Perfect powers from products of consecutive terms in arithmetic progression / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The greatest prime divisor of a product of terms in an arithmetic progression / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Primes in arithmetic progressions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Contributions towards a conjecture of Erdos on perfect powers in arithmetic progression / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the practical solution of the Thue equation / rank | |||
Normal rank |
Revision as of 23:13, 4 July 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
0 references