# Prove: The Square Root of a Prime Number is Irrational.

In our previous lesson, we proved by contradiction that the square root of 2 is irrational. This time, we are going to prove a more general and interesting fact. We will also use the proof by contradiction to prove this theorem.

That is, let p be a prime number then prove that \sqrt p is irrational.

But first, let’s define a prime number. A prime number is a positive integer greater than 1 that has **exactly two** positive integer divisors: namely, 1 and itself.

To see it for yourself, below is the list of the first ten (10) prime numbers. Notice that each of them is only divisible by \large{1} and itself. Just a side-note, the number 2 is the only EVEN prime number.

- 2
- 3
- 5
- 7
- 11
- 13
- 17
- 19
- 23
- 29

To prove this theorem, we will use the method of Proof by Contradiction. We will assume the negation (or opposite) of the original statement to be true. That is, let \color{red}p be a prime number and \sqrt {\color{red}p} is a rational number. Now, the line of thought is to prove that \sqrt {\color{red}p} is rational. However, we expect a contradiction such that we discard the assumption, and therefore claim that the original statement must be true, which in this case, the square root of a prime number is irrational.

Since we assume that \sqrt p is rational, it means there exists two positive integers a and b but b \ne 0 that we can express as a ratio like the one below.

An essential part of this proof is to further assume that the greatest common divisor of a and b is 1. We can write it symbolically in math as \gcd \left( {a,b} \right) = 1.

This equation is asking to be squared on both sides, and see what we can make sense of it after doing so.

\left( {\sqrt p } \right)^2 ={ \Large{{\left( {{a \over b}} \right)^2}}}

Multiply both sides of the equation by b^2 to get rid of the denominator. This is the result.

\Large{{\color{red}p}\,{b^2} = {a^2}}

I want to move around the equation so that it is much easier to understand what it is trying to say. I hope you agree that the equation above is exactly the same as the one below.

Since a is a positive integer greater than 1 then you can express it as a product of unique prime numbers with even or odd powers. However, by raising a to the power of 2, a^2 must have prime factorizations wherein each unique prime number will have an even exponent.

Let’s have an example to amplify what I meant above. Suppose a = 3,780. Breaking it down as a product of prime numbers, we get a = 2 \cdot 2 \cdot 3 \cdot 3 \cdot 3 \cdot 5 \cdot 7. We can condense the prime factorization by rewriting it as a = {2^2} \cdot {3^3} \cdot 5 \cdot 7. Notice how we removed duplicates of prime numbers by expressing it as factors of primes with each unique prime having the appropriate power. The exponent tells how many times the prime number appears in the prime factorization.

Notice that in the prime factorization of integer \color{blue}\large{a}, the prime numbers can either have an odd or even exponent. This is an important observation that we will take advantage of later.

The next step is to square the integer \color{blue}\large{a}, thus we have \color{blue}\large{a^2}.

Apply the Power of a Power Rule of Exponent. We will use this property to square the integer \color{blue}\large{a}. In a nutshell, this exponent rule will allow us to distribute the outermost exponent 2 to the exponents of the unique prime numbers inside the parenthesis.

After squaring the integer \color{blue}\large{a}, the exponents of the unique prime factors of \color{blue}\large{a} are now ALL **even** numbers. It is the case since the product of 2 and any integer will always be an even number. This is the most important observation that we can take from this step. We will definitely revisit this result.

Why did we spend some time prime factorizing the integer above? The reason is to demonstrate or illustrate by example the Fundamental Theorem of Arithmetic which is central to the proof of this theorem.

**The Fundamental Theorem of Arithmetic**

The Fundamental Theorem of Arithmetic states that for every integer n greater than one, n > 1, we can express it as a prime number or product of prime numbers. The theorem further asserts that each integer has a unique prime factorization thus it has a distinct combination or mix of prime factors. In other words, the prime factorization of an integer is so unique because each prime factor always appears in the same amount or quantity thereby the arrangement doesn’t matter.

In order to have uniformity in our application of the fundamental theorem of arithmetic, we have to agree that we write the prime factors of an integer in **ascending order**. This way we can clearly see without any doubt that each integer’s prime factorization (greater than 1) is clearly unique.

**Examples:**

126 = 2 \cdot 3 \cdot 3 \cdot 7 = 2 \cdot {3^2} \cdot 7

5,070 = 2 \cdot 3 \cdot 5 \cdot 13 \cdot 13 = 2 \cdot 3 \cdot 5 \cdot {13^2}

12,375 = 3 \cdot 3 \cdot 5 \cdot 5 \cdot 5 \cdot 11 = {3^2} \cdot {5^3} \cdot 11

The next logical step is to **generalize** the factorization of any integer greater than 1 using the fundamental theorem of arithmetic.

Recall that in Equations #1, #2, and #3, it is clear that we must show how to factorize integers a and b in general form. And more importantly, we will need to examine what happens to the prime factorizations of integers a and b when we square both of them, that is a^2 and b^2.

- Here is the factorization of integer \large{a} into its prime constituents.

Observe: The exponents of the unique prime factors of integer \large{a} are either even or odd integers. That means, {n_1},{n_2},{n_3},{n_4},…{n_j} are even or odd integers.

Then we square the prime factorization of integer \large{a}. This is what we got.

Observe: The effect or consequence of squaring the unique prime factors of integer \large{a} (raising to the power of 2) is that all exponents become even numbers since 2 multiplied by any integer will always be an even number.

- By the same token, we will factorize integer \large{b} and then square it.

**Notice:** The same observation from integer \large{a} can be drawn for integer \large{b}. The exponents of the prime factors of \large{b} are either even or odd. But upon squaring it, the exponents all become even numbers.

We are now ready to put the strategy of the proof together. To do that, we will need to revisit Equation #3.

In a nutshell, this is the meaning of Equation #3 above. The left side of the equation is \large{a^2}. As we have shown before in this lesson, the prime factorization of \large{a^2} is a product of unique prime numbers with even powers. It implies that the right-hand side of the equation with the expression \large{p\,{b^2}} must also be a product of unique prime factors with even exponents.

So the next logical step is to consider the two possible cases/scenarios below.

**1.** The prime number \large{\color{red}p} occurs in the unique prime factorization of \large{b^2}.

**Answer:** If \large\color{red}p occurs in the prime factorization of \large{b^2}, then we have \large\color{red}p times \large{{p^{\,2k}}} which is equal to \large{{p^{\,2k + 1}}}. Thus, the resulting \large{p} has an odd power which is 2k+1. This is obviously a **contradiction**.

**2.** The prime number \large\color{red}p is **not** included (excluded) in the unique prime factorization of \large{b^2}.

**Answer:** If \large\color{red}p does not occur in the prime factorization of \large{b^2}, then \large\color{red}p must stand on its own. Thus, \large\color{red}p has an odd power which is 1. This is unquestionably a **contradiction** as well.

**The Bottom Line:** In both cases, we have contradictions because a^2 implies that its unique prime factors must have even powers.

**Conclusion:** Since we have reached contradictions in both cases, we shall reject the assumption that \large\color{red}{\sqrt p } is rational and therefore the original statement must be true that \large\color{red}{\sqrt p } is irrational.

## WRITE THE PROOF

**THEOREM: **If \large{p} is a prime number, then \large{\sqrt p } is irrational.

**PROOF: **Let’s assume by contradiction that \large{\sqrt p } is rational where \large{p} is prime. Since \large{\sqrt p } is a rational number, we can express it as a ratio/fraction of two positive integers \large{\sqrt p = }\Large{{a \over b}} where a and b belong to the set of positive integers, b is not equal to zero, and the Greatest Common Divisor (GCD) of a and b is 1. Now, squaring both sides of the equation, we obtain \large{p =} \Large{{{{a^2}} \over {{b^2}}}}. We multiply both sides by b^2 to get rid of the denominator, thus we get p\,{b^2} = {a^2}. Rearrange the equation by moving the expression on the left to the right, and the one on the right to the left. This gives us {a^2}={\color{red}p}\,{b^2}. Now, let’s prime factorize both integers a and b.

For a, we have \large{a = p_1^{{n_1}}\,p_2^{{n_2}}\,p_3^{{n_3}}\,p_4^{{n_4}}\,p_5^{{n_5}} \cdot \cdot \cdot p_n^{{n_j}}}. The powers of the unique prime factors are even or odd numbers. Now, if we square a, we get \large{{a^2} = {\left( {p_1^{{n_1}}\,p_2^{{n_2}}\,p_3^{{n_3}}\,p_4^{{n_4}}\,p_5^{{n_5}} \cdot \cdot \cdot p_n^{{n_j}}} \right)^2}} then simplify by multiplying the outermost exponent which is \color{red}2 to each and every exponent of the unique prime factor to obtain \large{{a^2} = p_1^{2{n_1}}\,p_2^{2{n_2}}\,p_3^{2{n_3}}\,p_4^{2{n_4}}\,p_5^{2{n_5}} \cdot \cdot \cdot p_n^{2{n_j}}}. Thus, after squaring the integer a, we can clearly see that the exponents of all unique prime factors become all even numbers since any integer multiplied by 2 is always an even number.

Similarly, we can do the same for integer b. Here is its unique prime factorizations: \large{b = q_1^{{m_1}}\,q_2^{{m_2}}\,q_3^{{m_3}}\,q_4^{{m_4}}\,q_5^{{m_5}} \cdot \cdot \cdot q_m^{{m_k}}}. After squaring integer b, its prime factors will have even powers with the same reasoning that of a^2. That is, \large{{b^2} = {\left( {q_1^{{m_1}}\,q_2^{{m_2}}\,q_3^{{m_3}}\,q_4^{{m_4}}\,q_5^{{m_5}} \cdot \cdot \cdot q_m^{{m_k}}} \right)^2}} which can be simplified as \large{{b^2} = q_1^{2{m_1}}\,q_2^{2{m_2}}\,q_3^{2{m_3}}\,q_4^{2{m_4}}\,q_5^{2{m_5}} \cdot \cdot \cdot q_m^{2{m_k}}}.

Since {a^2}={\color{red}p}\,{b^2}, it implies that right hand side of the equation which is {\color{red}p}\,{b^2} is comprised of unique prime factors with even powers. This means, we will have to examine if in {\color{red}p}\,{b^2} that \color{red}p **occurs** or **does not occur** in the prime factorizations of b^2.

**Case 1:** Consider that \color{red}p **occurs** in the prime factorization of integer b^2, that means we have p\left( {p_n^{2{n_j}}} \right) = {p^{1 + 2{n_j}}} which is a prime number with an odd power. This contradicts our assumption of our main equation {a^2}={\color{red}p}\,{b^2} where {\color{red}p}\,{b^2} must contain **only** prime numbers with even powers.

**Case 2:** Consider that \color{red}p **does not occur** in the prime factorization of integer b^2, this means the prime number \color{red}p is unique and does not have the same copy in the prime factorization of b^2 which means \color{red}p has an odd power of one since \color{red}p^1. Again, this contradicts the supposition of our main equation {a^2}={\color{red}p}\,{b^2} where {\color{red}p}\,{b^2} must contain **only** prime numbers with even powers.

Since we have reached contradictions in **Case 1** and **Case 2**, we must reject the assumption and accept the original statement. Therefore, we have proved that the square root of a prime number is irrational. ◼︎

**You might also be interested in:**