So, n is prime iff M_1(n)=n+1. That's much simpler than the first equation listed there!
Indeed, looking things up, it seems that in general the functions M_a can be written as a linear combination (note: with polynomial coefficients, not constant) of the sigma_k (sigma_k is the sum of the k'th power of the divisors). So this result becomes a lot less surprising once you know that...
wewewedxfgdf•3h ago
freed0mdox•2h ago
seanmcdirmid•2h ago
burnt-resistor•1h ago
e1ghtSpace•1h ago
lukan•55m ago
e1ghtSpace•36m ago
lukan•21m ago
e1ghtSpace•3m ago
https://www.youtube.com/watch?v=PzujjRLraIE&t=188s
waltbosz•2h ago
vasvir•1h ago
kevinventullo•58m ago
Someone•24m ago
That’s fine for GIMPS, which only searches for Mersenne primes, but doesn’t work in general.
https://en.wikipedia.org/wiki/Primality_test#Fast_determinis... mentions several tests that do not require factorization, though.
briffid•23m ago