|
19
|
de Bruijn, “On the number of positive integers≤ x and free of prime factors > y
– N G
- 1966
|
|
6
|
Psixyology and Diophantine Equations
– P Moree
- 1993
|
|
8
|
Approximating the number of integers free of large prime factors
– Simon Hunter, Jonathan Sorenson
- 1997
|
|
22
|
On integers free of large prime factors
– A Hildebrand, G Tenenbaum
- 1986
|
|
59
|
On a problem of Oppenheim concerning “Factorisatio Numerorum
– E R Canfield, P Erdős, C Pomerance
- 1983
|
|
18
|
Numbers with small prime factors and the least kth-power +zon-residue
– K Norton
- 1971
|
|
119
|
Prime Numbers - A Computational Perspective
– R Crandall, C Pomerance
- 2000
|
|
3
|
Multiple precision zero-finding methods and the complexity of elementary function evaluation
– R P Brent
- 1976
|
|
6
|
Integers without large prime factors, Journal de Theorie des Nombres de Bordeaux 5
– A Hildebrand, G Tenenbaum
- 1993
|
|
2
|
A fast algorithm for approximately counting smooth numbers, ANTS-IV proceedings
– J P Sorenson
- 2000
|
|
2
|
Enumerating and counting smooth integers, chapter 2
– Daniel J Bernstein
- 1995
|
|
4
|
Computing π(x
– M Deléglise, J Rivat
- 1996
|
|
2
|
Proving primality in essentially quartic time
– Daniel J Bernstein
- 2006
|
|
1
|
On the local behavior of Ψ(x,y
– Adolf Hildebrand
- 1986
|
|
7
|
Prime Sieves Using Binary Quadratic Forms
– A. O. L. Atkin, D. J. Bernstein
- 1999
|
|
9
|
On the numerical solution of a differential-difference equation arising in analytic number theory
– J van de Lune, E Wattel
- 1969
|
|
41
|
Sharper bounds for the Chebyshev functions θ(x) and ψ(x
– L Schoenfeld
- 1976
|
|
3
|
Approximating the number of integers without large prime factors
– Koji Suzuki
- 2004
|
|
2
|
Bounding smooth integers
– D J Bernstein
- 1998
|
