Page 1 Next

Displaying 1 – 20 of 29

Showing per page

Smooth solutions to the a b c equation: the x y z Conjecture

Jeffrey C. Lagarias, Kannan Soundararajan (2011)

Journal de Théorie des Nombres de Bordeaux

This paper studies integer solutions to the a b c equation A + B + C = 0 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 larger than ( log H ( A , B , C ) ) κ , for a given finite κ . We show that the a b c Conjecture implies that for any fixed κ < 1 the equation has only finitely many primitive solutions. We also discuss a conditional result, showing that the Generalized Riemann hypothesis (GRH) implies that for any fixed κ > 8 the a b c equation has infinitely many primitive solutions....

Sums and differences of power-free numbers

Julia Brandes (2015)

Acta Arithmetica

We employ a generalised version of Heath-Brown's square sieve in order to establish an asymptotic estimate of the number of solutions a, b ∈ ℕ to the equations a + b = n and a - b = n, where a is k-free and b is l-free. This is the first time that this problem has been studied with distinct powers k and l.

Currently displaying 1 – 20 of 29

Page 1 Next