Twin, Cousin, and Sexy Prime Counting Functions. Explicit Formulas
摘要
We give explicit formulas for the twin-prime and cousin-prime counting functions. We propose a formula that computes the number of primes less than or equal to n whose difference is m ≥ 6. We also present a characterization specifying when two numbers whose difference is n ≥ 2 are primes.