An upper bound for the g.c.d. of \(a^n-1\) and \(b^n -1\) (Q1566412)

From MaRDI portal
Revision as of 03:08, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An upper bound for the g.c.d. of \(a^n-1\) and \(b^n -1\)
scientific article

    Statements

    An upper bound for the g.c.d. of \(a^n-1\) and \(b^n -1\) (English)
    0 references
    0 references
    0 references
    0 references
    2 June 2003
    0 references
    Recently, \textit{P. Corvaja} and \textit{U. Zannier} [Invent. Math. 149, No. 2, 431--451 (2002; Zbl 1026.11021)] proved a remarkable result inter alia entailing that if \(a^n-1\) divides \(b^n-1\) for infinitely many positive integers \(n\) then \(a\) and \(b\) are multiplicatively dependent. Here the authors show that the techniques of the general argument may be applied quantitatively, here to prove that if \(a\) and \(b\) are multiplicatively independent then, for every \(\varepsilon>0\) and \(n\) sufficiently large, \(\gcd(a^n-1,b^n-1)\) is no greater than \(\exp(\varepsilon n)\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references