Prove the sum of squares of two odd integers can't be a perfect square

Click For Summary
SUMMARY

The discussion centers on proving that the sum of squares of two odd integers cannot be a perfect square. The proof begins by assuming two odd integers, represented as x = 2j + 1 and y = 2k + 1, and expanding their squares. The resulting expression, 4j^2 + 4k^2 + 4j + 4k + 2, simplifies to 2[2(j^2 + k^2 + j + k) + 1], indicating that the sum is even. The contradiction arises when noting that a perfect square can only yield remainders of 0 or 1 when divided by 4, while the sum yields a remainder of 2, thus confirming the original claim.

PREREQUISITES
  • Understanding of basic algebraic manipulation
  • Familiarity with properties of odd and even integers
  • Knowledge of modular arithmetic, specifically modulo 4
  • Basic concepts of perfect squares and their properties
NEXT STEPS
  • Study the properties of odd and even integers in number theory
  • Learn about modular arithmetic and its applications in proofs
  • Explore the concept of perfect squares and their characteristics
  • Review algebraic proofs and contradiction techniques in mathematics
USEFUL FOR

This discussion is beneficial for mathematics students, particularly those studying number theory, algebra, or preparing for advanced proofs in mathematical logic.

kolley
Messages
16
Reaction score
0

Homework Statement



x^2+y^2=z^2

Homework Equations





The Attempt at a Solution



assume to the contrary that two odd numbers squared can be perfect squares. Then,
x=2j+1 y=2k+1

(2j+1)^2 +(2k+1)^2=z^2
4j^2 +4j+1+4k^2+4k+1
=4j^2+4k^2+4j+4k+2=z^2
=2[2(j^2+K^2+j+k)+1)]=2s
the book goes on to produce a contradiction having to do with whether s is odd or even. Can someone please walk me through the rest of this proof to the end in detail, because the explanation in my book is very poor. Thank you.
How do I go on to show that this is a contradiction. The book says
 
Physics news on Phys.org
Note that the sum of the square of two odd integers (2m+1) and (2n+1) is X=4(n^2+m^2+n+m)+2. Clearly, X is congruent to 2 modulo 4. But k^2 can only give remainder 0 or 1 modulo 4.
 

Similar threads

Replies
7
Views
4K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
3
Views
1K
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 12 ·
Replies
12
Views
4K