Prime Counting Function Identity
Abstract
In this paper, a new formula for π(2)(N) is formulated, it is a function that counts the number of semi-primes not exceeding a given number N. A semi-prime is a natural number that is the product of precisely two prime numbers, the two primes in the product may equal each other. Semi-prime numbers are also a case of almost primes. Since a formula for this is already known, a new identity that uses the prime counting function is created by equating the two functions.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.