Feedback on version dated 15 October 2020:
7 Mersenne Numbers
Formula for factorization of \(M_{pq}\) is almost right!
9.1 Legendre symbol
Say p is an odd prime or p not equal to 2.
Typo bottom of page 37: elements of A should go up to 10 instead of 11.
12 Frobenius
Example: taking the polynomial \(x^2+1\), you get the Gaussian integers modulo n after all!
Obviously it's up to you, but it might be worth including something on the Chinese Remainder Theorem.
It would make it easier to explain your formula for the Euler phi function.
Also, as you have a nice emphasis on the computational side of things in this, you could show
how it is used in practice to speed up RSA decryption, for example.
Just a thought, anyway.
