To prove that root 7 is irrational, we use proof by contradiction: we suppose $\sqrt{7}$ is rational, follow that assumption logically, and show it forces an impossible situation. Because the assumption breaks, its opposite must hold, so $\sqrt{7}$ is irrational. An irrational number is one that cannot be written as $\frac{p}{q}$ for integers $p$ and $q$ with $q \neq 0$.
What Is an Irrational Number?
An irrational number is a real number that cannot be written as $\frac{p}{q}$ for any two integers $p$ and $q$ with $q \neq 0$. Its decimal expansion never terminates and never settles into a repeating block. Values like $\sqrt{7}$, $\pi$, and $e$ are irrational; every integer, every terminating decimal, and every repeating decimal is rational.
The square root of 7 is a natural candidate because 7 is not a perfect square — no whole number squares to 7, since $2^2 = 4$ and $3^2 = 9$. That already shows $\sqrt{7}$ is not a whole number, but "not a whole number" is weaker than "irrational": $\frac{1}{2}$ is not a whole number yet is perfectly rational. To prove $\sqrt{7}$ is irrational we must rule out every fraction at once, which is exactly what proof by contradiction does.
Proof That Root 7 Is Irrational
Here is the full argument laid out cleanly in one place, one step per line. The worked examples below unpack each step in more detail.
Claim: $\sqrt{7}$ is irrational.
Assume the opposite — that $\sqrt{7}$ is rational.
$\sqrt{7} = \dfrac{p}{q}, \quad \gcd(p, q) = 1, \quad q \neq 0$
Square both sides.
$7 = \dfrac{p^2}{q^2}$
Multiply through by $q^2$.
$p^2 = 7q^2$
So 7 divides $p^2$. Because 7 is prime, 7 divides $p$.
Write $p = 7k$.
$(7k)^2 = 7q^2$
$49k^2 = 7q^2$
$7k^2 = q^2$
So 7 divides $q^2$, and because 7 is prime, 7 divides $q$.
Now 7 divides both $p$ and $q$, which contradicts $\gcd(p, q) = 1$. The assumption is false, so $\sqrt{7}$ is irrational. $\blacksquare$
The General Method — Why It Works for Any Prime
Nothing in the proof used the specific value 7 except one fact: 7 is prime. That single property drives both divisibility steps through the prime-divisibility rule:
If a prime $r$ divides $n^2$, then $r$ divides $n$.
Swap 7 for any other prime and the argument runs unchanged. The square roots of $2$, $3$, $5$, $11$, $13$, and every other prime are irrational for exactly this reason. You can see the same structure applied in the proofs that root 2 is irrational and root 5 is irrational.
The method stops working the moment the number is not prime. For $\sqrt{4}$, the step "4 divides $p^2$ implies 4 divides $p$" is false (4 divides $6^2 = 36$ but not 6), and indeed $\sqrt{4} = 2$ is rational. The proof and the counterexample are two sides of the same rule.
Examples of Proving Root 7 Is Irrational
Example 1: Show the assumption we start from and why $p$ and $q$ share no factor
Assume $\sqrt{7}$ is rational.
Then $\sqrt{7} = \dfrac{p}{q}$ for integers $p$ and $q$ with $q \neq 0$.
We take the fraction in lowest terms, so $p$ and $q$ are coprime.
$\gcd(p, q) = 1$
This "lowest terms" starting point is the whole engine of the proof: the contradiction will be that $p$ and $q$ turn out to share the factor 7.
Example 2 (Wrong path first): Try to prove it by just computing the decimal, and see why that fails
A first instinct is to reach for the decimal.
$\sqrt{7} = 2.6457513...$
The digits look like they never repeat, so it is tempting to declare it irrational right there.
But a decimal readout can never prove irrationality: you have only seen finitely many digits, and a repeating block could still appear later (the way $\frac{1}{7} = 0.142857142857...$ repeats only after six digits). A calculator shows evidence, not proof.
The rescue is the algebraic argument. Assume rationality, then force a contradiction that no amount of computation can escape. That is what the remaining examples build.
Example 3: Square both sides and rearrange to expose the divisibility
Start from the assumption.
$\sqrt{7} = \dfrac{p}{q}$
Square both sides.
$7 = \dfrac{p^2}{q^2}$
Multiply through by $q^2$.
$p^2 = 7q^2$
This single equation says $p^2$ is a multiple of 7, which is the fact we exploit next.
Example 4: Use prime divisibility to conclude 7 divides $p$
From $p^2 = 7q^2$, the number 7 divides $p^2$.
Because 7 is prime, if 7 divides $p^2$ then 7 divides $p$.
So we may write $p = 7k$ for some integer $k$.
$p = 7k$
The prime-divisibility rule is the load-bearing step, and Example 5 is where it strikes twice.
Example 5: Substitute back and reach the contradiction
Replace $p$ with $7k$ in $p^2 = 7q^2$.
$(7k)^2 = 7q^2$
$49k^2 = 7q^2$
Divide both sides by 7.
$7k^2 = q^2$
Now 7 divides $q^2$, and since 7 is prime, 7 divides $q$ as well.
So 7 divides both $p$ and $q$. That contradicts $\gcd(p, q) = 1$. The assumption fails, so $\sqrt{7}$ is irrational.
Example 6: Adapt the same argument to $\sqrt{11}$ to test that you understand it
Assume $\sqrt{11} = \dfrac{p}{q}$ in lowest terms.
$p^2 = 11q^2$
Since 11 is prime and divides $p^2$, it divides $p$, so $p = 11k$.
$121k^2 = 11q^2$
$11k^2 = q^2$
11 divides $q$ too, contradicting $\gcd(p, q) = 1$, so $\sqrt{11}$ is irrational. The template works for the square root of any prime.
Why This Proof Exists — "A crisis over a hidden number"
The irrationality of roots is not a modern curiosity. The Pythagoreans of ancient Greece believed every length was a ratio of whole numbers, and the discovery that $\sqrt{2}$ (the diagonal of a unit square) could not be written as a fraction reportedly shook their worldview. That discovery is the ancestor of the exact argument above.
The proof matters because it draws a hard line between two kinds of numbers:
Rational numbers — anything expressible as $\frac{p}{q}$, including every terminating or repeating decimal.
Irrational numbers — values like $\sqrt{7}$, $\pi$, and $e$ that no fraction can capture, no matter how long the decimal runs.
The single trick that makes it work is the prime-divisibility rule: for a prime $r$, if $r$ divides $n^2$ then $r$ divides $n$. This is why the proof works for $\sqrt{7}$, $\sqrt{2}$, $\sqrt{11}$, and every prime, but not for $\sqrt{4}$, since 4 is not prime and $\sqrt{4} = 2$ is perfectly rational. You can read the broader story of these numbers in the irrational number definition, and the same contradiction structure appears in the proof that root 3 is irrational.
Common Mistakes When Proving Root 7 Is Irrational
Mistake 1: Forgetting the "lowest terms" assumption
Where it slips in: Writing $\sqrt{7} = \frac{p}{q}$ without stating that $\gcd(p, q) = 1$.
Don't do this: Reaching "7 divides both $p$ and $q$" and calling it a contradiction — without the coprime assumption, there is nothing to contradict.
The correct way: State up front that $\frac{p}{q}$ is in lowest terms, so $p$ and $q$ share no common factor. The final line then genuinely contradicts it.
Mistake 2: Using the rule for a composite number
Where it slips in: Assuming "$r$ divides $n^2$ implies $r$ divides $n$" holds for any $r$.
Don't do this: Applying it with $r = 4$: 4 divides $6^2 = 36$, but 4 does not divide 6. The rule fails for composite numbers.
The correct way: The step only holds because 7 is prime. Name "7 is prime" explicitly each time you use it, so the argument is airtight.
Mistake 3: Trying to prove it from the decimal
Where it slips in: Treating a long non-repeating decimal from a calculator as a finished proof. The rusher stops at "the digits don't repeat" and moves on; the second-guesser keeps scrolling for more digits, hoping certainty will arrive.
The correct way: A decimal shows evidence only. Proof needs the algebra: assume rationality, derive the shared factor 7, contradict "lowest terms."
Conclusion
To prove that root 7 is irrational, assume $\sqrt{7} = \frac{p}{q}$ in lowest terms and derive a contradiction.
Squaring gives $p^2 = 7q^2$, and because 7 is prime, 7 divides $p$, then 7 divides $q$, contradicting $\gcd(p, q) = 1$.
The same proof by contradiction works for the square root of any prime, but not for perfect squares like $\sqrt{4}$.
To work through more proofs like this with a teacher, try an algebra tutor, get targeted help with algebra, or explore math classes online.
Read More
Was this article helpful?
Your feedback helps us write better content