Odd Integer Squares: Proving 8k+1

  • Thread starter Thread starter Meh
  • Start date Start date
  • Tags Tags
    Integer Squares
AI Thread Summary
The discussion focuses on proving that the square of an odd integer can be expressed in the form of 8k + 1, where k is an integer. An odd integer is represented as 2n + 1, leading to the square being (2n + 1)² = 4n² + 4n + 1. The goal is to show that 4n² + 4n can be rearranged into 8k, which involves recognizing that 4n(n + 1) is always even since it is the product of two consecutive integers. The conversation also clarifies the notation for integers and addresses misconceptions about the variable k, emphasizing that k cannot be universally defined for all integers. The proof ultimately confirms that the square of any odd integer indeed fits the 8k + 1 format.
Meh
Messages
10
Reaction score
0
Prove that the square of an odd integer is always of the 8k + 1, where k is an integer. Any help would be appreciated.
 
Physics news on Phys.org
An even integer can be written as 2n, \ n \in \mathbb{Z}
And an odd integer can be written as 2n + 1, \ n \in \mathbb{Z}
For example : 5 = 2 * 2 + 1 (n = 2), 7 = 2 * 3 + 1 (n = 3), 13 = 2 * 6 + 1 (n = 6).
So the quare of an add integer can be written as: (2n + 1) ^ 2 = 4n ^ 2 + 4n + 1
You will try to arrange 4n ^ 2 + 4n + 1 into 8k + 1. Since you have '+ 1' in both sides, in fact, you just need to arrange 4n ^ 2 + 4n into 8k.
Can you go from here?
Viet Dao,
 
Last edited:
Hmm what does that "Z" in "n belongs to ..." mean? Not to fimilar with that sign :P
 
Z is the set of all integers, ie: \mathbb{Z} = \{..., \ -3, \ , -2, \ , -1, \ 0, \ 1, \ 2, \ 3, \ ... \}
Do you get it now?
Viet Dao,
 
Still don't get it >.< Sorry.
 
n \in \mathbb{Z} means that n is an integer.
And because:
\mathbb{Z} = \{..., \ -3, \ -2, \ -1, \ 0, \ 1, \ 2, \ 3, \ ... \}
So:
n \in \{..., \ -3, \ -2, \ -1, \ 0, \ 1, \ 2, \ 3, \ ... \}
That means n can take any value from that set, n can be -3, or -5, or 9, or 10, or 14, or 600, or -1004, ...
Viet Dao,
 
I understood that, just not the how to solve >.<
 
An odd integer: 2n + 1, \ n \in \mathbb{Z}
So the square of an odd integer is: (2n + 1) ^ 2 = 4n ^ 2 + 4n + 1.
You are going to prove \forall n \in \mathbb{Z},\ \exists k \in \mathbb{Z} \ | \ 4n ^ 2 + 4n + 1 = 8k + 1
+ 1 is in both sides, so you are going to prove:
\forall n \in \mathbb{Z},\ \exists k \in \mathbb{Z} \ | \ 4n ^ 2 + 4n = 8k
Note that:
4n ^ 2 + 4n = 4n(n + 1)
What can you say about the product of two successive integers? ie : n * (n + 1).
Can you go from here?
Viet Dao,
 
Ah, alrite I can go from there. Thanks Viet Dao.
 
  • #10
hi, I'm wondering, isn't \forall k? cause k is stated to be an integer? just making sure..
 
  • #11
It can't be for all k, because:
k = 4:
8 * 4 + 1 = 32 + 1 = 33, and 33 is not a square of any integer.
k = 5:
8 * 5 + 1 = 40 + 1 = 41, and 41 is not a square of any integer.
Viet Dao,
 
Back
Top