×

# The most difficult - yet so easy to understand - problem in the world!

Take any natural number $$n$$. If $$n$$ is even, divide it by $$2$$ to get $$n / 2$$. If $$n$$ is odd, multiply it by $$3$$ and add $$1$$ to obtain $$3n + 1$$. Repeat the process indefinitely. The problem is to prove that no matter what number you start with, you will always eventually reach $$1$$.

Don't be fooled by the simplicity of this problem, great mathematicians like Erdős had great trouble proving it. The latter even said: "Mathematics may not be ready for such problems."

Note by حكيم الفيلسوف الضائع
2 years, 5 months ago

Sort by:

When do you predict that the Collatz conjecture will be solved? @Sharky Kesa @Daniel Liu @Daniel Chiu @Trevor B. · 2 years, 5 months ago

Possibly in the next decade given the number of young mathematicians rising up and are being seen on Brilliant. · 2 years, 5 months ago

I also thought this ....one day....Thanks for posting it · 2 years, 5 months ago

The Collatz Conjecture? or The Ulam's Conjecture? · 2 years, 5 months ago

It's commonly named after Collatz name but it is also named Ulam's conjecture because he used to talk about it in the lectures he gave. · 2 years, 5 months ago

I did not understand what were you saying about odd numbers. Even one is true but can you explain me the odd process ? · 2 years, 5 months ago

Start with any natural number. If the number is even, divide it by two. If it is odd, triple it and add one. Repeat the process with the new number so formed. Ultimately the number 1 is reached. · 2 years, 5 months ago

Even one is true. But what about odd ? Let the no. be 5. if we triple it and add one, we will get 16 and then 49 then 148 ......... Which I don't think would approach 1. Or am I not getting the process. Can u explain the process with examples. · 2 years, 5 months ago

When you got 16, you'll have to use the operation we restricted to even numbers, that is: $$n/2$$. And so you will get 8. Repeat it again you'll have 4, then 2, then 1! · 2 years, 5 months ago

OK. Now I got it very well. Thanks · 2 years, 5 months ago

You're welcome! · 2 years, 5 months ago

You have done the operation wrong. Lets call the operation C(x) where x is your starting number.

$$C(5) = 16, C(16) = 8, C(8) = 4, C(4) = 2, C(2) = 1$$. And thus the operation ends. · 2 years, 5 months ago

couldn't we just consider it true until proven wrong? =) · 2 years, 4 months ago

That wouldn't be helpful in any way. · 2 years, 4 months ago

Yep, just taking the lazy way out. · 2 years, 4 months ago

Le problème de Syracuse ;) · 2 years, 5 months ago

Wouldn't it be correct if I say it will also reach every time reach 2 . · 2 years, 5 months ago

No. If you start on 2 itself, then you will have to carry out the operation n/2 anyway. You have to COMPLETE the sequence and hence end with 1. · 2 years, 4 months ago