Square Root of the Primes

## **Problem**

Prove that the square root of a prime number is irrational.

## **Solution**

Let

p

{\displaystyle p}

 be a prime number. If

p

{\displaystyle \sqrt{p} }

 to be rational, it must be expressible as the quotient of two coprime integers, say

m
,
n

{\displaystyle m,n}

, where

g
c
d
(
m
,
n
# )
1

{\displaystyle gcd(m,n) = 1 }

.

p

=

m
n

{\displaystyle \sqrt{p} = \frac{m}{n}}

Squaring both sides of the equation, we get

# p

m
2

n
2

{\displaystyle p = \frac{m^2}{n^2} }

p

n
2

=

m
2

{\displaystyle pn^2 = m^2 }

Express

m

{\displaystyle m}

 and

n

{\displaystyle n}

 as the product of powers of unique prime factors:

# m

p

1

α

1

p

2

α

2

p

3

α

3

.
.
.

p

i

α

i

{\displaystyle m = {p}\_{1}^{{\alpha}\_{1}} {p}\_{2}^{{\alpha}\_{2}} {p}\_{3}^{{\alpha}\_{3}} ... {p}\_{i}^{{\alpha}\_{i}} }

# n

q

1

β

1

q

2

β

2

q

3

β

3

.
.
.

q

j

β

j

{\displaystyle n = {q}\_{1}^{{\beta}\_{1}} {q}\_{2}^{{\beta}\_{2}} {q}\_{3}^{{\beta}\_{3}} ... {q}\_{j}^{{\beta}\_{j}} }

Thus,

p

n
2

=

m
2

{\displaystyle pn^2 = m^2 }

becomes

p

(

q

1

β

1

q

2

β

2

q

3

β

3

.
.
.

q

j

β

j

)

2

=

(

p

1

α

1

p

2

α

2

p

3

α

3

.
.
.

p

i

α

i

)

2

{\displaystyle p{\left({q}\_{1}^{{\beta}\_{1}} {q}\_{2}^{{\beta}\_{2}} {q}\_{3}^{{\beta}\_{3}} ... {q}\_{j}^{{\beta}\_{j}}\right)}^{2} = {\left({p}\_{1}^{{\alpha}\_{1}} {p}\_{2}^{{\alpha}\_{2}} {p}\_{3}^{{\alpha}\_{3}} ... {p}\_{i}^{{\alpha}\_{i}} \right)}^{2} }

p

(

q

1

2

β

1

q

2

2

β

2

q

3

2

β

3

.
.
.

q

j

2

β

j

)

=

(

p

1

2

α

1

p

2

2

α

2

p

3

2

α

3

.
.
.

p

i

2

α

i

)

{\displaystyle p\left({q}\_{1}^{2{\beta}\_{1}} {q}\_{2}^{2{\beta}\_{2}} {q}\_{3}^{2{\beta}\_{3}} ... {q}\_{j}^{2{\beta}\_{j}}\right) = \left({p}\_{1}^{2{\alpha}\_{1}} {p}\_{2}^{2{\alpha}\_{2}} {p}\_{3}^{2{\alpha}\_{3}} ... {p}\_{i}^{2{\alpha}\_{i}} \right) }

According to the right hand side of the equation, the exponents of all unique prime factors all become even numbers (any integer multiplied by 2 is an even number). This suggests that if the two sides are to equate, the left hand side of the equation should also be comprised of unique prime factors with even powers. However, there is an extra factor

p

{\displaystyle p}

 that makes this impossible. There are two cases to show: one, if

p

{\displaystyle p}

 occur in the prime factorization of

m
2

{\displaystyle m^2}

; two, if

p

{\displaystyle p}

  does not occur in the prime factorization of

m
2

{\displaystyle m^2}

.

**Case 1:** If

p

{\displaystyle p}

 does occur in the prime factorization of

m
2

{\displaystyle m^2}

, then say

# p

q
j

{\displaystyle p = q\_j }

, we get a factor

p

(

q

j

2

β

j

)

=

p

2

β

j

1

{\displaystyle p\left(q\_{j}^{2{\beta}\_{j}} \right) = {p}^ {2{\beta}\_{j} + 1}}

, which is a prime factor with an odd power. This contradicts our above assumption that the left hand side of the equation must contain only prime factors with even powers.

**Case 2:** If

p

{\displaystyle p}

 does not occur in the prime factorization of

m
2

{\displaystyle m^2}

, then we get a unique prime factor

p

{\displaystyle p}

 with an odd power (1). Once again, this contradicts our above assumption that the left hand side of the equation must contain only prime factors with even powers.

Since Case 1 and Case 2 are clear contradictions, we must reject the assumption that

p

{\displaystyle \sqrt{p} }

 is rational. Therefore, the square root of a prime number is irrational.

## **Historical Note**

**Hippasus of Metapontum** (fl.500 BC) was a philosopher and early follower of Pythagoras who first proved (a much simpler proof) that the square root of 2 is irrational. Some traditions say that he was drowned after revealing this mathematical truth!

The above diagram is called the **Spiral of Theodorus**, attributed to **Theodorus of Cyrene** (c. 465 - 399 BC) by the Greek philosopher Plato. Theodorus proved that the square root of non-square integers are irrational between 1 and 17. Our proof is only focused on the prime numbers, so extends to infinity (Euclid proved there are infinitely many primes).