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. /Prove by contradiction that there are no integers a and b with 6a + 9b = 100…
AdvancedMathematicsHigh School (11–12)Mathematical ReasoningproofNumericalBoard Exam
+2 more exams
A-LevelIB
A-LevelIB

Prove by contradiction that there are no integers a and b with 6a + 9b = 100…

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.

Prove by contradiction that there are no integers aaa and bbb with 6a+9b=1006a + 9b = 1006a+9b=100. Then go further. For which whole numbers nnn from 111 to 505050 do there exist integers aaa and bbb, positive, negative or zero, with 6a+9b=n6a + 9b = n6a+9b=n? Prove your answer in both directions: why the other numbers cannot be reached, and how every number you list can be reached. How many such nnn are there?

Check your answer

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

Need a reminder? The key ideaShowHide

Contradiction: assume the claim is false and reach something impossible. Cases: split the possibilities so that every one is covered, and prove the claim in each. Squares leave remainder 000 or 111 on division by 333.

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 contradiction. Suppose integers aaa, bbb give 6a+9b=1006a + 9b = 1006a+9b=100. The left side is 3(2a+3b)3(2a + 3b)3(2a+3b), a multiple of 333. But 100=3×33+1100 = 3 \times 33 + 1100=3×33+1 is not. This is impossible, so no such integers exist.

Step 2. Which nnn can be reached. The same argument shows that nnn must be a multiple of 333.

Step 3. Every multiple of 333 can be reached. From 6×(−1)+9×1=36 \times (-1) + 9 \times 1 = 36×(−1)+9×1=3, multiply by kkk: 6(−k)+9k=3k6(-k) + 9k = 3k6(−k)+9k=3k. So every multiple of 333 is reached.

Step 4. Count. The multiples of 333 from 111 to 505050 are 3,6,…,483, 6, \dots, 483,6,…,48: that is 161616 numbers.

Watch out. If aaa and bbb had to be whole numbers 0,1,2,…0, 1, 2, \dots0,1,2,…, the answer would change: 333 itself could not be reached.

Answer: no solution for 100100100; exactly the 161616 multiples of 333 can be reached.

Log in to save this for later
← All Problems
← Prove by contradiction that √3 is irrational…Prove by cases that for every integer n, n² leaves remainder 0 or 1 when divided by 3… →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Proof by contradiction and by casesValid 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 √3 is irrational…Hard
  3. Prove by exhaustion that no perfect square ends in the digit 2, 3, 7 or 8…Advanced
  4. The formula f(n) = n² + n + 41 gives a prime for n = 0, 1, 2, … for a long time…
Advanced
  • For integers a and b, prove that if a + b ≥ 15, then a ≥ 8 or b ≥ 8…Hard
  • All problems on this topic →