Curious Cat Science and Engineering Blog

July 8, 2007

1=2: A Proof

See if you can figure out in which step the fallacy lies. When you think you’ve figured it out, click on that step and the computer will tell you whether you are correct or not, and will give an additional explanation of why that step is or isn’t valid.

See how many tries it takes you to correctly identify the fallacious step!

This is a nice quick math refresher but the real reason I posted it is so I can say I got it on the first try

by curiouscat Tags: Math, Students
Permalink to: 1=2: A Proof Trackback: http://engineering.curiouscatblog.net/2007/07/08/12-a-proof/trackback/

2 Responses to “1=2: A Proof”

MB Web Design Says:
July 23rd, 2007 at 3:32 pm
To my shame, I only got it on the third attempt…
Curious Cat Math Blog » The Simplest Universal Turing Machine Is Proved Says:
October 30th, 2007 at 7:14 pm
“But today I am thrilled to be able to announce that after only five months the prize is won–and we have answer: the Turing machine is in fact universal! Alex Smith–a 20-year-old undergraduate from Birmingham, UK–has produced a 40-page proof…”

M	T	W	T	F	S	S
« Jun				Aug »
						1
2	3	4	5	6	7	8
9	10	11	12	13	14	15
16	17	18	19	20	21	22
23	24	25	26	27	28	29
30	31

2 Responses to “1=2: A Proof”

Leave a Reply

Internal Links

Author

Categories

Other

Search Blog

Web Search

Archives

Translate to