Number theory › Congruences and modular arithmetic › Chinese remainder theorem

CRT with non-coprime moduli

High school · ●●○○○ 20 pts

Find the smallest positive integer xx such that x≡1(mod8)x\equiv 1 \pmod 8 and x≡5(mod12)x\equiv 5 \pmod{12}.

Sign in to save your progress.

congruencesmodular arithmetic