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$, you have the option of applying either $x \rightarrow 5x+1$ or $x \rightarrow 7x+1$. My conjecture is that you can always reach $1$ from any positive integer starting point. It's very counterintuitive, but i tested the conjecture on integers where $5x+1$ and $7x+1$ are conjectured to diverge on, and yet the conjecture still holds for those integers. Is there heuristic argument that can explain why this happen?
2026-03-28 16:56:54.1774717014
Hybrid between $5x+1$ and $7x+1$ that is probably convergent
110 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
This is a long comment, not an answer
Nice question. It seems it is a bit sharper than the comparable $5x \pm 1$ and $7x \pm 1$ problems (where the $ 5x \pm1$ is easily solvable) , and the statistical formula for the average increase/decrease is a bit more difficult - I would like to see it explicitely.
Here is some short heuristic, using the basic formula $ {m\cdot a_k +1\over 2^{A_k} } \to a_{k+1}$, where $m \in \{5,7\}$ finding this regular pattern when we observe the $ a_1 \pmod 8$
If my quick-check are not completely messed, I get for the statistical average growthrate $q$ in each step $$(5/4)^{1/8}\cdot (5/8)^{1/16}\cdot \ldots \cdot (7/4)^{1/8}\cdot \ldots... \\ \vdots \\ q = (35/64)^{1/4} \approx 0.85994 \\ $$ which means decrease in the long run (except for possible cycles).