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

2
votes
1answer
43 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. ...
0
votes
0answers
46 views

Alternate proofs for Collatz 1-Cycles

To follow up on my comment here, I present my proofs of the Collatz 1-Cycles. I have asked to make this cw so others can edit as they wish. Here we show that the differences are equal to $t-1:$ ...
1
vote
1answer
86 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
54 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$$
0
votes
0answers
59 views

”Mehrstellenverfahren” of Collatz

I can do Taylor expansion on the Left hand side but I would like to know how to do Taylor expansion on the right side. Can anyone help me with finding the Taylor expansion for the double deivatives ...
1
vote
2answers
64 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
28 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
1answer
123 views

Outline approach to Collatz 3n+1 conjecture / Criticism needed [on hold]

// Instead of trying to show there are no loops and no sequences that increase without bounds, consider how any "deviant set of sequences" must partition the natural numbers into two infinitely large ...
3
votes
0answers
69 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
59 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
147 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
110 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
94 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
94 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
68 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
65 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
97 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
30 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
37 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 & ...
0
votes
2answers
132 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
82 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
90 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
260 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
89 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
92 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
124 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 ...
5
votes
1answer
126 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
137 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
132 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 ...
3
votes
2answers
194 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 ...
6
votes
2answers
811 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 ...
23
votes
4answers
909 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 ...
5
votes
3answers
252 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 ...
6
votes
1answer
153 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
81 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
106 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
0answers
217 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 ...
5
votes
2answers
407 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
282 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
640 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 ...
1
vote
3answers
534 views

$5n+1$, $3n-1$ problem, smallest repeating cycle and Collatz conjecture

Among the Collatz conjecture we have other "similar" problems that are solved and have repeating cycles. $5n+1$ has the repeating cycle $13, 66, 33, 166, 83, 416, 208, 104, 52, 26$, with a length of ...
1
vote
2answers
243 views

$N \equiv 3 (\textrm{mod } 4)$ and Collatz conjecture

Can the Collatz conjecture also be interpreted as behaviour, transformation of number of form $N\equiv 3(\textrm{mod }4)$ to the form of $N\equiv 1(\textrm{mod }4)$ Because integers of the form ...
4
votes
2answers
117 views

How many ways to reach $1$ from $n$ by doing $/13$ or $-7$?

How many ways to reach $1$ from $n$ by doing $/13$ or $-7$ ? (i.e., where $n$ is the starting value (positive integer) and $/13$ means division by $13$ and $-7$ means subtracting 7)? Let the number ...
1
vote
1answer
420 views

What is known about Collatz like 3n + k?

I wonder what is known about variations of Collatz where $3n+1$ is replaced by $3n + 2k + 1$ where k is a fixed positive integer. In the OP ' about Collatz $3n+3$ ' it was confirmed that $3n+3$ ...
1
vote
2answers
488 views

About Collatz 3n+3?

While trying to prove the Collatz conjecture I came across the following Lemma : Lemma $1$ : All variables are positive integers. Define $Collatz(n)$ as the result of the (repeated) collatz ...
-1
votes
2answers
698 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 ...
6
votes
2answers
507 views

The nonexistence of the Collatz-“1-cycle” by an elementary proof - am I missing something?

The so-called "1-cycle" in the Collatz-problem was already disproved by Ray Steiner 1977. However, he used transcendental number theory to achieve that, and Lagarias commented, it is surprising that ...
3
votes
2answers
319 views

Prerequisite reading before studying the Collatz $3x+1$ Problem

Let's assume I am starting college and have just finished calculus. I've been reading a bit online about the Collatz $3x+1$ Problem and find it to be very intriguing. However, a lot of what I'm ...
2
votes
3answers
297 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 ...
8
votes
1answer
558 views

What are possibilities to disprove the Collatz Conjecture?

I was thinking about the Collatz Conjecture yesterday, and as opposed to trying to prove it, I was considering what would make the conjecture false. There were only two cases I could think of: We ...