English

A Characteristic Function for the Primes

Number Theory 2016-05-03 v2

Abstract

I develop a function that, for any integer n2n \geq 2, takes a value of 1 if nn is prime, 0 if nn 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.

Keywords

Cite

@article{arxiv.1604.08670,
  title  = {A Characteristic Function for the Primes},
  author = {Jesse Aaron Zinn},
  journal= {arXiv preprint arXiv:1604.08670},
  year   = {2016}
}
R2 v1 2026-06-22T13:44:09.506Z