Smooth solutions to the abc equation: the xyz conjecture

From MaRDI portal
Publication:449701

DOI10.5802/JTNB.757zbMATH Open1270.11032arXiv0911.4147OpenAlexW2964115536WikidataQ123312263 ScholiaQ123312263MaRDI QIDQ449701FDOQ449701

Jeffrey C. Lagarias, Kannan Soundararajan

Publication date: 31 August 2012

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0911.4147




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Smooth solutions to the \(abc\) equation: the \(xyz\) conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449701)