MathCastle
Number TheoryChallengeThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Challenge problem

Find the smallest positive integer nn such that n2+1n^2 + 1 is divisible by 1105=5⋅13⋅171105 = 5 \cdot 13 \cdot 17.