MathCastle
Number TheorySuperchallengeModular Arithmetic

Modular Arithmetic · Superchallenge problem

Count the pairs of residues (x,y)(x, y) modulo 1212 for which 4x+6y≡2(mod12)4x + 6y \equiv 2 \pmod{12}.