4.I.1E

Numbers and Sets | Part IA, 2005

Find the unique positive integer aa with a≤19a \leq 19, for which

17!⋅316≡a( mod 19). 17 ! \cdot 3^{16} \equiv a(\bmod 19) \text {. }

Results used should be stated but need not be proved.

Solve the system of simultaneous congruences

x≡1( mod 2),x≡1( mod 3)x≡3( mod 4)x≡4( mod 5)\begin{aligned} &x \equiv 1(\bmod 2), \\ &x \equiv 1(\bmod 3) \\ &x \equiv 3(\bmod 4) \\ &x \equiv 4(\bmod 5) \end{aligned}

Explain very briefly your reasoning.

Typos? Please submit corrections to this page on GitHub.