Prove that log₂(3) is irrational

medium CBSE JEE-MAIN 3 min read

Question

Prove that log23\log_2 3 is irrational.

Solution — Step by Step

Suppose, for contradiction, that log23\log_2 3 is rational.

Then we can write log23=pq\log_2 3 = \dfrac{p}{q} where p,qp, q are integers, q>0q > 0, and the fraction is in lowest terms (gcd(p,q)=1(p, q) = 1).

By the definition of logarithm:

log23=pq    2p/q=3\log_2 3 = \frac{p}{q} \implies 2^{p/q} = 3

Raising both sides to the power qq:

2p=3q2^p = 3^q

The equation 2p=3q2^p = 3^q says a power of 2 equals a power of 3.

The left side, 2p2^p, has only 2 as a prime factor. Its prime factorisation is 2p2^p.

The right side, 3q3^q, has only 3 as a prime factor. Its prime factorisation is 3q3^q.

For these to be equal, both sides must have the same prime factorisation. But 2p2^p contains only the prime 2, while 3q3^q contains only the prime 3. These cannot be equal unless both are 1 (i.e., p=q=0p = q = 0).

But p=q=0p = q = 0 would mean log23=0\log_2 3 = 0, which implies 20=32^0 = 3, i.e., 1=31 = 3 — a contradiction.

So 2p=3q2^p = 3^q has no solution with positive integers p,qp, q. This contradicts our assumption.

Since assuming log23\log_2 3 is rational leads to a contradiction, log23\log_2 3 must be irrational.

Why This Works

The proof relies on the Fundamental Theorem of Arithmetic: every integer greater than 1 has a unique prime factorisation. Since 2 and 3 are different primes, no power of 2 can equal a power of 3 (except 20=30=12^0 = 3^0 = 1, but that would require p=q=0p = q = 0, which doesn’t work).

More generally: logab\log_a b is irrational whenever aa and bb are “multiplicatively independent” — when there are no integers p,qp, q such that ap=bqa^p = b^q.

Alternative Method — Elegant One-Liner

By unique factorisation: 2p=3q    2^p = 3^q \implies the left side is even, the right side is odd. An even number cannot equal an odd number. Contradiction. ✓

This version is cleaner for exams — works because 2 is even and 3 is odd.

Common Mistake

A common error in proof by contradiction: students assume log23=p/q\log_2 3 = p/q but then forget to check what constraints pp and qq must satisfy. The key is that p,qp, q are positive integers (since log23>0\log_2 3 > 0). If we allowed p=q=0p = q = 0, that’s a trivial case that’s easily ruled out separately.

The same proof technique works for many similar irrationality proofs: log25\log_2 5, log37\log_3 7, log49\log_4 9 (check: 4p=9q22p=32q4^p = 9^q \Rightarrow 2^{2p} = 3^{2q} — same argument). The method fails for log48=3/2\log_4 8 = 3/2 (rational!) because 43=82=644^3 = 8^2 = 64 — here both have the same prime base (2).

Want to master this topic?

Read the complete guide with more examples and exam tips.

Go to full topic guide →

Try These Next