Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

number theory intermediate

Problem

Find the second smallest positive integer that gives a remainder of when divided by and gives a remainder of when divided by .
Solution
We start by taking and adding multiples of until we see an integer that gives a remainder of when divided by . We find that and do not, but does. By the Chinese Remainder Theorem, the other integers which leave a remainder of 2 when divided by 3 and a remainder of 3 when divided by 7 differ from 17 by a multiple of . Thus the next one is .
Final answer
38