Questions tagged [collatz-conjecture]

For questions about the iterated map $n \mapsto 3n+1$ if $n$ is odd and $n \mapsto \frac n2 $ if $n$ is even, and its generalizations.

The Collatz conjecture asserts that every positive integer, when iterated over the function:

$$ f(n) = \begin{cases} \frac n2 & \text{if $n$ is even} \\\ 3n+1 & \text{if $n$ is odd} \end{cases} $$

will eventually be transformed to the cycle $1 \to 4 \to 2 \to 1$.

For example, $7 \to 22 \to 11\ \to 34 \to 17 \to 52 \to 26 \to 13 \to 40 \to \dots \to 5 \to 16 \to \dots \to 1$.

The Collatz conjecture has been verified for $n\le 19\cdot 2^{58}$ [Mathworld].

It may be generalized in multiple ways:

  • One way is to increase the domain on which it is defined, for example to the integers or real numbers. In the former case, it is conjectured that it eventually reaches one of $4$ cycles:

    1. $1 \to 4 \to 2 \to 1$,
    2. $-1 \to -2 \to -1$,
    3. $-5 \to -14 \to -7 \to -20 \to -10 \to -5$,
    4. $−17 \to −50 \to −25 \to −74 \to −37 \to −110 \to −55 \to −164 \to −82 \to −41 \to −122 \to −61 \to −182 \to −91 \to −272 \to −136 \to −68 \to −34 → −17, $

    This is sometimes called the generalized Collatz conjecture.

  • Another way is to change the definition to something of the form $$ f(n) = \begin{cases} \frac n2 & \text{if $n$ is even} \\\ an+b & \text{if $n$ is odd} \end{cases} $$ for fixed constants $a$ and $b$.

545 questions
0
votes
1 answer

prove only one positive whole number solution (for every integer $y$)

I have created an equation that might be able to solve half of the Collatz conjecture, but it requires a proof that is beyond me to make, and so I ask you. for all positive integers of $y$ $$x = \frac{\displaystyle \sum_{i=0}^{y-1} \left(3^i…
spydragon
  • 309
0
votes
0 answers

How many Collatz conjecture elimination patterns are there?

The Collatz conjecture is an amazing thing. For people who don't know, the Collatz conjecture is the conjecture where you take any natural number. If that number is even, divide by two. If it is odd, multiply by three and add one. The conjecture is…
Mathemagician314
  • 806
  • 7
  • 21
0
votes
1 answer

3n+1 problem: $f^x(n) < n$ finitely many steps

Consider the shortcut function: $$f(n)=\begin{cases}(3n+1)/2\} & \text{if } (n\bmod 2)\equiv1 \\ \{n/2\} & \text{if } (n\bmod 2)\equiv0 \end{cases}$$ Define $f^x$ as the $x$'th iterate of $f$. There is an initial number $n_0$ (i.e. a constant in the…
user366820
0
votes
2 answers

Solving Collatz Conjecture through analysis of their Binary Representations

Collatz conjecture is generalized by the statement: "For any number greater than zero, if the number is even then divide it by 2. If the number is odd, multiply the number by 3 then add 1." The conjecture states that after following this rule…
0
votes
3 answers

a question about the Collatz conjecture (relation of smallest number in a cycle and minimal cycle-length)

I've only done a bit of research on the current findings, not sure if anyone here can answer this. Q1: I just haven't been able to find, has it been shown yet that a it is impossible for a loop to exist, and for a counter…
0
votes
1 answer

Bitlength probabilities of the shortcut Collatz map

If my calculations are right the probability that the next number in Collatz'sequence has increased its bitlength is equal to $31.25 \%$ Bitlength meaning; the length from a fixed position of least significant bit equal to either $0$ or $1$ to the…
user366820
0
votes
1 answer

How to prove property of Collatz Conjecture trees (3x+1 Problem)

Inevitably for any amateur mathematician, I've been playing with the Collatz Conjecture. I have found it's easier to examine and to generate theorems if we use this equivalent…
Jerry Guern
  • 2,662
0
votes
1 answer

Collatz-esque Conjecture

I was discussing the Collatz Conjecture with someone, who mentioned that if you pick a constant whole number, a, and a second whole number, x, and mapped x to $(ax+a)$ if x was odd and to $x/2$ if it was even, $x$ seemed to always hit $a$ at some…
0
votes
2 answers

Is it possible to find general formulas that can express all collatz numbers??

For collatz hypothesis, is it possible to find general formulas which will give 1 result ?? Is it possible that we can find all collatz numbers with these formulas? Have the generic formulas been used to express the Collatz numbers before? …
user425386
0
votes
1 answer

Collatz Patterns

I have seen documentation on the $4K+1$ pattern, but as of yet I have seen nothing on the $64K+35$ pattern or the $262144K+184471$ pattern. Is there anywhere I can read up on these? I created the general pattern too: $$2^{2×3^{a-1}}K +…
Ben Crossley
  • 2,544
0
votes
1 answer

How many steps to reach 1? (Collatz Conjecture)

Is there some sort of algorithmic process or equation to determine the number of steps required for any given integer n to reach 1 in the Collatz Conjecture without having to actually perform a massive amount of number crunching? I'm talking about…
Greg
  • 561
-1
votes
1 answer

Hybrid between $5x+1$ and $7x+1$ that is probably convergent

Both the $5x+1$ and $7x+1$ variant of the Collatz sequence are conjectured to have large number of divergent trajectory. Here, i combined the two. As always, when you encounter even $x$, you apply $x\rightarrow x/2$, but if you encounter odd $x$,…
-1
votes
2 answers

Why is this wrong?

About the Collatz Conjecture: Every body looks at it from "leaves to root" - to use the tree analogy. I have another approach. My approach is to look at it from the root - the number 1 - and see if, by means of the inverse algorithm functions, I can…
-1
votes
1 answer

Disprove this. Please.

About the Collatz conjecture: Let Steps be: Number of steps, S, that a "counting number", n, takes to reach 1 - sometimes referred as the stopping time (of n); Example: 5 take 5 steps to reach 1 (note: the only number with S = n) Steps(5) =…
-2
votes
2 answers

Is this a valid proof of the Collatz theorem?

Is this a valid proof of the Collatz Conjecture? For all even numbers x >= 20, if all numbers 1 through x are in Collatz set, show x+1 and x+2 are in set. Then by induction, all positive integers are in set. For all even numbers x >= 20, if all…
ees
  • 113