2 ms·
First 3 lines are same as yours. Consider k. Either it is 0, or greater. Consider 0. In that case, X is not divisible by 2, hence cannot be 2. Now consider k
by ikeboy 12y ago
First 3 lines are same as yours.
Consider k. Either it is 0, or greater. Consider 0. In that case, X is not divisible by 2, hence cannot be 2.
Now consider k positive. (My original proof didn't show k wa positive, so I needed to deal seperately.)
Use your proof to show that 2^(2k) > 2, and then 2!=X. As far as I can tell you never actually used the assumption that 2=x, so that can be deleted from the proof and it remains valid.
- ebola1717 12y agoI think "Proof by cases" uses proof by contradiction. You're proving that given A -> C and !A -> C, then C, which requires the axiom A v !A, i.e. proof by contradiction. In your proof, you've proven k=0 -> X != 2, and k > 0 -> X !=2, but it doesn't follow that X != 2 without contradiction.
- ikeboy 12y agoI proved k was a whole number previously. I don't need that axiom, because I can prove it in the case of k.