The Diophantine equation \((ax^k-1)(by^k-1)=abz^k-1\) (Q2637188)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The Diophantine equation \((ax^k-1)(by^k-1)=abz^k-1\)
scientific article

    Statements

    The Diophantine equation \((ax^k-1)(by^k-1)=abz^k-1\) (English)
    0 references
    0 references
    7 February 2014
    0 references
    For the background on this paper see the related one by \textit{E. G. Goedhart} and \textit{H. G. Grundman}, J. Number Theory 154, 74--81 (2015; Zbl 1360.11059). Here the author proves that for \(a,b\) be positive integers, the equation \[ (ax^k-1)(by^k-1)=abz^k-1 \] has no solutions in integers \(x\), \(y\), \(z\) and \(k\) with \(| x| >1\), \(| y| >1\) and \(k\geq 4\).
    0 references
    exponential Diophantine equation
    0 references
    rational approximation
    0 references
    continued fraction
    0 references

    Identifiers