Browse · MATH Print → jmc number theory junior Problem Find the integer n, 0≤n≤5, that satisfies n≡12345(mod6). Solution — click to reveal When 12345 is divided by 6, the remainder is 3, so n=3. Final answer 3 ← Previous problem Next problem →