A stronger Bertrand’s postulate with an application to partitions
HTML articles powered by AMS MathViewer
- by Robert E. Dressler PDF
- Proc. Amer. Math. Soc. 33 (1972), 226-228 Request permission
Addendum: Proc. Amer. Math. Soc. 38 (1973), 667-667.
Abstract:
In this paper we give a stronger form of Bertrand’s postulate and use it to prove that every positive integer, except 1, 2, 4, 6, and 9, can be written as the sum of distinct odd primes.References
- L. M. Chawla and C. D. N. Yeung, On an additive arithmetic function and its related partition function, J. Nat. Sci. and Math. 12 (1972), 103–111. MR 332648 G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, 4th ed., Oxford Univ. Press, London, 1960.
Additional Information
- © Copyright 1972 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 33 (1972), 226-228
- MSC: Primary 10A45
- DOI: https://doi.org/10.1090/S0002-9939-1972-0292746-6
- MathSciNet review: 0292746