Sets of integers and quasi-integers with pairwise common divisor
This paper studies integer solutions to the equation in which none of have a large prime factor. We set , and consider primitive solutions () having no prime factor larger than , for a given finite . We show that the Conjecture implies that for any fixed 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 the equation has infinitely many primitive solutions....
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.