Dynamics of the iterated map $n \to 3n+1$ if $n$ is odd and $n \to \frac n2 $ if $n$ is even. Generalizations to $n \to 3n-1 $ or $ n \to 5n+1$ or even to $n \to pn+q$ . Other names are "$3x+1$-problem","syracuse problem". If you have a question, please be specific to your detail. MSE is not ...

learn more… | top users | synonyms

-4
votes
2answers
124 views

Looking for a verification or refutation my attempted proof of why the Collatz conjecture is probably false. [closed]

Most people think that the Collatz conjecture is true, but I think that I can prove the opposite. Let's make two functions, $f(x)$ and $g(x)$. $f(x) = $ The amount of numbers that can be solved in x ...
4
votes
3answers
632 views

Has the Collatz Conjecture been proven to be unprovable? [closed]

This paper, from a peer-reviewed journal, purports to prove that the Collatz Conjecture is unprovable. If it’s valid, why has it not received more attention? If it’s invalid, what is the flaw, and ...
1
vote
1answer
78 views

What causes long sequences of consecutive 'collatz' paths to share the same length?

I asked Longest known sequence of identical consecutive Collatz sequence lengths? some time ago, but I don't feel like it really got to the bottom of things. See, in the answers lopsy find a sequence ...
0
votes
0answers
65 views

Collatz algorithm generalization try-out (Collatz k-algorithm)

Recently I have been reading about the Collatz conjecture here in Mathematics Stack Exchange, and also found the fantastic paper of professor Lagarias about it. Everything was so interesting (and I ...
7
votes
2answers
299 views

Trying mathematical induction with $3n+1$ conjecture

Collatz's Conjecture is also known as the $3n+1$ conjecture. Well I thought since the conjecture is dealing with natural numbers so we might as well try mathematical induction and see why it doesn't ...
0
votes
1answer
74 views

A question about the $3n+1$ conjecture

So I know that if you take any even number $n$ that is a power of $2$ like $32 = 2^5,16=2^4$ or $64=2^6$ we will keep dividing by 2 until we reach 1. and so all the steps will be $\frac{n}{2}$ and we ...
4
votes
2answers
79 views

A general question about the Collatz Conjecture and finding that integer that doesn't work

I apologize if this question gets down-voted ahead of time. I've been working on the Collatz Conjecture all day with Python, because that is the language I'm most familiar with (I'm not a CS student, ...
1
vote
0answers
88 views

Consequences of Collatz Conjecture being true

Collatz conjecture has been conjectured for a long time and I think there are some evidence showing that it should be true. Similar to $P \neq NP$ conjecture, is there some interesting ...
4
votes
2answers
228 views

Is anything known about the size of the smallest number with stopping time $n$

Last couple of days I've been thinking about the Collatz conjecture, and now I wonder if any relation is known between $n$ and the smallest number with stopping time $n$. So for example, let's say ...
0
votes
4answers
68 views

In the Collatz function, why does $2^k-1$ reach $3^k-1$ after $2k$ steps, and could it be used to find divergent trajectories?

If you start calculating the Collatz function from an integer of the form $2^k-1$, you will reach $3^k-1$ after $2k$ steps. So, it is possible to pick a starting value that continuously zig-zags ...
1
vote
2answers
38 views

In the Collatz function, why $3^{2k}-1$ and $3^{2k-1}-1$ always share the same trailing trajectory?

Why are the trajectories always the same for numbers of the form $3^{2k}-1$ and $3^{2k-1}-1$ for the Collatz function? For example, let $k = 3$. So, $3^6-1 = 728$ and $3^5-1 = 242$. The trajectories ...
3
votes
1answer
137 views

How could Collatz conjecture possibly be undecidable?

I wonder how the collatz conjecture could possibly be undecidable? Since let's say it's undecidable, then that means that no counter example can ever be found, and that to me seems to imply that non ...
2
votes
3answers
259 views

Collatz conjecture: Largest number in sequence with starting number n

This question is inspired by a CS course, and it only tangentially relates to the actual content of the exercise. Say in a hailstone sequence (Collatz conjecture) you start with a number n. For any ...
5
votes
2answers
217 views

Is this property of the Collatz sequence interesting?

As an amateur playing around with the Collatz conjecture, I've stumbled on something I haven't seen mentioned before, and that may or may not be noteworthy. Suggested by Gottfried Helms, here's a ...
2
votes
1answer
93 views

On a proof that “there are at least $F_n$ Collatz permutations of length $n$”.

Let $n, k \in \Bbb{N}$ and $F_n$ be the $n$th term of the Fibonacci sequence. Let $u$ be the map $x \to 3x+1$ and $d$ be the map $x \to \frac{x}{2}$. Let a type be a sequence of $u$'s and $d$'s. ...
1
vote
1answer
98 views

What do these contour maps tell me about my Collatz expression?

I tested this limit on WolframAlpha, $$ \lim_{t\to\infty}\frac {2\ 3^r (2 t - 1) - 6} {3\ 2^r (2 t - 1) - 6}=\left(\frac{3}{2}\right)^{r-1},$$ which displayed two contour maps: . Can ...
4
votes
1answer
58 views

How to find the integer solutions of $\frac{2^m-1}{2^{m+x}-3^x}=2a+1$? [duplicate]

Is there a way to find all integer triplets of $(x, m, a)$ for the following equation. $$\frac{2^m-1}{2^{m+x}-3^x}=2a+1$$
1
vote
2answers
101 views

Number of possible cycles in collatz conjecture

I had been following all the blogs, but I would like to understand, whether an attempt has been made to understand how many cycles are possible apart from the 1-4-2-1 cycle in collatz problem
0
votes
1answer
37 views

Collatz sequences meet at a point

I was solving the problem,in which we are given two starting values of collatz sequence and our task is to say after how many steps their sequences “meet” for the first time. For ex - a= 7 , b= 8 a ...
4
votes
0answers
95 views

Is this a valid statement that would imply the Collatz Conjecture?

Let $f$ denote the Collatz transformation: $f(x) = \left\{ \begin{array}{ll} {x\over 2} & \quad x\equiv 0 \mod 2 \\ 3x+1 & \quad x \equiv 1\mod 2 ...
1
vote
1answer
73 views

Simon Letherman, Dierk Schleicher, and Reg Wood 1999 paper on the 3n+1 problem, further results

I recently read with great interest the 1999 paper : "The 3n+1-Problem and Holomorphic Dynamics Simon Letherman, Dierk Schleicher, and Reg Wood" Experimental Mathematics 8: 3 (1999), 241–252. I ...
6
votes
2answers
161 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 ...
3
votes
2answers
127 views

arithmetic sequence $8n+1$ and the collatz conjecture

Is it a known result that if for all $n$ the collatz sequence of $8n+1$ lead to $1$, all natural numbers will?
0
votes
1answer
124 views

It's sufficient to prove collatz conjecture for $3+6k, k \geq 0$?

Thinking about this problem, I saw two interesting properties of Collatz graph. Firstly, if we consider that every even number $e$ can be represented (on a single way) as $e = o 2^n$, where $o$ is an ...
1
vote
3answers
108 views

For how many consecutive numbers Collatz conjecture was checked?

I heard here that Collatz conjecture was checked at least for every first $5 \cdot 10^{18}$ natural numbers, but I cannot find any source or actual information about this. Can anyone help to find out ...
3
votes
3answers
81 views

Examples of “eventually reaches y under iteration” other than the Collatz problem

The Collatz conjecture states that iteratively applying the map $$f(n) = \begin{cases} n/2 &\text{if } n \equiv 0 \pmod{2}\\ 3n+1 & \text{if } n\equiv 1 \pmod{2} .\end{cases}$$ to any ...
0
votes
1answer
72 views

Repeating cycles in the $3n-1$ problem

While tracking sequences beginning with 1-to-3 digit integers, I have found 3 different repeating cycles in the $3n-1$ problem (similar to the Collatz Conjecture). They are 1, 2, 1..., 5, 14, 7, 20, ...
3
votes
1answer
131 views

Collatz cycle necessary condition.

Has it been established that a nontrivial m-cycle of the Collatz conjecture on the positive integers would require two consecutive raises (i.e., if $\{x_1, x_2, \ldots x_n\}$ is the odd positive ...
0
votes
1answer
33 views

Given a natural number $a$ find its index in a set of structural descriptions

Looking at orbits of the collatz-like $(5x+1)/2^X$ - map I come to a useful structural description for all odd integers $a$. If I write $$ {5a+1 \over 2^A} \to b \qquad \qquad \text{for odd positive } ...
1
vote
1answer
48 views

Modified Collatz Problem

How can one prove for all $n \in \mathbb N$ that the following sequence always results in $1$: Choose $m$ $x_1 = m$ $$x_{n+1} = \begin{cases} x_n/2 & \text{if $x_n$ is even} \\ \\ x_n + 1 & ...
2
votes
2answers
216 views

Are there any explanations for these patterns in the Collatz sequences?

I've been messing around with the Collatz sequences a bit, and have come across a few patterns - I was wondering if there are any known explanations for these patterns. The first is the plot of ...
2
votes
2answers
145 views

My problem in understanding the minimal counterexample technique

If minimal counterexample method of proof is to assume to opposite of an argument is true and then finding a counterexample for the opposite and then concluding the validity of the original argument, ...
1
vote
1answer
116 views

Proof of Terras' method for finding T(k)(x) of Collatz sequence.

Terras (via Lagarias) has a method explained here (2.2) for finding the kth term of any Collatz sequence (that is) $$T(n) = \frac{3n+1}{2}$$ if n is odd and $$=\frac n2$$ if n is even. The lambda ...
4
votes
1answer
276 views

Divisibility of $2^n - 1$ by $2^{m+n} - 3^m$.

For what values of $m,n$ natural, do $2^n - 1$ is divisible by $2^{m+n} - 3^m$? Thank you very much.
2
votes
1answer
104 views

Diophantine equation $3^{m}x+3^{m}-3^{m-i} 2^{i} +3^{m-i} 2^{i+s} -2^{m+s}=x 2^{m+s}$

As part of my research and my calculations I got the following diophantine equation. I do not have much experience with the diophantine equation. Is there any known method to solve it? Any help is ...
0
votes
1answer
93 views

a Problem about Sequence [duplicate]

Let $a_1$ be an integer. Then we assume $$ a_{n+1} = \begin{cases} 3a_n+1,&\text{$a_n$ is odd}\\ \frac{a_n}{2},&\text{$a_n$ is even} \end{cases} $$ Now we prove that for any ...
2
votes
2answers
134 views

Where can I find out more on Collatz-conjecture like sequences?

I'm interested in Collatz-conjecture (the 3n+1 problem) like sequences. I'm interested in any literature that contains information about problems that are divided into similar cases. I'm ...
7
votes
1answer
163 views

What is the simplest collatz like problem that is undecidable?

I have read that problems resemblings collatz have been shown to be undecidable. Conway proved that apparantly but Im not sure if the proof was constructive. So I wonder : What is the simplest ...
1
vote
1answer
175 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 ...
0
votes
1answer
165 views

collatz conjecture $\mod 2^n$ stopping distance

an interesting book Old and new unsolved problems in plane geometry and number theory by Klee/Wagon (1991) includes the Collatz conjecture. on p225 they consider iterates $\mod 2^n$ and state that ...
4
votes
2answers
272 views

About the Collatz conjecture

I worked on the Collatz conjecture extensively for fun and practise about a year ago (I'm a CS student, not mathematician). Today, I was browsing the Project Euler webpage, which has a question ...
10
votes
3answers
1k views

Longest known sequence of identical consecutive Collatz sequence lengths?

I've just written a simple java program to print out the length of a Collatz sequence, and found something I find remarkable: Consecutive sequences of identical Collatz sequence lengths. Here is some ...
25
votes
4answers
1k views

Why is $3$ the coefficient of $n$ in the Collatz conjecture?

What's the importance of multiplying a odd number by $3$ and adding $1$, instead of just adding $1$? After all, if you add $1$ to an odd number then it turns into an even number. Here is a example ...
6
votes
5answers
339 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 ...
7
votes
1answer
224 views

Prime numbers in Collatz sequences

This question/request is twofold. First, if this is a stupid question or if it has been addressed before, please say so (bluntness is optional), and I will crawl back into my cave... My question: is ...
5
votes
3answers
87 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 ...
1
vote
0answers
115 views

Is this first order version of the Collatz conjecture decidable in peano arithmetic?

Let $\phi(x)$ be a first order formula in the language of arithmetic with one free variable $x$. Consider the sentence $\psi_\phi$, defined as: $$\phi(0)\wedge \phi(1) \wedge (\forall x \phi(x) \to ...
5
votes
2answers
500 views

What are some reasonable things to prove about the Collatz Conjecture?

I am writing an undergraduate paper on the $3n+1$ problem, and I am looking for some theorems related to the problem that would be reasonable for someone with my mathematical background to prove. I'm ...
1
vote
1answer
319 views

Converse of Collatz Conjecture

How to write a pseudocode program that halts only if the Collatz Conjecture is false. Thanks much in advance!!!
1
vote
3answers
745 views

Ways of disproving proofs of the Collatz Conjecture?

I jokingly suggested for someone to prove the Collatz Conjecture, and they came up with their own proof. I have no idea how to disprove proofs, so can anyone tell me either what is wrong with this ...