5
votes
2answers
115 views

How was the $3x+1$ problem checked up to $5 \times 2^{60}$?

The Wikipedia article for the Collatz conjecture states that: The conjecture has been checked by computer for all starting values up to $5 \times 2^{60} \approx 5.764 \times 10^{18}$. It gives ...
1
vote
1answer
110 views

Collatz conjecture and related problems - mathematical machinery

Collatz conjecture stands as an open problem. That leads me to believe that the conjecture cannot be resolved by elementary means. Which brings me to my question: What techniques/machinery from ...
5
votes
2answers
209 views

Is Collatz' conjecture the only stable solution of its type?

The Collatz Conjecture is well known with the sequence $$f(n) = \begin{cases} n/2 &;\text{if } n \equiv 0 \pmod{2}\\ k\,n+1 &; \text{if } n\equiv 1 \pmod{2} \end{cases}$$ and $k=3$; the ...
5
votes
3answers
75 views

How can I prove that an iterated transformation describes all odd integers?

This is a question where I want to find "a best" way (or even different ways) to prove my assumption - just to widen my understanding of similar problems and how to approach them. It's a question of ...
5
votes
0answers
200 views

Collatz-like : $(5 x \pm 1)/3$ [closed]

For a motivating start, recall the definition of the usual Collatz iteration on the integers (binding exactly one halving with each tripling), rewritten in a (slightly) unusual way. The Collatz ...
-1
votes
2answers
645 views

What to do with Collatz proof? [closed]

I have discovered a proof solving the Collatz problem, and I have no idea what to do with it. Given the nature of the topic, all the experts I've found that are capable of reviewing the paper ...
2
votes
3answers
288 views

Is this statement stronger than the Collatz conjecture?

$n$,$k$, $m$, $u$ $\in$ $\Bbb N$; Let's see the following sequence: $x_0=n$; $x_m=3x_{m-1}+1$. I am afraid I am a complete noob, but I cannot (dis)prove that the following implies the ...