HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /For integers a and b, prove that if a + b ≥ 15, then a ≥ 8 or b ≥ 8…
HardMathematicsHigh School (11–12)Mathematical ReasoningproofNumerical

For integers a and b, prove that if a + b ≥ 15, then a ≥ 8 or b ≥ 8…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

For integers aaa and bbb, prove that if a+b≥15a + b \ge 15a+b≥15, then a≥8a \ge 8a≥8 or b≥8b \ge 8b≥8. 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 a+ba + ba+b when a≤7a \le 7a≤7 and b≤7b \le 7b≤7? What is the smallest value of a+ba + ba+b that forces a≥8a \ge 8a≥8 or b≥8b \ge 8b≥8?

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

Direct proof: assume ppp, reach qqq. Contrapositive: assume ∼q\sim q∼q, reach ∼p\sim p∼p. Exhaustion: check every one of finitely many cases. One counterexample disproves a for-all claim.

The worked solution

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 ∼(a≥8∨b≥8)≡(a<8)∧(b<8)\sim(a \ge 8 \vee b \ge 8) \equiv (a < 8) \wedge (b < 8)∼(a≥8∨b≥8)≡(a<8)∧(b<8). For integers, that is a≤7a \le 7a≤7 and b≤7b \le 7b≤7. The negation of the hypothesis is a+b≤14a + b \le 14a+b≤14. So we prove: if a≤7a \le 7a≤7 and b≤7b \le 7b≤7, then a+b≤14a + b \le 14a+b≤14.

Step 2. Prove it. Adding the inequalities gives a+b≤14a + b \le 14a+b≤14. This is the contrapositive, so the claim is proved.

Step 3. The numbers. With a=b=7a = b = 7a=b=7 the sum is 141414, the largest possible. So any sum of 151515 or more forces a≥8a \ge 8a≥8 or b≥8b \ge 8b≥8, and 151515 is the smallest such sum.

Watch out. "a<8a < 8a<8" becomes "a≤7a \le 7a≤7" only because aaa is an integer. For real numbers, a=7.5a = 7.5a=7.5 and b=7.5b = 7.5b=7.5 give a+b=15a + b = 15a+b=15 with both below 888, and the claim fails.

Answer: the largest sum is 141414, and 151515 is the smallest sum that forces the conclusion.

Log in to save this for later
← All Problems
← Prove directly that if n is an odd integer, then n² - 1 is divisible by 8…The formula f(n) = n² + n + 41 gives a prime for n = 0, 1, 2, … for a long time… →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Direct proof, contrapositive and counterexampleValid Arguments and Methods of Proof

More on this topic

  1. Prove by cases that for every integer n, n² leaves remainder 0 or 1 when divided by 3…Advanced
  2. Prove by contradiction that there are no integers a and b with 6a + 9b = 100…Advanced
  3. Prove by contradiction that √3 is irrational…Hard
Prove by exhaustion that no perfect square ends in the digit 2, 3, 7 or 8…Advanced
  • The formula f(n) = n² + n + 41 gives a prime for n = 0, 1, 2, … for a long time…Advanced
  • All problems on this topic →