Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
For integers and , prove that if , then or . A direct proof is awkward, because the conclusion is an "or". Write the contrapositive, using De Morgan's law for the negation of the "or", and prove it. What is the largest possible value of when and ? What is the smallest value of that forces or ?
Direct proof: assume , reach . Contrapositive: assume , reach . Exhaustion: check every one of finitely many cases. One counterexample disproves a for-all claim.
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. The contrapositive. The negation of the conclusion is . For integers, that is and . The negation of the hypothesis is . So we prove: if and , then .
Step 2. Prove it. Adding the inequalities gives . This is the contrapositive, so the claim is proved.
Step 3. The numbers. With the sum is , the largest possible. So any sum of or more forces or , and is the smallest such sum.
Watch out. "" becomes "" only because is an integer. For real numbers, and give with both below , and the claim fails.
Answer: the largest sum is , and is the smallest sum that forces the conclusion.
Log in to join the discussion.
Loading…