Number TheoryEasyThe Chinese Remainder Theorem
The Chinese Remainder Theorem · Easy problem
Find the largest two-digit integer that leaves remainder when divided by and remainder when divided by .
Find the largest two-digit integer that leaves remainder when divided by and remainder when divided by .