Prime power Prime power In mathematics, a prime power is a positive integer power of a single prime number. For example: , and are prime powers, while , and are not. The number 1 is not counted as a prime power. The prime powers are: 2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 31, 32, 37, 41, 43, 47, 49, 53, 59, 61, 64, 67, 71, 73, 79, 81, 83, 89, 97, 101, 103, 107, 109, 113, 121, 125, 127, 128, 131, 137, 139, 149, 151, 157, 163, 167, 169, 173, 179, 181, 191,
Prime number theorem of 1859, and he succeeded in proving a slightly weaker form of the asymptotic law, namely, that if the limit of as goes to infinity exists at all, then it is necessarily equal to one. He was able to prove unconditionally that this ratio is bounded above and below by two explicitly given constants near 1, for all sufficiently large . Although Chebyshev's paper did not prove the Prime Number Theorem, his estimates for were strong enough for him to prove Bertrand's postulate that there exists a prime number between and for any integer . An important paper concerning the