Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
Problem 188, [3], stated: Apart from finitely many primes p show that if npis the smallest abundant number for which p is the smallest prime divisor of np then np is not squarefree.
1.Ramanujan, Srinivasa, Highly composite numbers, Collected papers Cambridge Univ. Press and Chelsea Publishing Company 78-128. See also L. Alaoglu and P. Erdös, On highly composite and similar numbers, Trans. Amer. Math. Soc. 56 (1944), 448-469 and J. L. Nicolas, Su Vordre maximum d'un ?l?ment dans le groupe Sn des permutations, Acta Arithmetica 14 (1968), 315-332.Google Scholar
2
2.Rosser, J.B. and Schoenfeld, L., Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64-94.Google Scholar