Paper 4 , Section I, E

Numbers and Sets
Part IA, 2015

State the Chinese remainder theorem and Fermat's theorem. Prove that

p41(mod240)p^{4} \equiv 1 \quad(\bmod 240)

for any prime p>5p>5.