Proof
Assume for contradiction that is rational, so then:
for some where and don't share any common factors. Squaring both sides gives that:
so , or has a factor of . Notice that because of that:
so then since then clearly so then set for some so then:
so then is divisible by , and by the same argument which contradicts not sharing any factors.
☐
Note that the argument would follow similarly for , except that when we breakup notice that 6 isn't prime so then we'll get:
so we show that is either divisible by 2 or by 3 and continue the argument to show that shares the same factor.
b
The proof for showing would work in the same way it did for 1.2 - Set Theory Review#1.2.1#a since we'd get to:
so then is even, so then :
but this couldn't lead to a contradiction as so then so then:
which doesn't give a contradiction.
1.2.2
Theorem
There is no rational number satisfying .
Proof
Assume for contradiction that there is some rational number such that . Namely:
So then plugging in:
But this can't be true. Here are prime numbers, so is already in it's prime factorization and similar with . Since prime factorizations are unique and since then the hidden on the RHS suggests that . Doing something similar with the LHS suggests but that contradicts !
Therefore the assumption was false, so cannot exist.
☐