September 2024
·
4 Reads
·
2 Citations
Proceedings of the National Academy of Sciences
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 n ≥ 2 is prime if and only if ( 3 n 3 − 13 n 2 + 18 n − 8 ) M 1 ( n ) + ( 12 n 2 − 120 n + 212 ) M 2 ( n ) − 960 M 3 ( n ) = 0 , where the M a ( n ) are MacMahon’s well-studied partition functions. More generally, for MacMahonesque partition functions M a → ( n ) , we prove that there are infinitely many such prime detecting equations with constant coefficients, such as 80 M ( 1 , 1 , 1 ) ( n ) − 12 M ( 2 , 0 , 1 ) ( n ) + 12 M ( 2 , 1 , 0 ) ( n ) + ⋯ − 12 M ( 1 , 3 ) ( n ) − 39 M ( 3 , 1 ) ( n ) = 0 .