SOLVING n(n + d) ⋯ (n + (k - 1)d) = by2WITH P(b) ≤ Ck

DOI10.1142/S1793042112500091zbMath1268.11045OpenAlexW2039999473MaRDI QIDQ3116594

Shanta Laishram, N. Saradha, Michael Filaseta

Publication date: 24 February 2012

Published in: International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793042112500091

zbMATH Keywords

arithmetic progressionDiophantine equationslarge prime divisiors

Mathematics Subject Classification ID

Counting solutions of Diophantine equations (11D45) Diophantine equations in many variables (11D72) Arithmetic progressions (11B25)

Related Items (4)

Products of consecutive values of some quartic polynomials ⋮ The Diophantine equation f(x)=g(y)$f(x)=g(y)$ for polynomials with simple rational roots ⋮ On classifying Laguerre polynomials which have Galois group the alternating group ⋮ On Galois groups of a one-parameter orthogonal family of polynomials

Cites Work

• The greatest prime divisor of a product of terms in an arithmetic progression
• On the practical solution of the Thue equation
• Solving Thue equations of high degree
• POWERS FROM PRODUCTS OF CONSECUTIVE TERMS IN ARITHMETIC PROGRESSION
• Perfect powers from products of consecutive terms in arithmetic progression
• Contributions towards a conjecture of Erdos on perfect powers in arithmetic progression
• Primes in arithmetic progressions

This page was built for publication: SOLVING n(n + d) ⋯ (n + (k - 1)d) = by²WITH P(b) ≤ Ck