Paper 4, Section I, E

Numbers and Sets | Part IA, 2010

(a) Find the smallest residue xx which equals 28!1328(mod31)28 ! 13^{28}(\bmod 31).

[You may use any standard theorems provided you state them correctly.]

(b) Find all integers xx which satisfy the system of congruences

x1(mod2)2x1(mod3)2x4(mod10)x10(mod67)\begin{aligned} x & \equiv 1(\bmod 2) \\ 2 x & \equiv 1(\bmod 3) \\ 2 x & \equiv 4(\bmod 10) \\ x & \equiv 10(\bmod 67) \end{aligned}

Typos? Please submit corrections to this page on GitHub.