Mathegoras

Number theory › Congruences and modular arithmetic › Chinese remainder theorem

Congruences with non-coprime moduli

High school · ●○○○○ 10 pts

Find the smallest positive integer xx such that x≡3(mod4)x \equiv 3 \pmod{4} and x≡1(mod6)x \equiv 1 \pmod{6}.

Sign in to save your progress.

systems of congruencesmodular arithmetic