Q1: Prove that is irrational.
SOLUTION
UNDERSTAND THE QUESTION
- Proof by contradiction: assume in lowest terms and show divides both and .
Step 1 — ASSUME RATIONAL, SHOW 5 DIVIDES A
Suppose is rational. Then for coprime integers with .
So divides , and since is prime, divides . Write for some integer .
Step 2 — SHOW 5 DIVIDES B: CONTRADICTION
Substitute in (1):
So divides , hence divides . Now divides both and , which contradicts and being coprime. So the assumption is wrong.
ANSWER
Hence, is irrational.
COMMON MISTAKES
- Skipping "coprime": the contradiction only works because and were assumed to have no common factor.
- Assuming divides from divides without justification: must use that is prime.