Coarse-grained integers - Smooth? Rough? Both!

Details Coarse-grained integers - Smooth? Rough? Both! Coarse-grained integers - Smooth? Rough? Both!

2010-03-10

arxiv.org/abs/1003.2165v2

Mathematics

Number Theory

Scientific paper

We count ]B, C]-grained, k-factor integers which are simultaneously B-rough and C-smooth and have a fixed number k of prime factors. Our aim is to exploit explicit versions of the prime number theorem as much as possible to get good explicit bounds for the count of such integers. This analysis was inspired by certain inner procedures in the general number field sieve. The result should at least provide some insight in what happens there. We estimate the given count in terms of some recursively defined functions. Since they are still difficult to handle, only another approximation step reveals their orders. Finally, we use the obtained bounds to perform numerical experiments that show how good the desired count can be approximated for the parameters of the general number field sieve in the mentioned inspiring application.

Affiliated with

Also associated with

No associations

Rating

Coarse-grained integers - Smooth? Rough? Both! 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 Coarse-grained integers - Smooth? Rough? Both!, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coarse-grained integers - Smooth? Rough? Both! will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-342410