Integer partitions detect the primes · HackerPapers discussions

Integer partitions detect the primes — mentioned by isaacfrond

Sat, 21 Jun 2025 10:57:45 GMT

The M functions are the MacMahon’s partition functions (see the paper [1]). They were not known to relate to the sum of divisors. The M_a function counts partitions in a parts but weighing multiplicities in the partion. [1]: https://arxiv.org/abs/2405.06451

Paper and discussion history. A mention is not an endorsement.

Integer partitions detect the primes — mentioned by luizfzs

Sun, 27 Oct 2024 12:32:17 GMT

Hello! I came across this new paper, INTEGER PARTITIONS DETECT THE PRIMES [1] from July, 2024, but I don't have enough knowledge to even read it. I wonder if an implementation of this method would provide any speed benefits compared to PRP. Great work! [1] https://arxiv.org/pdf/2405.06451

Paper and discussion history. A mention is not an endorsement.

Integer partitions detect the primes — mentioned by joshuaissac

Tue, 22 Oct 2024 12:37:17 GMT

The article talks about a recent paper[1] by one of the interviewees that uses McMahon partition functions for primality testing. I wonder how its running time of compares to that of the AKS primality test, and something more practical like BPSW.[2] Could it find an application in practical cryptography? 1. https://arxiv.org/abs/2405.06451v2 2. https://en.wikipedia.org/wiki/Baillie%E2%80%93PSW_primality_...

Paper and discussion history. A mention is not an endorsement.