- Thread starter
- #1

- Mar 22, 2013

- 573

ths thrd is devpted to teh discusion of proofs of unsovled/hard prblems and connjecturs in math.

teh rules r :

1. strt with any hard/unprved theomr/conjectur as a subejct and presnt teh crnkiest prof posssibb;e

3. one cn post a crnk-prof only once and 1 at time. other thn taht, any oter comemt/rply is not restricted.

4. try t be as much as a crnk possible!

Lt teh cntest beginn!

No idea what's going on? See here :

This thread is devoted to the discussion of (crank) proofs of unsolved problems and conjectures or relatively well-known solved theorems in mathematics (i.e., Riemann Hypothesis, Collatz conjecture, Fermats Last Theorem, Fermats little Theorem (yes!), Trisection problem, Goldbach conjecture and many others, everything you like!)

The rules are :

[1] Start with any hard/unproved theorem/conjecture as a subject and present the crankiest proof possible.

[2] One can post a crank proof only once and one at a time. Other than that, any other comments/replies are welcome!

[3] Please try to be as much as cranky as possible!!

Let the contest begin!

PS : This thread is partially inspired by this topic on MMF

teh rules r :

1. strt with any hard/unprved theomr/conjectur as a subejct and presnt teh crnkiest prof posssibb;e

3. one cn post a crnk-prof only once and 1 at time. other thn taht, any oter comemt/rply is not restricted.

4. try t be as much as a crnk possible!

Lt teh cntest beginn!

No idea what's going on? See here :

The rules are :

[1] Start with any hard/unproved theorem/conjecture as a subject and present the crankiest proof possible.

[2] One can post a crank proof only once and one at a time. Other than that, any other comments/replies are welcome!

[3] Please try to be as much as cranky as possible!!

Let the contest begin!

PS : This thread is partially inspired by this topic on MMF

Last edited: