Counting Smooth Solutions to the Equation A+B=C

Abstract

This paper studies integer solutions to the Diophantine equation A+B=C in which none of A, B, C have a large prime factor. We set H(A, B,C) = max(|A|, |B|, |C|), and consider primitive solutions (gcd}(A, B, C)=1) having no prime factor p larger than (log H(A, B,C))^K, for a given finite K. On the assumption that the Generalized Riemann hypothesis (GRH) holds, we show that for any K > 8 there are infinitely many such primitive solutions having no prime factor larger than (log H(A, B, C))^K. We obtain in this range an asymptotic formula for the number of such suitably weighted primitive solutions.

35 pages latex; v2 corrected misprints

Cited by in corpus (8)

• Solving S-unit, Mordell, Thue, Thue-Mahler and generalized Ramanujan-Nagell equations via Shimura-Taniyama conjecture
• Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers
• Sur les solutions friables de l'équation a+b=c
• On finding many solutions to S-unit equations by solving linear equations on average
• Sommes friables d'exponentielles et applications
• Many solutions to the $S$-unit equation $a+1=c$
• Counting solvable $S$-unit equations
• Statistics of Different Reduction Types of Fermat Curves