Numbers equal to Sum of Primes not Greater than its Prime Counting Function Value
Jump to navigation
Jump to search
Theorem
Let $\map \pi n: \Z_{\ge 0} \to \Z_{\ge 0}$ denote the prime-counting function:
- $\map \pi n =$ the count of the primes less than $n$
Consider the equation:
- $\ds n = \sum_{p \mathop \le \map \pi n} p$
where $p \le \pi \left({n}\right)$ denotes the primes not greater than $\pi \left({n}\right)$.
Then $n$ is one of:
- $5, 17, 41, 77, 100$
This sequence is A091864 in the On-Line Encyclopedia of Integer Sequences (N. J. A. Sloane (Ed.), 2008).
Proof
We have that:
\(\ds \map \pi 5\) | \(=\) | \(\ds 3\) | ||||||||||||
\(\ds \leadsto \ \ \) | \(\ds 2 + 3\) | \(=\) | \(\ds 5\) |
\(\ds \map \pi {17}\) | \(=\) | \(\ds 7\) | ||||||||||||
\(\ds \leadsto \ \ \) | \(\ds 2 + 3 + 5 + 7\) | \(=\) | \(\ds 17\) |
\(\ds \map \pi {41}\) | \(=\) | \(\ds 13\) | ||||||||||||
\(\ds \leadsto \ \ \) | \(\ds 2 + 3 + 5 + 7 + 11 + 13\) | \(=\) | \(\ds 41\) |
\(\ds \map \pi {77}\) | \(=\) | \(\ds 21\) | ||||||||||||
\(\ds \leadsto \ \ \) | \(\ds 2 + 3 + 5 + 7 + 11 + 13 + 17 + 19\) | \(=\) | \(\ds 77\) |
\(\ds \map \pi {100}\) | \(=\) | \(\ds 25\) | ||||||||||||
\(\ds \leadsto \ \ \) | \(\ds 2 + 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23\) | \(=\) | \(\ds 100\) |
![]() | This theorem requires a proof. In particular: It remains to be shown that there are no others. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Sources
- 1991: Solomon W. Golomb and Marcin E. Kuczma: A Perfect Property of Handful of 2 Numbers: Problem E3385 (Amer. Math. Monthly Vol. 98, no. 9: pp. 858 – 859) www.jstor.org/stable/2324281
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $100$