A discovery #294 (Papava)
Definition. For an integer n≥2, let gpf(n) denote the greatest prime factor of n.
Conjecture. If a,b,c∈N, gcd(a,b)=1 and a+b=c then c<(gpf(abc))⁹.
Result 1. Fermat's Last Theorem; Result 2. Beal conjecture (Prize $1000 000); ...