Abc conjecture: Difference between revisions
(Created page with '==Statement== For every <math>\epsilon > 0</math>, there exists a constant <math>C_\epsilon</math> such that for any three relatively prime integers <math>a,b,c</math> such that...') |
|||
Line 7: | Line 7: | ||
we have the inequality: | we have the inequality: | ||
<math>\max \left( |a|, |b|, |c| \right) \le C_\epsilon \prod_{p|abc} p^{1 + \epsilon}</math>. | <math>\max \left( |a|, |b|, |c| \right) \le C_\epsilon \prod_{p|abc} p^{1 + \epsilon}</math> | ||
where the indicated product is only over ''prime'' divisors of the product <math>abc</math>. | |||
==Related facts== | ==Related facts== |
Latest revision as of 17:12, 13 August 2010
Statement
For every , there exists a constant such that for any three relatively prime integers such that:
,
we have the inequality:
where the indicated product is only over prime divisors of the product .
Related facts
Analogous facts over other rings
- Mason-Stothers theorem states that the analogous statement holds over polynomial rings over fields with absolute value replaced by degree -- in fact, we do not even need the .
Weaker facts and conjectures
- Logarithmic lower bound on number of non-Wieferich primes
- The abc conjecture implies Fermat's last theorem for sufficiently large primes. Fermat's last theorem was proved by Wiles in 1994, though the abc conjecture is still open.