References
- [Alladi 82] K. Alladi. “The Turán-Kubilius Inequality for Integers Without Large Prime Factors.” J. Reine Angew. Math. 335 (1982), 180–196. MR 667466 (84a:10045).
- [Alladi and Erdős 77] K. Alladi and P. Erdős. “On an Additive Arithmetic Function.” Pacific J. Math. 71: 2 (1977), 275–294. MR 0447086 (56 #5401).
- [Croot et al. 12] E. Croot, A. Granville, R. Pemantle, and P. Tetali. “On Sharp Transitions in Making Squares.” Ann. Math. (2) 175:3 (2012), 1507–1550. MR 2912710.
- [De Koninck 94] J. M. De Koninck. On the Largest Prime Divisors of an Integer, Extreme Value Theory and Applications, pp. 447–462. Boston, MA: Springer, 1994.
- [De Koninck and Ivić 84] J. M. De Koninck and A. Ivić. “The Distribution of the Average Prime Divisor of an Integer.” Arch. Math. (Basel) 43:1 (1984), 37–43. MR 758338 (85j:11116).
- [De Koninck and Sweeney 01] J. M. De Koninck and J. Sweeney. “On the Unimodal Character of the Frequency Function of the Largest Prime Factor.” Colloq. Math. 88: 2 (2001), 159–174. MR 1852903 (2002e:11122).
- [Goldston et al. 13] D. Goldston, J. Pintz, and C. Yıldırım. “Primes in Tuples IV: Density of Small Gaps between Consecutive Primes.” Acta Arith. 160: 1 (2013), 37–53. MR 3085151.
- [Guy 04] R. Guy. Unsolved Problems in Number Theory. New York, NY: Springer, 2004.
- [Hildebrand 85] A. Hildebrand. “Integers Free of Large Prime Divisors in Short Intervals.” Quart. J. Math. Oxford Ser. (2) 36: 141 (1985), 57–69. MR 780350 (86f:11066).
- [Hildebrand 86] A. Hildebrand. “On the Number of Positive Integers ⩽ x and Free of Prime Factors > y.” J. Number Theory 22: 3 (1986), 289–307. MR 831874 (87d:11066).
- [Kemeny 93] J. Kemeny. “Largest Prime Factor.” J. Pure Appl. Algebra 89: 1–2 (1993), 181–186. MR 1239559 (94m:11112).
- [McNew 15] N. McNew. “Multiplicative Problems in Combinatorial Number Theory.” Ph.D. thesis, Dartmouth College, 2015.
- [Naslund 13] E. Naslund. “The Average Largest Prime Factor.” Integers 13 (2013), Paper No. A81, 5. MR 3167928.
- [Naslund 14] E. Naslund. “The Median Largest Prime Factor.” J. Number Theory 141 (2014), 109–118. MR 3195391.
- [Pomerance 79] C. Pomerance. “The Prime Number Graph.” Math. Comp. 33: 145 (1979), 399–408.
- [Pomerance 95] C. Pomerance. “The Role of Smooth Numbers in Number-Theoretic Algorithms.” In Proceedings of the International Congress of Mathematicians, Vols. 1 and 2, edited by S. D. Chatterji, pp. 411–422 (Zürich, 1994). Basel: Birkhäuser, 1995. MR 1403941 (97m:11156).
- [Pomerance 95] C. Pomerance. “Multiplicative Independence for Random Integers.” In Analytic Number Theory, Vol. 2 (Allerton Park, IL, 1995), Progr. Math., Vol. 139, pp. 703–711. Boston, MA: Birkhäuser Boston, 1996. MR 1409387 (97k:11174)
- [Saias 89] É. Saias. “Sur le nombre des entiers sans grand facteur premier.” J. Number Theory 32:1 (1989), 78–99. MR 1002116 (90f:11080).
- [Smida 91] H. Smida. “Sur les puissances de convolution de la fonction de Dickman.” Acta Arith. 59:2 (1991), 123–143. MR 1133953 (92k:11093).
- [Tenenbaum 95] G. Tenenbaum. Introduction to Analytic and Probabilistic Number Theory. Cambridge: Cambridge University Press, 1995.
- [Tutaj 14] E. Tutaj. “Prime Numbers with a Certain Extremal Type Property.” Preprint arXiv:1408.3609, 2014.
- [Wunderlich and Selfridge 74] M. Wunderlich and J. Selfridge. “A Design for a Number Theory Package with an Optimized Trial Division Routine.” Commun. ACM 17:5 (1974), 272–276.
- [Xuan 93] T. Xuan. “On the Asymptotic Behavior of the Dickman-de Bruijn Function.” Math. Ann. 297:3 (1993), 519–533. MR 1245402 (94j:11095).