THE MOST BEAUTIFUL AND STRONGEST PAPAVA'S CONJECTURE IN THE XXI CENTURY.
Definition. For an integer n≥2, let gpf(n) denote the greatest prime factor of n.
Conjecture (Papava). If a,b,c∈N, a+b=c, gcd(a,b)=1 then
c<(gpf(a)gpf(b)gpf(c))³.
Result 1. Fermat's Last Theorem;
Result 2. Beal conjecture (Prize $1000 000);
Result 3. ABC conjecture when ε=2;
...
|