Mathegoras

Number theory › Congruences and modular arithmetic › Chinese remainder theorem

Simultaneous congruences modulo 15 and 21

University · ●●○○○ 20 pts

Find the smallest positive integer xx such that x≡5(mod15)x \equiv 5 \pmod{15} and x≡8(mod21)x \equiv 8 \pmod{21}.

Sign in to save your progress.

modular arithmeticEuclidean algorithmlinear congruences