Difference between revisions of "ABC conjecture"

From Polymath1Wiki
Jump to: navigation, search
Line 1: Line 1:
The abc conjecture asserts, roughly speaking, that if a+b=c and a,b,c are coprime, then a,b,c cannot all be too smooth; in particular, the product of all the primes dividing a, b, or c has to exceed <math>c^{1-\varepsilon}</math> for any fixed <math>\varepsilon > 0</math> (if a,b,c are smooth).
+
The '''abc conjecture''' asserts, roughly speaking, that if a+b=c and a,b,c are coprime, then a,b,c cannot all be too smooth; in particular, the product of all the primes dividing a, b, or c has to exceed <math>c^{1-\varepsilon}</math> for any fixed <math>\varepsilon > 0</math> (if a,b,c are smooth).
  
 
This shows for instance that <math>(1-\varepsilon) \log N / 3</math>-smooth a,b,c of size N which are coprime cannot sum to form a+b=c.  This unfortunately seems to be too weak to be of much use for the [[finding primes]] project.
 
This shows for instance that <math>(1-\varepsilon) \log N / 3</math>-smooth a,b,c of size N which are coprime cannot sum to form a+b=c.  This unfortunately seems to be too weak to be of much use for the [[finding primes]] project.
  
# [http://en.wikipedia.org/wiki/Abc_conjecture Wikipedia page for the ABC conjecture]
+
* [[wikipedia:Abc_conjecture|Wikipedia page for the ABC conjecture]]

Revision as of 17:21, 19 August 2009

The abc conjecture asserts, roughly speaking, that if a+b=c and a,b,c are coprime, then a,b,c cannot all be too smooth; in particular, the product of all the primes dividing a, b, or c has to exceed [math]c^{1-\varepsilon}[/math] for any fixed [math]\varepsilon \gt 0[/math] (if a,b,c are smooth).

This shows for instance that [math](1-\varepsilon) \log N / 3[/math]-smooth a,b,c of size N which are coprime cannot sum to form a+b=c. This unfortunately seems to be too weak to be of much use for the finding primes project.