The big idea
A rational number is one that can be written as with and integers and . An irrational number cannot. But how do you actually prove that a particular number is irrational? Here's the good part: learn the proof as a shape, not a script, and the very same shape handles , , and more.
The tool the proof needs
Theorem. Let be a prime. If divides , then divides , for any positive integer .
This comes straight from unique factorisation. Write as a product of primes. Squaring doubles every exponent, so the primes appearing in are exactly the primes appearing in . If shows up in , it was already sitting in .
Don't skip the word prime. The statement is false for composite numbers: divides , but does not divide . Any irrationality proof that leans on this step works only because the number involved is prime.
Proof by contradiction, in shape
To prove irrational, we play a clever trick: assume the opposite, and show that it leads to nonsense.
Assume is rational. Then
for some integers with , and we may take and to have no common factor other than . (If they had one, we'd simply cancel it first.)
Rearrange and square.
First conclusion. divides , so by the theorem above divides . Write .
Substitute back.
Second conclusion. divides , so divides .
The contradiction. divides and divides , so and share the factor . But we started by saying they had no common factor! Since our reasoning was sound, the only thing that can be wrong is the assumption itself.
The same shape for
Assume with having no common factor. Then , so divides , so divides . Write :
so divides too, which is the same contradiction. is irrational.
Notice that only the prime changed. That's exactly why it pays to remember the shape rather than one particular case.
Where the proof would break
Try it on . Assume in lowest terms. Then , so divides , but the theorem needs a prime, and is not one, so the step "therefore divides " is not available. And that's just as it should be, because is rational. The proof breaks exactly where it ought to.
Combining rationals with irrationals
Once you have one irrational number in hand, many others come almost for free.
is irrational. Suppose it were rational, say . Then . The right side is a difference of two rationals, hence rational, making rational, which it is not. Contradiction.
is irrational. If were rational, then would be rational too. Contradiction.
See the pattern? A non-zero rational added to, subtracted from, multiplied by or dividing an irrational always leaves an irrational.
Two irrationals, though, can team up to make a rational. and . So "irrational plus irrational is irrational" is simply false, and writing it in an exam costs marks.
Practice
- Prove that is irrational.
- Prove that is irrational, given that is irrational.
- Prove that is irrational.
- Give two irrational numbers whose product is rational, and two whose product is irrational.
- Explain, in one sentence, why the proof of irrationality of cannot be adapted to .
Answers
Show answers
- Assume with no common factor. Then , so , so (as is prime). Put : , so , giving . Both share , contradiction.
- Suppose is rational. Then , a rational, contradicting the irrationality of .
- Suppose is rational and non-zero. Then is rational, contradiction.
- Product rational: . Product irrational: .
- Because is not prime, the step " implies " is unavailable, and rightly so, since is rational.