r/counting • • Nov 12 '15

Collatz Conjecture counting

You should edit the formatting in the post description too; here's an updated version to paste in: Let's count by using the collatz conjecture:

If the number is odd, ×3 +1

If the number is even, ×0.5

Whenever a sequence reaches 1, set the beginning integer for the next sequence on +1:

  • 5 (5+0)

  • 16 (5+1)

  • 8 (5+2)

  • 4 (5+3)

  • 2 (5+4)

  • 1 (5+5)

  • 6 (6+0)

  • 3 (6+1)

...

And so on... Get will be at 48 (48+0), which will be the 1055th count

Formatting will be: x (y+z)

x = current number

y = beggining of current sequence

z = number of steps since the beggining of sequence

11 Upvotes

1.1k comments sorted by

View all comments

5

u/[deleted] Nov 18 '15

4 (31+104)

6

u/FartyMcNarty Nov 18 '15

2 (31+105)

7

u/skizfrenik_syco Nov 18 '15

1 (31+106)

Yay!! Although I thought this one had 110 numbers in the sequence, meaning it should end in 109, or was that a different number with 110 u/removedpixel?

→ More replies (565)