Learn / Library / Brainteasers
Combined remainders
Find the smallest positive integer that leaves remainder when divided by , remainder when divided by , and remainder when divided by .
Checking an answer needs JavaScript. The hint and the solution open without it.
Hint
List the numbers that leave remainder on division by and keep only those that also fit the other conditions, stepping by the product of the moduli already satisfied.
Solution
- Numbers with remainder modulo are , and leaves remainder modulo exactly when leaves remainder modulo , so the first candidate is and the rest are .
- Modulo we have and , so , and we need this to be modulo .
- That means modulo , so modulo , and the smallest value is .
- The number is .
Answer: