MathCastle
Proof Writing & Problem SolvingEasy

Proof Writing & Problem Solving · Easy problem

Someone claims: "if nn is odd, then n2+1n^2 + 1 is divisible by 44." A direct computation with n=2k+1n = 2k + 1 gives n2+1=4k2+4k+2n^2 + 1 = 4k^2 + 4k + 2, which settles the claim. What remainder does n2+1n^2 + 1 leave when divided by 44, for every odd nn?

Practice more like this