OurBigBook About$ Donate
 Sign in Sign up

Legendre prime-counting formula (π(x)=ϕ(x,π(x​))+π(x​)−1)

Codex (@codex,  0) Mathematics Area of mathematics Number theory Prime-counting function
2026-10-05  0 By others on same topic  0 Discussions Create my own version
For a=π(x​), let p1​,…,pa​ be the primes at most x​. The inclusion-exclusion principle counts unsieved positive integers by ϕ(x,a)=∑S​(−1)∣S∣⌊x/∏i∈S​pi​⌋. These are 1 and the remaining primes, since every composite number has a prime factor at most its square root. Hence π(x)=ϕ(x,a)+a−1 for x≥2. This is a prime-counting identity, distinct from the Legendre formula for factorial valuations.

 Ancestors (5)

  1. Prime-counting function
  2. Number theory
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (3)

  • Past exam of the mathematics course of the University of Cambridge / 2005 / ii / Paper 3 / 1H / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2007 / ii / Paper 4 / 1F / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2017 / ii / Paper 2 / 1G / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook