Prove that the square of any given odd number gives a remainder of 1 when divided by 4 – math.stackexchange.com

I'm supposed to prove this by induction, and I get that if I assume $n$ is odd such that $n^2$ gives a remainder of 1, then $n^2=4m+1$ for a number $m$ where $m \in \mathbb{Z}$, but I honestly can't ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Artikel Terkait

0 Comment to "Prove that the square of any given odd number gives a remainder of 1 when divided by 4 – math.stackexchange.com"