Integer partitions detect the primes
William Craig, Jan-Willem van Ittersum, and Ken Ono

TL;DR
This paper reveals that certain partition functions in additive number theory can uniquely identify prime numbers through specific equations, establishing a novel link between partitions and primality detection.
Contribution
It demonstrates that prime numbers can be characterized by solutions to equations involving partition functions, introducing a new method to detect primes using additive number theory.
Findings
Primes are solutions to special equations involving partition functions.
Infinite families of prime-detecting equations exist for MacMahonesque partition functions.
Partition functions can serve as tools for prime detection in number theory.
Abstract
We show that integer partitions, the fundamental building blocks in additive number theory, detect prime numbers in an unexpected way. Answering a question of Schneider, we show that the primes are the solutions to special equations in partition functions. For example, an integer is prime if and only if where the are MacMahon's well-studied partition functions. More generally, for "MacMahonesque" partition functions we prove that there are infinitely many such prime detecting equations with constant coefficients, such as
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 · History and Theory of Mathematics
