Problemcore
Prime-counting function
Also called counting primes, pi function, pi(x).
Pi(x) is the number of primes not exceeding x.
Pi(x) is the number of primes not exceeding x.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag CKKM63 Edit this page History Report an error