arXiv · 0911.4147
Smooth solutions to the abc equation: the xyz Conjecture
Abstract
This paper studies integer solutions to the ABC equation A+B+C=0 in which none of A, B, C has a large prime factor. Set H(A,B, C)= max(|A|,|B|,|C|) and set the smoothness S(A, B, C) to be the largest prime factor of ABC. We consider primitive solutions (gcd(A, B, C)=1) having smoothness no larger than a fixed power p of log H. Assuming the abc Conjecture we show that there are finitely many solutions if p<1. We discuss a conditional result, showing that the Generalized Riemann Hypothesis (GRH) implies there are infinitely many primitive solutions when p>8. We sketch some details of the proof of the latter result.
Explore related subjects
Keep this discovery
Jeffrey C. Lagarias, K. Soundararajan. 2011-07-07. Smooth solutions to the abc equation: the xyz Conjecture. https://arxiv.org/abs/0911.4147
Cite the original work for its findings. Save a collection to share your selection of sources.