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 √3 is irrational…
HardMathematicsHigh School (11–12)Mathematical ReasoningproofBoard Exam
+2 more exams
A-LevelIB
A-LevelIB

Prove by contradiction that √3 is irrational…

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 3\sqrt{3}3​ is irrational. Follow the shape of the proof for 2\sqrt{2}2​, but you will need a new fact in place of "if a2a^2a2 is even, then aaa is even". First prove that fact: for an integer aaa, if a2a^2a2 is divisible by 333, then aaa is divisible by 333. Use the contrapositive and split into cases by the remainder of aaa on division by 333. Then write the full proof by contradiction, and say exactly which statement is contradicted.

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 fact, by contrapositive and cases. Suppose aaa is not divisible by 333.

  • If a=3k+1a = 3k + 1a=3k+1, then a2=3(3k2+2k)+1a^2 = 3(3k^2 + 2k) + 1a2=3(3k2+2k)+1.
  • If a=3k+2a = 3k + 2a=3k+2, then a2=3(3k2+4k+1)+1a^2 = 3(3k^2 + 4k + 1) + 1a2=3(3k2+4k+1)+1.

In both cases a2a^2a2 leaves remainder 111, so 333 does not divide a2a^2a2. This proves: if 333 divides a2a^2a2, then 333 divides aaa.

Step 2. Assume the opposite. Suppose 3=ab\sqrt{3} = \dfrac{a}{b}3​=ba​, with whole numbers aaa, bbb, b≠0b \ne 0b=0, in lowest terms.

Step 3. Square. a2=3b2a^2 = 3b^2a2=3b2, so 333 divides a2a^2a2, and by Step 1, 333 divides aaa. Write a=3ca = 3ca=3c.

Step 4. Again. 9c2=3b29c^2 = 3b^29c2=3b2 gives b2=3c2b^2 = 3c^2b2=3c2. So 333 divides b2b^2b2, and 333 divides bbb.

Step 5. The contradiction. 333 divides both aaa and bbb. This contradicts the assumption that ab\dfrac{a}{b}ba​ is in lowest terms.

Conclusion. So 3\sqrt{3}3​ is irrational. Proof complete.

Log in to save this for later
← All Problems
← Prove by exhaustion that no perfect square ends in the digit 2, 3, 7 or 8…Prove by contradiction that there are no integers a and b with 6a + 9b = 100… →
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 there are no integers a and b with 6a + 9b = 100…Advanced
  3. 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
  • For integers a and b, prove that if a + b ≥ 15, then a ≥ 8 or b ≥ 8…Hard
  • All problems on this topic →