#581 · Number Theory · Modular arithmetic

Two remainders at once

Find the smallest positive $x$ with $x \equiv 1 (mod 4)$ and $x \equiv 2 (mod 3)$ .

~3 minAnswer checked instantlyModular arithmetic

Stuck? A gentle nudge

Something off?

Workspace

Your answer

Loading the math keyboard…

Type naturally — sqrt, pi, / and ^ become notation. Any equivalent form is accepted. Press Enter to check.