How would you prove that n√2 is irrational?, where n∈{2,3,4,…}.
Answer
You have probably already seen the proof for n=2. So, let's assume that n≥3.
Seeking a contradiction, suppose that n√2 is rational. This, together with the positivity of n√2 imply that there exist p,q∈N such that n√2=p/q. Raising both sides to the nth power, we see that
2=pnqn.
Multiplying through by qn and using 2qn=qn+qn, we have
qn+qn=pn.
This violates Fermat's Last Theorem, giving a contradiction. Thus n√2 is irrational.
No comments:
Post a Comment