Log In | Sign Up | Help
Upload_transparent

Your document has been indexed by the following search engines:

Google Bot has been here 7 times.

  • First crawled about 1 month ago.
  • Last crawled 1 day ago.

Yahoo! Bot has been here 22 times.

  • First crawled 2 months ago.
  • Last crawled 8 days ago.

MSN Bot has been here 10 times.

  • First crawled 2 months ago.
  • Last crawled 16 days ago.

Cuil Bot has been here 1 time.

  • First crawled about 1 month ago.
Latest Searches Leading to this Doc
abc conjecture proof
abc conjecture triples all
abc 120 triples
abc conjecture triple
noam elkies fourth power
catalan conjecture for special cases solution
abc hit gcd
fermat-catalan
abc conjecture
These queries are updated daily.

The ABC-conjecture

The product of the distinct primes in a number is called the
radical of that number. Notation: rad(). For example,
rad(22×34) = 2×3 = 6, rad(2×3×52) = 2×3×5 = 30.
I Three positive integers A,B, C are called ABC-triple if they
are coprime, A < B and
A + B = C
I Compute rad(ABC) and check whether rad(ABC) < C. If
this inequality is true we say that we have an ABC-hit!
I Among all 15 × 106 ABC-triples with C < 10000 we have 120
ABC-hits.
I Among all 380 × 106 ABC-triples with C < 50000 we have
276 hits.
Theorem: There are infinitely many ABC-hits.
ABC-Conject ure (Masser-Oesterl´e, 1985): Let  > 1. Then,
with finitely many exceptions we have C < rad(ABC).

  • Send This
  • Add_to_favs_transparent
  • Embed
  • Download
  • Flag
  • Add to Favorites

Scribd requires Javascript. Please enable Javascript in your browser.

Document Information

86 Views | 0 Likes | 0 Comments | 0 Favorites

Added By
Description

The product of the distinct primes in a number is called the
radical of that number. Notation: rad(). For example,
rad(22×34) = 2×3 = 6, rad(2×3×52) = 2×3×5 = 30.
I Three positive integers A,B, C are called ABC-triple if they
are coprime, A < B and
A + B = C
I Compute rad(ABC) and check whether rad(ABC) < C. If
this inequality is true we say that we have an ABC-hit!
I Among all 15 × 106 ABC-triples with C < 10000 we have 120
ABC-hits.
I Among all 380 × 106 ABC-triples with C < 50000 we have
276 hits.
Theorem: There are infinitely many ABC-hits.
ABC-Conject ure (Masser-Oesterl´e, 1985): Let  > 1. Then,
with finitely many exceptions we have C < rad(ABC).

Pdf_16x16 65 Pages


Date Added

2 months ago

Category
Tags
Groups
Type

Academic Paper

Copyright

Attribution Non-commercial

More info »