Created
January 21, 2015 20:24
-
-
Save Tombert/ba2ddb1b4c18e9d7cd39 to your computer and use it in GitHub Desktop.
Title4
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
A generalization for all even numbers is | |
$$ | |
2k | |
$$ | |
where k is an integer. Therefore, a generalization for all odd numbers would be. | |
$$ | |
2k+1 | |
$$ | |
To prove that squaring an odd integer is odd, let's square our expression. | |
$$ | |
\left( 2k + 1 \right)^{2} = 4k^2 + 4k + 1 | |
$$ | |
Let's factor out $4k$ | |
$$ | |
4k\left(k+1\right) + 1 | |
$$ | |
$$ | |
2\left(k\left(k+1\right)\right) + 1 | |
$$ | |
Since $\left(k\left(k+1\right)\right)$ is still an integer, and we're working with generalizations, we can just merge that back into a generic constant $k$, and we're back to our original odd-form. | |
$$ | |
2k + 1 | |
$$ |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment