A Characteristic Function for the Primes
Abstract
I develop a function that, for any integer n ≥ 2, takes a value of 1 if n is prime, 0 if n is composite. I also discuss two applications: First, the characteristic function provides a new expression for the prime counting function. Second, the components of the characteristic function point to a new expression that gives the number of distinct prime factors for any integer greater than one.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.