News for hackers. Stuff that matters.
Re:Proof that 1 = 0 using a common logical fallacy by bad_user on Wednesday March 17, 2010 @07:52PM (#1200016)
He's not dividing by zero. He's just using ...

  a = b -> a - b = 0 -> c * (a - b) = 0 -> c * a = c * b
The whole point of the article is that implication is a binary function that doesn't have an intuitive behavior to many people.

Like the following statement which evaluates to TRUE ...

  I have 6 legs *implies* it will rain tonight
That's because the definition of the function is this ...

  A -> B => NOT(A) or B
And this actually makes sense ...

  I have 6 legs *implies* I am not normal
Which is true. But the reverse is false ...

  I am not normal, therefore I have 6 legs
A -> B doesn't imply that B -> A. The equivalence function would be ...

  (NOT(A) and NOT(B)) or (A and B)
Re:Proof that 1 = 0 using a common logical fallacy by jules on Wednesday March 17, 2010 @08:47PM (#1200151)
I think this is what he meant: Sometimes you can extract a valid proof from this kind of bad proof by reading it in reverse:

    3. 0=0
    2. 1*0=0*0
    1. 1=0
However, in this case the step from 2 to 1 requires "division by 0".
Re:Proof that 1 = 0 using a common logical fallacy by dpapathanasiou on Thursday March 18, 2010 @09:22AM (#1201180)
Jules is right; I wasn't talking about the Levine proof, but rather the 3 step proof the blog author mentions after that.

Step 2 is division by zero.