/sci/ - Science & Math

I really doubt you're expected to know Fermat and Euler, and you will most definitely prove both of them in class or hw. It's the quintessential application of Lagrange's theorem. Modular arithmetic you just have to know the basics like that they form a ring. Equivalence relations you can learn in 10 minutes, with modular arithmetic being a trivial example of one, although you'll need to understand that they partition stuff to understand cosets (again, 10 minutes). Wilson's is probably a tough hw problem, you won't need it. Diophantine eqns perhaps will be dealt with but in class.

The only thing I'd say you should revise is polynomial division, extended Euclidean algorithm, bezout identity and equivalence relations. In total should take you less than an hour