No label defined (Q3837787)

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 1182955
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1182955

      Statements

      9 September 2001
      0 references
      greatest prime factor
      0 references
      superelliptic Diophantine equations
      0 references
      0 references
      Using a generalization of the ineffective Thue-Siegel method, K. Mahler proved in 1953 that the greatest prime factor of \(ax^m+by^n\), where \(x\), \(y\), with \(\gcd(x,y)=1\), \(m\geq 2\), \(n\geq 3\), \(a\) and \(b\) are rational integers, tends to infinity as \(X:= \max\{|x|,|y|\} \to \infty\). Using results on linear forms in logarithms, in 1976 Kotov obtained the first effective estimate on this problem: \[ P(ax^m+by^n) \geq c_1 ((\log \log X) (\log \log \log X))^{1/2} \] whenever \(X\geq c_2\). The author obtains the improvement \({} \geq c_3 \log \log X\) and gives an explicit value for \(c_3\). The proof uses his recent bounds for generalized superelliptic equations. For the entire collection see [Zbl 0887.00013].
      0 references

      Identifiers