Smooth solutions to the abc equation: the xyz conjecture
From MaRDI portal
(Redirected from Publication:449701)
Smooth solutions to the \(abc\) equation: the \(xyz\) conjecture
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3867426 (Why is no real title available?)
- scientific article; zbMATH DE number 3908530 (Why is no real title available?)
- scientific article; zbMATH DE number 3908531 (Why is no real title available?)
- scientific article; zbMATH DE number 4042003 (Why is no real title available?)
- scientific article; zbMATH DE number 4093562 (Why is no real title available?)
- scientific article; zbMATH DE number 3708485 (Why is no real title available?)
- scientific article; zbMATH DE number 1060876 (Why is no real title available?)
- scientific article; zbMATH DE number 783336 (Why is no real title available?)
- scientific article; zbMATH DE number 5210843 (Why is no real title available?)
- Bounds for the solutions of S-unit equations and decomposable form equations
- Counting smooth solutions to the equation \(A+B=C\)
- Friable exponential sums with rational arguments
- Integers free of large prime factors and the Riemann hypothesis
- Integers without large prime factors
- On $abc$ and discriminants
- On Integers Free of Large Prime Factors
- On the Local Behavior of Ψ(x, y)
- On the Oesterlé-Masser conjecture
- On the \(abc\) conjecture. II.
- On the abc conjecture in algebraic number fields
- Solving exponential diophantine equations using lattice basis reduction algorithms
- Sommes sans grand facteur premier
- Statistical properties of friable integers
- The Hardy-Littlewood method.
- Trigonometric series with arithmetical coefficients
- Twists of \(X(7)\) and primitive solutions to \(x^2+y^3=z^7\)
- Two \(S\)-unit equations with many solutions
- \(ABC\) implies no ``Siegel zeros for \(L\)-functions of characters with negative discriminant
Cited in
(9)- Smooth neighbors
- Some applications of the \(abc\)-conjecture to the Diophantine equation \(qy^{m}=f(x)\)
- Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers
- On the number of ABC solutions with restricted radical sizes
- On the abc$abc$ conjecture in algebraic number fields
- Friable density
- Averaged forms of two conjectures of Erdős and Pomerance, and their applications
- Counting smooth solutions to the equation \(A+B=C\)
- On friable solutions of the equation \(a+b=c\)
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)