[
[1] T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, (1976).10.1007/978-1-4757-5579-4
]Search in Google Scholar
[
[2] T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms, The MIT Press, third edition, (2009).
]Search in Google Scholar
[
[3] E. Croot, On a combinatorial method for counting smooth numbers in sets of integers, J. Number Theory, 126 (2007), 237–253.10.1016/j.jnt.2007.01.004
]Search in Google Scholar
[
[4] K. Dickman, On the frequency of numbers containing prime factors of a certain relative magnitude, Ark. Mat. Astr. Fys., 22 (1930), 1–14.
]Search in Google Scholar
[
[5] D. H. Greene, D. E. Knuth, Mathematics for the Analysis of Algorithms, Birkhäuser, third edition, (1990).10.1007/978-0-8176-4729-2
]Search in Google Scholar
[
[6] A. Hildebrand, G. Tenenbaum, Integers without large prime factors, J. Théor. Nr. Bordx 5(2) (1993), 411–484.10.5802/jtnb.101
]Search in Google Scholar
[
[7] G. Tenenbaum, Introduction to Analytic and Probabilistic Number Theory, AMS, third edition (2015).10.1090/gsm/163
]Search in Google Scholar