REVIEW
Smooth solutions to the abc equation: the xyz Conjecture
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Smooth solutions to the abc equation: the xyz Conjecture
read the original 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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.