Non inductive proof for square of odd integers

56 Views Asked by At

Can we argue that the square of every odd integer is of the form $8k+1$ using non inductive proof?

1

There are 1 best solutions below

0
On

Sure. If $n=2k+1$ then $n^2=4k^2+4k+1=4k(k+1)+1$ and either $k$ or $k+1$ is even, so $4k(k+1)$ is divisible by $8$.