Foundational proof for Mersenne primes
Solution 1:
If we say $P(a)=a^n-1$ we have that $P(1)=0$ and by Polynomial remainder theorem we get that $$a-1\mid a^n-1$$
Foundational proof for Mersenne primes
Solution 1:
If we say $P(a)=a^n-1$ we have that $P(1)=0$ and by Polynomial remainder theorem we get that $$a-1\mid a^n-1$$