How do you use methods of an indirect proof to determine whether a short proof is logically valid?
do you have an example
you can use proof by contradiction assume the negation of your claim , show that this leads to a contradiction. so your claim must be true.
well not really but the lesson is on indirect proofs
for example : Claim: sqrt(2) is irrational proof : assume sqrt(2) is rational (negation of the original claim) we can show that a contradiction follows if sqrt(2) = p/q
can you give me another example ?
lets do an easier proof. since that one is kind of hard claim : if n is even then n^2 is even.
Indirect Proof: Assume what you need to prove is false, and then show that something contradictory (absurd) happens.
ok thanks a lot
yes ?
ok so assume the claim above is false. ie, it is false that ' if n is even then n^2 is even'. This is a little harder to negate than the last example. How do you negate a conditional? Negating p->q is p and not q. This means that n is even and n^2 is not even (odd). From this can we produce a contradiction?
cant you say if n^2 is odd then n has to be even ?
well we are given that n is even and n^2 is odd by negating our original statement. actually if n^2 is odd then n is odd. but that is harder to prove. how about this, if n is even, then n = 2k, then n^2 = 4k^2, so n^2 is even. but we assumed that n^2 is odd. contradiction
ok give me a moment
i honestly dont have a clue
Join our real-time social learning platform and learn together with your friends!