High School Is 2ab Always Less Than or Equal to a² + b² for All Integers a and b?

  • Thread starter Thread starter PhysicsBoyMan
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary
SUMMARY

The discussion centers on proving the inequality 2ab ≤ a² + b² for all integers a and b. Participants explored various methods, including mathematical induction and algebraic manipulation, ultimately arriving at the conclusion that the proof can be established by recognizing that (a - b)² is always non-negative. By rearranging terms and adding 2ab to both sides, the inequality holds true. An alternative proof by contradiction was also suggested, demonstrating that assuming the opposite leads to a contradiction.

PREREQUISITES
  • Understanding of basic algebraic manipulation
  • Familiarity with the properties of squares and inequalities
  • Knowledge of proof techniques, including direct proof and proof by contradiction
  • Basic understanding of mathematical induction
NEXT STEPS
  • Study the properties of inequalities in algebra
  • Learn about proof by contradiction in mathematics
  • Explore mathematical induction and its applications in proofs
  • Investigate the implications of non-negative squares in algebraic proofs
USEFUL FOR

Mathematics students, educators, and anyone interested in formal proof techniques and inequalities in number theory.

PhysicsBoyMan
Messages
33
Reaction score
0
a and b are integers

Prove that:
2ab <= a2 + b2

I have tested various values for a and b and determined that the statement seems to be generally true. I'm having a hard time though constructing a formal proof.

It will not do to suppose the statement is wrong and then provide a counterexample. This would only prove that the statement is true for those particular values of a and b, and not for all values.

I learned about mathematical induction but I think that method is used to prove statements about a well-ordered set. a and b can be any integer so I don't think that would work.

I wondered what kind of statement may have simplified to produce a2 + b2 so I played with (a+b) * (a+b) which produced a2 + b2 + 2ab and also with (a-b) * (a-b) which produced a2 + b2 - 2ab. This looks similar to the original statement, and I feel like I may be onto some clues.

Without giving me the answer, I wonder if someone could give me a push in the right direction?
 
Physics news on Phys.org
The last formula gives you the answer. What do you know about squares?
 
fresh_42 said:
The last formula gives you the answer. What do you know about squares?
Well I know that squares are always positive.
 
Then gather all together. Start with "all square are positive". Then substitute a certain square of one of your formulas and rearrange the terms..
 
fresh_42 said:
Then gather all together. Start with "all square are positive". Then substitute a certain square of one of your formulas and rearrange the terms..
I don't know what some of your comment means. I'm trying hard to figure it out. I'm looking at the term (a-b)2 and I think that may be the "certain square" you are talking about. It's equal to a2 + b2 - 2ab though so I don't know what I could substitute it for. Maybe I'm on the wrong track here altogether.
 
PhysicsBoyMan said:
I don't know what some of your comment means. I'm trying hard to figure it out. I'm looking at the term (a-b)2 and I think that may be the "certain square" you are talking about. It's equal to a2 + b2 - 2ab though so I don't know what I could substitute it for. Maybe I'm on the wrong track here altogether.
No, you are done. The square is not negative (##≥ 0##) and all which remains, is to add ##2ab## on both sides.
 
fresh_42 said:
No, you are done. The square is not negative (##≥ 0##) and all which remains, is to add ##2ab## on both sides.
How is that a proof that 2ab is always less than or equal to a2 + b2 when a and b are integers?
 
PhysicsBoyMan said:
How is that a proof that 2ab is always less than or equal to a2 + b2 when a and b are integers?
The only way to help you further is to type in the proof.

Because you can only derive true statements from true statements, it is a proof:
##0 ≤ (a - b)^2## for all integers, and even for real numbers, too, is a true statement. The next step is to multiply the square which is of course also true. Shifting numbers by addition doesn't change the order, so you are allowed to add ##2ab## on both sides and get again a true statement, which is the one you want to have.
 
  • Like
Likes PhysicsBoyMan
Thanks. I didn't think about it like that. That is, starting with a separate true statement and transforming it into the one I want.
 
  • #10
PhysicsBoyMan said:
Thanks. I didn't think about it like that. That is, starting with a separate true statement and transforming it into the one I want.
That's probably the simplest proof but you could have done it simply by contradiction as well:

Suppose ## a^2 + b^2 < 2ab ## then

##a^2+b^2 -2ab <0##
And
##(a-b)^2 <0##

Which is a contradiction.
 
  • Like
Likes PhysicsBoyMan
  • #11
d
PeroK said:
That's probably the simplest proof but you could have done it simply by contradiction as well:

Suppose ## a^2 + b^2 < 2ab ## then

##a^2+b^2 -2ab <0##
And
##(a-b)^2 <0##

Which is a contradiction.
Nice one Perok. Contradictions are a lot more intuitive often times.
 

Similar threads

  • · Replies 40 ·
2
Replies
40
Views
8K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
8
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 35 ·
2
Replies
35
Views
5K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K