Almost squares in arithmetic progression (II)
The authors consider the Diophantine equation \[ n(n+d)\cdots (n+(k-1)d)=by^2 \] in positive integers \(n\), \(d\), \(k\), \(b\), \(y\) where \(b\) is square-free and has all its prime factors \(\leq k\) (notation: \(\text{P}(b)\leq k\)). Shorey and Tijdeman (1990) proved that this equation, with \(n\) and \(d\) coprime, implies that \(k\) is bounded by an effectively computable number depending only on the number of distinct prime divisors of \(d\); the same conclusion was obtained by Shorey (1999) under the weaker assumption \(d\nmid n\). In this paper the authors solve completely several cases of the above equation, for example the cases \(4\leq k \leq 9\) with \(\text{P}(b)<k\), when \(d\) is a prime power which does not divide \(n\) (the only solution occurs for \(n=75\)). The proofs use in particular lower bounds of linear forms in logarithms, classical tools in Diophantine approximation and explicit computation of the integer points on some elliptic curves (using SIMATH). Part I, cf. Compos. Math. 138, 73-111 (2003; Zbl 1036.11007).
- Variations on a theme of Runge: effective determination of integral points on certain varieties
- Analytic number theory in India during 2001-2010
- Almost squares in arithmetic progression. III
- Solving \(n(n + d) \cdots (n + (k - 1)d) = by^{2}\) with \(P(b) \leq Ck\).
- Squares in arithmetic progression with at most two terms omitted
- Squares in products in arithmetic progression with at most one term omitted and common difference a prime power
- scientific article; zbMATH DE number 1993157 (Why is no real title available?)
- An estimate for the length of an arithmetic progression the product of whose terms is almost square
- The Diophantine equation f(x)=g(y)$f(x)=g(y)$ for polynomials with simple rational roots
This page was built for publication: Almost squares in arithmetic progression (II)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4484465)