Almost squares in arithmetic progression (II) (Q4484465)

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 1927543
Language Label Description Also known as
default for all languages
No label defined
    English
    Almost squares in arithmetic progression (II)
    scientific article; zbMATH DE number 1927543

      Statements

      Almost squares in arithmetic progression (II) (English)
      0 references
      0 references
      0 references
      12 June 2003
      0 references
      diophantine exponential equations
      0 references
      almost square
      0 references
      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).
      0 references

      Identifiers