Fej\'er-Kernel Prime Indicators
Abstract
A C1 prime indicator P is constructed by applying the Fej\'er identity to the sine-quotient encoder of trial division. For integers n 2, P(n)=0 holds exactly for odd primes; P(2)>0. For all non-integers x>1 one has P(x)>0. The function is piecewise C∞ and its second derivative has jumps precisely at the squares m2, with explicit sizes. Replacing the sharp cut-off by a smooth transition yields C∞ analogues Pτ and Pσ with integer limits Pτ(n;) τ(n)-2 and Pσ(n;) σ(n)-n-1 as ∞, obtained from locally uniform convergence of derivative series. For large , numerical evidence indicates companion zeros near odd primes for Pτ and an asymmetric pair for Pσ. No assertion is made beyond integer input, and no statements are claimed about the prime number theorem or zero distributions of L-functions. The appendix includes two illustrative prime-counting sums.
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.