Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Some Remarks on the abc-Conjecture

J. Browkin and J. Brzeziński
Mathematics of Computation
Vol. 62, No. 206 (Apr., 1994), pp. 931-939
DOI: 10.2307/2153551
Stable URL: http://www.jstor.org/stable/2153551
Page Count: 9
  • Read Online (Free)
  • Download ($34.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available

Abstract

Let r(x) be the product of all distinct primes dividing a nonzero integer x. The abc-conjecture says that if a, b, c are nonzero relatively prime integers such that a + b + c = 0, then the biggest limit point of the numbers log max(|a|, |b|, |c|)/log r(abc) equals 1. We show that in a natural analogue of this conjecture for n ≥ 3 integers, the largest limit point should be replaced by at least 2n - 5. We present an algorithm leading to numerous examples of triples a, b, c for which the above quotients strongly deviate from the conjectural value 1.

Page Thumbnails

  • Thumbnail: Page 
931
    931
  • Thumbnail: Page 
932
    932
  • Thumbnail: Page 
933
    933
  • Thumbnail: Page 
934
    934
  • Thumbnail: Page 
935
    935
  • Thumbnail: Page 
936
    936
  • Thumbnail: Page 
937
    937
  • Thumbnail: Page 
938
    938
  • Thumbnail: Page 
939
    939