Proof Strategy Practice

1.2.1

1.2.1

a

Theorem

3 is irrational.

Proof
Assume for contradiction that 3 is rational, so then:
pq=3
for some p,qZ where q0 and p,q don't share any common factors. Squaring both sides gives that:
p2=3q
so 3|p2, or p2 has a factor of 3. Notice that because of that:
p23=p3pZ
so then since pZ then clearly 3|p so then set p=3k for some kZ so then:
(3k)2=3q29k2=q2q2=3p
so then q2 is divisible by 3, and by the same argument 3|q which contradicts p,q not sharing any factors.

Note that the argument would follow similarly for 6, except that when we breakup p2/6 notice that 6 isn't prime so then we'll get:
p26=p2p3
so we show that p is either divisible by 2 or by 3 and continue the argument to show that q shares the same factor.

b

The proof for showing 4 would work in the same way it did for 1.2 - Set Theory Review#1.2.1#a since we'd get to:
p2=4q2=2(2q2)
so then p is even, so then p=2k:
(2k)2=2(2q2)4k2=4q2k2=q
but this couldn't lead to a contradiction as k=|q| so then p=2|q| so then:
pq=2|q|q=±2
which doesn't give a contradiction.

1.2.2

Theorem

There is no rational number r satisfying 2r=3.

Proof
Assume for contradiction that there is some rational number rQ such that 2r=3. Namely:

r=ab;a,bZ;b0

So then plugging in:

2r=32ab=32a=3bRaise both to b power

But this can't be true. Here 2,3 are prime numbers, so 2a is already in it's prime factorization and similar with 3b. Since prime factorizations are unique and since 2a=3b then the hidden 20 on the RHS suggests that a=0. Doing something similar with the LHS 30 suggests b=0 but that contradicts b0!

Therefore the assumption was false, so r cannot exist.