Sums and Products with Smooth Numbers

2010/10/16 by Banks, William D., Covert, David
#Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1010.3322

Abstract

We estimate the sizes of the sumset A + A and the productset A ⋅ A in the special case that A = S (x, y), the set of positive integers n less than or equal to x, free of prime factors exceeding y.

Related

• A Combinatorial Method for Counting Smooth Numbers in Sets of Integers
• Representing integers as linear combinations of power products
• Smooth sums with small spacings
• A note on product sets of rationals
• Representing an integer as the sum of a prime and the product of two small factors