Week 9

Hi all,

So I've decided on a new problem, the Collatz Problem.

This is the one where there is a sequence that starts with a positive non-zero natural number and then does the following

• if its even: divide by 2
• if its odd: multiply by 3, then add 1

The point is to show that this sequence will always returns to 1. This problem is unsolved.

My natural instinct is to first show that in the sequence before 1 there will be a previous sequence that we have seen before and know that it returns to 1. After seeing on Wolfram the sequence written out, it seems that all the sequences end the same way.

  It also seems that it might be useful to see how these operations combine for any one number. And especially for one that is prime.

So heres my first part, I shall prove that when the odd operation is done a even operation immeadiately follows.

let a_n be 2k + 1 for some k in natural numbers. then P(n) is that 3a_n + 1 = 2m for some m in natural numbers.

So direct substitution:

3(2k + 1) +1 = 6k + 3 + 1 = 6k+4 = 2(3k + 2) = 2m

where m = 3k + 2

because a_n is an arbitrary odd number. it is true for all odd numbers.


Thats a start.

Wendy