Paper 4 , Section I, ENumbers and SetsPart IA, 2015State the Chinese remainder theorem and Fermat's theorem. Prove thatp4≡1( mod 240)p^{4} \equiv 1 \quad(\bmod 240)p4≡1(mod240)for any prime p>5p>5p>5.