On a combinatorial method for counting smooth numbers in sets of integers

DOI10.1016/J.JNT.2007.01.004zbMath1135.11011arXivmath/0311226OpenAlexW2037164765MaRDI QIDQ2466036

Ernie Croot

Publication date: 11 January 2008

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0311226

zbMATH Keywords

sumsetslarge sievesmooth numberslocal global set

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Applications of sieve methods (11N36) Distribution of integers with specified multiplicative constraints (11N25)

Related Items (3)

Communication complexity of some number theoretic functions ⋮ Numbers in a given set with (or without) a large prime factor ⋮ On sums of monotone functions over smooth numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On sums of sequences of integers. II,III
• On divisors of sums of integers. I
• On divisors of sums of integers. III
• On divisors of sums of integers. V
• On sums of sequences of integers, I
• On Divisors of Sums of Integers IV
• Sommes sans grand facteur premier
• Shifted primes without large prime factors
• On the Distribution of the Number of Prime Factors of Sums a + b

This page was built for publication: On a combinatorial method for counting smooth numbers in sets of integers