Proving that a square of an odd integer is also odd

  • Thread starter Thread starter hackedagainanda
  • Start date Start date
  • Tags Tags
    Integer Square
Click For Summary
SUMMARY

For any arbitrary odd integer x, it is proven that x^2 is also odd. An odd number can be expressed in the form of 2k + 1, where k is an integer. By substituting x into the equation, we derive x^2 = (2k + 1)^2, resulting in 4k^2 + 4k + 1, which can be rewritten as 2(2k^2 + 2k) + 1. This confirms that x^2 maintains the odd property, as both 2k^2 and 2k are integers, demonstrating closure under addition and multiplication.

PREREQUISITES
  • Understanding of odd and even integers
  • Basic knowledge of algebraic expansion
  • Familiarity with integer properties, specifically closure under addition and multiplication
  • Concept of prime numbers and their definitions
NEXT STEPS
  • Explore proofs involving properties of even and odd integers
  • Study the closure properties of integers in more depth
  • Learn about prime numbers and their significance in number theory
  • Investigate other mathematical proofs using algebraic identities
USEFUL FOR

Mathematics students, educators, and anyone interested in number theory or mathematical proofs will benefit from this discussion.

hackedagainanda
Messages
52
Reaction score
11
Prove that for any arbitrary odd x, that x^2 is also odd.

By definition an odd number is an integer that can be written in the form of 2k + 1 for some integer k. This means that x = 2k + 1 where k is an integer

So let x^2 = (2k + 1)^2 we then get 4k^2 + 4k + 1 = 2(2k^2 + 2k) + 1, This is where I get lost, I understand that k is an integer but how does it follow that 2k^2 + 2k is an integer?
 
Physics news on Phys.org
The product of an integer and an integer is an integer.
The sum of an integer and an integer is an integer.

More formally, integers are closed under addition and multiplication.
 
Thanks! I totally overlooked that :eek:
 
hackedagainanda said:
Prove that for any arbitrary odd x, that x^2 is also odd.

By definition an odd number is an integer that can be written in the form of 2k + 1 for some integer k. This means that x = 2k + 1 where k is an integer

So let x^2 = (2k + 1)^2 we then get 4k^2 + 4k + 1 = 2(2k^2 + 2k) + 1, This is where I get lost, I understand that k is an integer but how does it follow that 2k^2 + 2k is an integer?
Another way is to use the fact that ##2## is a prime and then apply the definition of a prime.
 

Similar threads

Replies
2
Views
3K
Replies
7
Views
4K
  • · Replies 49 ·
2
Replies
49
Views
5K
Replies
6
Views
2K
Replies
9
Views
4K
  • · Replies 4 ·
Replies
4
Views
5K
  • · Replies 23 ·
Replies
23
Views
5K
Replies
6
Views
3K
  • · Replies 7 ·
Replies
7
Views
800
  • · Replies 7 ·
Replies
7
Views
2K