Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Modular Arithmeticmedium
0:00.0

The number of integers n∈{1,2,…,100}n \in \{1, 2, \dots, 100\}n∈{1,2,…,100} such that n≡1(mod3)n \equiv 1 \pmod 3n≡1(mod3) and n≡1(mod4)n \equiv 1 \pmod 4n≡1(mod4) is: