Large highly powerful numbers are cubeful
HTML articles powered by AMS MathViewer
- by C. B. Lacampagne and J. L. Selfridge PDF
- Proc. Amer. Math. Soc. 91 (1984), 173-181 Request permission
Abstract:
A number $n = \prod \nolimits _{i = 1}^k {p_i^E}$ is called highly powerful if the product of the exponents $E({p_i})$ of the primes is larger than that of any smaller number. If ${p_k} > 19$, $E({p_k}) = 3$. Further, we have developed an algorithm which finds all highly powerful numbers with $E({p_k}) \ne 3$, and we list the 19 highly powerful numbers with $E({p_k}) = 2$.References
- Richard P. Brent, The first occurrence of large gaps between successive primes, Math. Comp. 27 (1973), 959–963. MR 330021, DOI 10.1090/S0025-5718-1973-0330021-0
- Harold G. Diamond, Elementary methods in the study of the distribution of prime numbers, Bull. Amer. Math. Soc. (N.S.) 7 (1982), no. 3, 553–589. MR 670132, DOI 10.1090/S0273-0979-1982-15057-1
- G. E. Hardy and M. V. Subbarao, Highly powerful numbers, Congr. Numer. 37 (1983), 277–307. MR 703589
- J. Barkley Rosser and Lowell Schoenfeld, Sharper bounds for the Chebyshev functions $\theta (x)$ and $\psi (x)$, Math. Comp. 29 (1975), 243–269. MR 457373, DOI 10.1090/S0025-5718-1975-0457373-7
Additional Information
- © Copyright 1984 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 91 (1984), 173-181
- MSC: Primary 11A51
- DOI: https://doi.org/10.1090/S0002-9939-1984-0740165-6
- MathSciNet review: 740165