So, in the last post we proved that is irrational, by trying to see what the consequences would be if it were rational. We first said that if it were rational, then we should be able to write it in a simplest form where p and q had no common factors, and then showed that in fact this was impossible, so our original proposition was indeed true (as trying to prove otherwise gave us a contradiction).

Now we are going to look at another example, which looks very similar, but here our contradiction will be a little different to last time. The fact is that, unlike much of what you would have done at highschool, there isn’t such a roadmap to how to do things here – you have to figure out for yourself where the contradiction comes in. In these posts I will point them out for you, but in general, you need to build your intuition about where something looks a bit dodgy and a contradiction is raising its head.

So, let’s try and prove that is irrational. We will start with the same game plan and see where we go. We want to show that the converse statement can’t hold. So let’s say: What would happen if were rational? If that were the case, then we could write it in a simplest form:

Where p and q have no common factors (that should certainly be possible if it’s a rational number). OK, again, let’s square both sides and rearrange:

Hmm, so now it turns out that we don’t have the same reasoning as before, about being even, so we can’t go down that route. There are two possible routes now. Let’s follow the first which involves using something called The Fundamental Theorem of Arithmetic. This states that:

*Every integer greater than one is either prime or is a product of primes. Most importantly, it says that this product of primes is unique.*

What this means is that if I give you a number, you can always decompose it into a product of prime numbers uniquely. For instance 872 can be decomposed into the product:

Where 2 and 109 are prime numbers. There are no other ways of writing 872 as a product of primes. Let’s take another random example: 1325:

Where 5 and 53 are prime. This fact is actually hugely important for cryptography – the science of hiding information, as used most commonly in internet banking, email systems and many, many other things.

Why is this important? Well, if a given number can be written as the product of a certain number of primes, then that number squared will be written as twice as many primes. For instance. If an integer, a, was 315, then you can write it as:

ie as a product of four primes (it doesn’t matter that they’re not all different). But in that case could be written:

Ok, so who cares? Well, this is rather important because it means that a number squared will always be written as the product of an even number of prime numbers (the number above is written as the product of 8 prime numbers). Hmm, so in the above, can be written as the product of an even number of primes, and so can for the same reason. But on one side we have an extra number (3). This means that must be decomposed as an odd number of primes (an even number for and one more for the 3). On the right hand side, we just have so this is an even number of primes. So we have that the product of an odd number of primes is equal to the product of even number of primes. However, from the fundamental theorem of arithmetic, we know that any number has a unique prime decomposition, and so you can’t write it in two different ways. This then is our contradiction, we can’t have a number which can be written as the product of both an even number of primes, and as the product of an odd number of primes.

There are actually several other ways of proving this same thing without using this fundamental theorem of arithmetic, and which are a bit more like the previous proof for but I think that this one is the most elegant. You will find a more similar proof to the last one here.

Let’s see again what we did:

- We presumed that the original statement was not true
- If that were the case it could be written in the form of one integer divided by another where they have no common factors.
- Rearranging and using the fundamental theorem of arithmetic we see that one side of the equation has an even number of primes, and the other side has an odd number of primes..
- This is impossible and thus we have found a contradiction if we presume that the statement is false.
- The statement must therefore be true.

In the next post we will look at another example of proof by contradiction.

Adhil RamgoolamMarch 23, 2016 at 7:48 pmWhy do you say “The Fundemental Theorem of Algebra” in the last paragraph? Surely you meant “Arithmetic”?

Jonathan ShockMarch 23, 2016 at 7:56 pmWell spotted!

JessMarch 29, 2016 at 12:50 pmThank you!!:) This helps so much

Desmond DyasiApril 1, 2016 at 7:29 pmThanks a lot.:-)

UCT MAM1000W lecture notes subject links – MathemafricaJanuary 17, 2018 at 10:06 am[…] Proof by contradiction – part 2 […]