Prime-counting function
Function representing the number of primes less than or equal to a given number
Prime-counting function
In mathematics, the prime-counting function is the function counting the number of prime numbers less than or equal to some real number x. It is denoted by π(x) (unrelated to the number π). A symmetric variant seen sometimes is π0(x), which is equal to π(x) − 1⁄2 if x is exactly a prime number, and equal to π(x) otherwise. That is, the number of prime numbers less than x, plus half if x equals a prime.
Read on Wikipedia · Image Bender2k14, CC BY-SA 3.0
Open boosters, collect cards and trade them. Free to play.
Play for free