display | more...
(if the name is misspelt, /msg me and i'll change it)..

Apparently an 'unprovable' theorem that the following operations will always produce 0. Start with any natural number - say 7 - and make it into a binary sequence:

7 = 4 + 2 + 1 = 22 + 21 + 1 (20)

Then apply the two operations:

  • a := Increase powers by one.
  • b := Decrease sequence by one.
This makes the sequence:

22 + 21 + 1 -(a)-> 23 + 22 + 21 = 13

Then (b) is applied to make 12. This process is continued, (a) then (b), until the number becomes 0.

7, 12,

hmmm..something's gone wrong

Log in or register to write something here or to contact authors.