In Class IX you met the irrational numbers: numbers that sit on the number line alongside the fractions but can never be written as a fraction themselves. You were told that numbers such as , and are irrational and took it on trust. In Class 10 we finally prove it, using the Fundamental Theorem of Arithmetic and a style of argument called proof by contradiction. The same method then shows that numbers such as and are irrational too. These proofs are standard board-exam questions, so this lesson sets out every step in the order you should write it.
Rational and irrational numbers
Definitions
A number is rational if it can be written as , where and are integers and . A number is irrational if it cannot be written in this form.
Examples of irrational numbers include , , , , and non-terminating, non-repeating decimals such as
Irrational numbers on the number line
Irrational numbers are real points on the number line, not vague ideas. A right-angled triangle with legs 1 and 1 has hypotenuse , and swinging that length down with a compass marks exactly. Building a second right triangle on it, with legs and 1, gives a hypotenuse of .

A stepping-stone: a prime that divides a square
The result
Theorem. Let be a prime number and a positive integer. If divides , then divides .
Why it is true
By the Fundamental Theorem of Arithmetic, write as a product of primes: , where the primes need not be different. Then
Now suppose the prime divides . Then appears in the prime factorisation of . Because this factorisation is unique, the only primes in it are , so must be one of them. But are exactly the primes that make up , so divides .
In short: squaring a number never brings in a new prime factor; it only doubles the powers of the primes already there.
Why "prime" matters
The result can fail when is not prime. For example, 4 divides , but 4 does not divide 6. This is why every proof below uses a prime.
Proof by contradiction
To prove a statement by contradiction, you assume that it is false and then reason correctly until you reach something impossible. Since correct reasoning cannot lead from a true assumption to an impossibility, the assumption must be wrong, and the original statement is true.
Method for proving that is irrational ( prime)
- Assume, to the contrary, that is rational, so with , coprime integers and .
- Square and rearrange to get .
- Conclude that divides , hence divides ; write .
- Substitute to get , so divides , hence divides .
- State the contradiction: is a common factor of and , yet they are coprime.
- Conclude that is irrational.
Worked examples
Example 1: is irrational
This is one of the most famous proofs in mathematics.
Assume, to the contrary, that is rational. Then there are integers and , with , such that . If and have a common factor other than 1, divide it out. So we may write
where and are coprime (their only common factor is 1) and .
Multiplying both sides by gives . Squaring both sides:
So 2 divides . Since 2 is prime, the stepping-stone theorem tells us that 2 divides . Write for some integer and substitute:
So 2 divides , and by the same theorem 2 divides .
Now both and have the factor 2. This contradicts the fact that and are coprime. The contradiction arose from the assumption that is rational, so that assumption is false.
Hence is irrational.

Example 2: is irrational
The same argument works with 3 in place of 2.
Assume, to the contrary, that is rational. Then for some coprime integers and with . So , and squaring gives
Therefore 3 divides , and since 3 is prime, 3 divides . Write for some integer . Substituting:
So 3 divides , and hence 3 divides . Now 3 is a common factor of and , which contradicts their being coprime. So the assumption is false, and is irrational.
Nothing in this argument used any property of 3 except that it is prime. The same steps prove that is irrational for every prime .
Combining rationals and irrationals
In Class IX you also met two general facts:
- the sum or difference of a rational number and an irrational number is irrational;
- the product or quotient of a non-zero rational number and an irrational number is irrational.
The key tool behind both is that rational numbers are closed under addition, subtraction, multiplication and division by a non-zero number. The examples below prove particular cases by contradiction.
Example 3: is irrational
Assume, to the contrary, that is rational. Then there are coprime integers and , with , such that
Rearranging,
Since and are integers, is an integer and , so is rational. This says is rational, which contradicts Example 2. Hence is irrational.
Example 4: is irrational
Assume, to the contrary, that is rational. Then there are coprime integers and , with , such that
Dividing both sides by 3,
Since and are integers and , is rational. So would be rational, contradicting Example 1. Hence is irrational.
Example 5: is irrational
Assume, to the contrary, that with , integers and . Since , also . Taking reciprocals and multiplying by 2,
which is rational because and are integers and . This contradicts Example 2, so is irrational.
What made all of this work
Every proof in this lesson has the same shape: assume the opposite, carry out correct algebra, and arrive at something impossible. For , the impossibility is that two numbers chosen with no common factor turn out to share the factor . For combinations such as , the impossibility is that a number already proved irrational turns out to be rational. Learn to recognise this pattern; it appears again and again in mathematics.
Common mistakes
- Forgetting to say that and are coprime. Without it there is no contradiction at the end.
- Writing " divides , so divides " without giving the reason: 2 is prime, so the stepping-stone theorem applies.
- Trying the same proof for a non-prime such as 4. Since 4 divides 36 but not 6, the key step fails, and in fact is rational.
- In proofs such as Example 3, not explaining why the rearranged expression is rational. Say that it is a quotient of integers with a non-zero denominator.
- Assuming that the sum of two irrationals is irrational. It need not be: .
- Using the decimal as if it were exactly . It is only an approximation, and a proof cannot rely on it.
Try these
Each answer below gives the key step; write out the full contradiction as in the examples.
- Prove that is irrational. Answer: gives , so 5 divides ; with , , so 5 divides , contradicting coprimality.
- Prove that is irrational. Answer: gives , which would be rational, contradicting question 1.
- Prove that is irrational. Answer: with gives , which would be rational.
- Prove that is irrational. Answer: gives , which would be rational.
- Prove that is irrational. Answer: gives , which would be rational.
Key terms
- Rational number
- A number that can be written as with , integers and .
- Irrational number
- A real number that cannot be written in the form , such as .
- Coprime integers
- Integers whose only common positive factor is 1, such as 8 and 15.
- Proof by contradiction
- A proof that assumes a statement is false and shows that this leads to an impossibility.
- Contradiction
- A pair of statements that cannot both be true, such as " and are coprime" and "2 divides both and ".
- Fundamental Theorem of Arithmetic
- Every composite number is a product of primes in exactly one way, apart from order.
- Closure
- The property that adding, subtracting, multiplying or dividing (by a non-zero number) two rationals gives a rational.
Common questions
Why do we assume that and are coprime?
Any fraction can be reduced to lowest terms by cancelling common factors, so this costs nothing. It is what makes the ending a contradiction: finding a common factor 2 is impossible for a fraction already in lowest terms.
Does the proof work for or ?
Both are irrational, but the argument needs a prime. For , from use the prime 2: it divides , so it divides . Writing gives , so is even; if were odd, would be odd, so is even, and 2 divides both and . For , use the result for and the rule for products.
Is exactly ?
No. is an approximation; . Since is irrational, its decimal expansion never ends and never repeats.
Can the product of two irrational numbers be rational?
Yes. For example, . The rule about products only covers a non-zero rational times an irrational.
What must a complete written proof contain?
Five things: the assumption that the number is rational, the condition that and are coprime with , the use of the prime-divides-square theorem with its reason, the contradiction, and the final conclusion.
References
- National Council of Educational Research and Training. Mathematics: Textbook for Class X. NCERT, New Delhi.
- Hardy, G. H. and Wright, E. M. An Introduction to the Theory of Numbers. Oxford University Press.
- Burton, D. M. Elementary Number Theory. McGraw-Hill Education.
- Heath, T. L. (trans.) The Thirteen Books of Euclid's Elements. Dover Publications.