I can't thank you enough, seriously, i was trying to remember how i spelled thought.

ts not a joke, i was really trying to remember.

It's*

You're welcome in advance.

Also you should use Google Chrome or Firefox, they have built in spell checkers.

Oh ok. Any one have full 128 ?

If I really can't remember how to spell something I just text somebody cause my phone has spellchecking.

Lol. My friend uses google; search and it'll correct your spelling.

So yeah, could someone explain this thing to me?

It's explained in the program.
'Start with any number, and the sequence will always end in 1'

Start at any positive integer.
If it's even: divide by 2.
If it's odd : multiply by three and add 1.
Repeat this process over, and eventually you'll end up with 1.
There's no proof of this conjecture, so there's actually about Ѓ5000 up for grabs for anyone who can prove it to be true!

Oh, I see. Well the "divide by two if it's positive" part is pretty obvious, though I don't get how the "if it's odd multiply by three and add 1" works. Surely if you add 1 to anything that's being multiplied by a number repeatedly will end up with one if you do it for long enough.

Lets give an example to help you understand..

1 ) 12 (is even, so /2)
2 ) 6 (is even, so /2)
3 ) 3 (is odd, so *3 and +1)
4 ) 10 (is even, so /2)
5 ) 5 (is odd, so *3 and +1)
6 ) 16 (is even, so /2)
7 ) 8 (is even so /2)
8 ) 4 (is even so /2)
9 ) 2 (is even so /2)
10 ) 1 END SEQUENCE

So we can say that the number 12 took 10 steps to reach 1 using Collatz conjecture.

69 is my least favorite number due to this program.

I demand reparations for my emotional damages.

The 69 easter egg SHALL REMAIN.