A Combinatorial Method for Counting Smooth Numbers in Sets of Integers

Details A Combinatorial Method for Counting Smooth Numbers in Sets of Integers A Combinatorial Method for Counting Smooth Numbers in Sets of Integers

2003-11-13

arxiv.org/abs/math/0311226v2

Mathematics

Number Theory

Light Corrections

Scientific paper

In this paper we present a method for producing asymptotic estimates for the number of integers in a given S having only ``small'' prime factors. The conditions that need to be verified are simpler than those required by other methods, and we apply our result to give an easy proof of a result which says that dense subsets A and B of {1,2,...,x} always produce asymptotically the expected number of x^r - smooth sums a+b, where a in A and b in B. Recall that a number n is said to be y-smooth if all its prime divisors are at most y.

Affiliated with

Also associated with

No associations

Rating

A Combinatorial Method for Counting Smooth Numbers in Sets of Integers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Combinatorial Method for Counting Smooth Numbers in Sets of Integers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Combinatorial Method for Counting Smooth Numbers in Sets of Integers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-47419