Problem
NT-B1-M04-P020 Modulo 100
#20
★★★☆☆ Level 3 of 5
Find all \(x\pmod{100}\) such that \(x\equiv3\pmod4\) and \(x\equiv7\pmod{25}\).
Check the number \(7\).
The number \(7\) has residue \(3\) modulo \(4\) and residue \(7\) modulo \(25\). Since \(4\) and \(25\) are coprime, the solution is unique modulo \(100\). The answer is \(x\equiv7\pmod{100}\).
A good example where the solution is visible, but uniqueness must be stated.