### Marina Ibrishimova

Research -Shortly before reaching a power of 2, the algorithm behind the Collatz conjecture reaches an odd integer k so that the last few integers reached are k, 3*k+1 = 2^i, 2^(i-1),..., 1

Let n = 5*k + 2. I conjecture that the last few powers of (n+1)/2 mod n are precisely k, 3*k+1 = 2^i, 2^(i-1),..., 1

Let n = 5*k + 2. I conjecture that the last few powers of (n+1)/2 mod n are precisely k, 3*k+1 = 2^i, 2^(i-1),..., 1

Definition: An exit point in relation to the Collatz conjecture is the last odd integer reached before reaching a power of 2. Example: Let s = 10 then the Collatz exit point is 5 since 10/2 = 5 and 3*5 + 1 = 16, which is a po...

2

I don't a lot , but you must handle this conjecture like you have in the ' quersumme ' of numbers .there you multiply 3 a lot of times .for the ' quersumme' of the result you you always get 9 .conjecture this ! It's informatically ......

Add a comment...