MathCastle
Proof Writing & Problem SolvingEasy

Proof Writing & Problem Solving · Easy problem

A direct proof writes an odd integer as n=2k+1n = 2k+1 and shows n2=4k(k+1)+1n^2 = 4k(k+1) + 1. Since one of kk, k+1k+1 is even, 4k(k+1)4k(k+1) is a multiple of 88. What remainder does the square of every odd integer leave when divided by 88?

Practice more like this