On Excess of the Odious Primes
Vladimir Shevelev
TL;DR
This paper provides a stronger heuristic argument supporting the conjecture that odious primes are more numerous than their non-odious counterparts.
Contribution
It offers an improved heuristic justification for the conjecture regarding the excess of odious primes over non-odious primes.
Findings
Heuristic justification for odious prime excess strengthened
Supports conjecture with new heuristic insights
Provides theoretical backing for prime classification bias
Abstract
We give a more strong heuristic justification of our conjecture on the excess of the odious primes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Coding theory and cryptography