Stack Exchange Network

Stack Exchange network consists of 174 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

The Collatz Conjecture, also known as the 3n+1 conjecture, is a famous open problem named after Lothar Collatz.

7
votes
1answer
140 views

For which primes does this iterated function act transitively? (Sort of a finite analogue of Collatz conjecture.)

Background: I was trying to prove something having to do with cyclic group actions on matroids and was able to show that what I want holds if a particular elementary-looking number-theoretic property ...
18
votes
2answers
1k views

Is there a known Turing machine which halts if and only if the Collatz conjecture has a counterexample?

Some of the simplest and most interesting unproved conjectures in mathematics are Goldbach's conjecture, the Riemann hypothesis, and the Collatz conjecture. Goldbach's conjecture asserts that every ...
-1
votes
2answers
300 views

Are there integral solutions for $(2a-1)(2^{(b+c)}-3^c )=2^b-1$?

Can anyone prove this assertion? Or at least suggest a method of attack? It has come up in my research. There do not exist $a,b$ and $c$ such that$$ (2a-1)(2^{(b+c)}-3^c )=2^b-1 $$where $a>0,b&...
8
votes
3answers
211 views

Density of the Klarner-Rado Sequence

Consider the Klarner-Rado sequence OEIS A005658 defined by the rule: the sequence starts with 1, and if it contains $n$ it also contains $2n$, $3n+2$ and $6n+3$. According to R. Guy's popular article,...
4
votes
0answers
156 views

How can I catalog these generalized Collatz problems?

The Collatz conjecture can be expressed in terms of a ruleset in the language $\{x,+,1,\rightarrow,;\}$: $x + x + 1 \rightarrow x+x+x+1+1;$ $x + x \rightarrow x;$ Whenever a number matches ...
6
votes
1answer
570 views

A problem involving the inverse Collatz map

Let $C$ be the Collatz map on the natural numbers, defined by: $$C(n) := \begin{cases} n/2 & \text{if} \;n \;\text{even} \\ (3n+1)/2 & \text{if} \;n \;\text{odd} \end{cases}$$ The inverse ...
3
votes
2answers
276 views

Identification of Invariant Sets for Discrete Dynamical Systems on the Positive Integers

Let $\phi:\mathbb{N}\times \mathbb{N}^+\rightarrow \mathbb{N}^+$ be a dynamical system on the positive integers. Suppose we refer to the orbit of a periodic point of $\phi$ as an invariant set of the ...
11
votes
3answers
784 views

Undecidable easy arithmetical statement

Is there a basic arithmetic statement which is known to be undecidable ? By basic arithmetic statement I do mean an easy statement in the spirit of the Collatz conjecture . By the way is there some ...
0
votes
1answer
203 views

Are there infinitely many solutions of $2^k=3^z-1$ with $k,z \in \mathbb{N}$? [duplicate]

This question arose as an attempt to answer the following question Relaxed Collatz 3x+1 conjecture. I wanted to show that there is a solution of the equation $2^{k}=3^{z}(2n+1)-1$ for each $n\geq 2$, ...
0
votes
1answer
285 views

A Zsigmondy-theorem-analogy in the generalized Collatz-problem $3x+\rho$?

Remark : I've found a rather trivial answer for this question and so very likely the premise of paralleling it with the Zsigmondy-theorem is wrong, so this question might better be retracted. I'll ...
26
votes
2answers
1k views

A Collatz-like problem on prime numbers

Consider the function $f$ on the prime numbers defined by $$ f(p):= \text{ the greatest prime factor of } 2p+1.$$ The iteration of $f$ from any prime $p<10^8$ converges to the cycle $$(3,7,5,11,23,...
22
votes
2answers
649 views

Possible behaviors of integer sequences that arise from powering nonnegative integer matrices

Let's call a sequence of nonnegative integers $x_1,x_2,\ldots$ matrix-realizable, if there exists a $k\times k$ nonnegative integer matrix $A$ (for some $k$), as well as nonnegative integer vectors $u,...
13
votes
3answers
924 views

Collatz-like properties of finite fields

I was wondering what an equivalent of the Collatz conjecture might be for finite fields. In a Collatz sequence a number is moved down within a set $\{2^k n : k \in \mathbb{Z}^* \}$ for some odd $n$ or ...
15
votes
2answers
779 views

Does 53 diverge to infinity in this Collatz-like sequence?

This function has been explored a bit at MSE (in June 2016): \begin{eqnarray} f(n) &=& (n-1)^2 \; \textrm{if} \; (n \bmod 4) = 1\\ f(n) &=& \lfloor n/4 \rfloor \; \textrm{otherwise} \...
11
votes
1answer
1k views

Some Questions on the Collatz conjecture (reexpressed as “equivalence relation”)

The set of all positive whole numbers is denoted by $\mathbb{N}_+$. Let $f\colon\ \mathbb{N}_+\to\mathbb{N}_+:n\mapsto \begin{cases}\frac{n}{2}&\text{$n$ even}\\3n+1&\text{$n$ odd}\end{cases}$...
39
votes
1answer
2k views

Relaxed Collatz 3x+1 conjecture

The Collatz $3x+1$ conjecture claims that any positive integer can eventually be reduced to $1$ by iterative application of the maps $x \mapsto 3x+1$ whenever $x$ is odd and $x \mapsto x/2$ whenever $...
13
votes
1answer
319 views

A Collatz-like question about permutations

An answer to this question would provide an explicit counterexample to this question, but otherwise I don't know if it is interesting. Consider all permutations $\pi$ on the natural numbers such that ...
8
votes
1answer
615 views

Residue class sufficiency sets for the Collatz conjecture

I have recently managed to show a sequence of sufficiency sets for the Collatz conjecture whose natural density approaches 0 (the set theoretic limit approaches the set $\{1\}$). It is an extension of ...
42
votes
1answer
2k views

Transitivity on $\mathbb{N}_0$ — a 42 problem

Let $r(m)$ denote the residue class $r+m\mathbb{Z}$, where $0 \leq r < m$. Given disjoint residue classes $r_1(m_1)$ and $r_2(m_2)$, let the class transposition $\tau_{r_1(m_1),r_2(m_2)}$ be the ...
6
votes
0answers
379 views

Are there always at least *five* divisions?

@JosephO'Rourke asked a question about a Collatz like function related to primes: $f(n) = \begin{cases} n^2 & \text{if} \;n \;\text{is prime} \\ \lfloor n/2 \rfloor & \text{if} \;n \;\text{...
23
votes
3answers
1k views

A Collatz-like function that bifurcates on primes

This is likely piling one mystery on another, but ... I was exploring a function $f(n): \mathbb{N} \mapsto \mathbb{N}$ defined as follows: $$ f(n) = \begin{cases} n^2 & \text{if} \;n \;\text{is ...
-1
votes
1answer
332 views

Collatz property implying infinite “fall below” trajectories, is it known?

(this was discovered analyzing Collatz empirically.) a key aspect of resolving Collatz involves looking at the number of iterations for trajectories to "fall below" the initial value. consider a ...
4
votes
2answers
1k views

3n+1 problem and cycles

Just to make sure I am up to date with this problem. I know (or I think I do) that it is not yet proven that there are no non-trivial cycles for the collatz sequence (please correct me if I am wrong). ...
3
votes
0answers
161 views

Largest permutation groups without “non-mixing” subgroups

We say that a subgroup of ${\rm Sym}(\mathbb{N})$ has sparse orbit representatives if it has infinitely many orbits on $\mathbb{N}$, but the set of smallest orbit representatives has natural density 0 ...
7
votes
1answer
2k views

Beyond Collatz: A $5n+1$ conjecture? [closed]

Let $$x_{n+1} = \begin{cases} x_n/2 &;\text{if } x_n \equiv 0 \pmod{2}\\ k\,x_n+1 &; \text{if } x_n\equiv 1 \pmod{2} \end{cases}$$ and $k=3$ and $x_n\in\Bbb N$. Collatz conjectured for this ...
1
vote
1answer
215 views

Group with 2 orbits on the nonnegative integers — description of the orbits

Definition: Let $r(m)$ denote the residue class $r+m\mathbb{Z}$, where $0 \leq r < m$. Given disjoint residue classes $r_1(m_1)$ and $r_2(m_2)$, let the class transposition $\tau_{r_1(m_1),r_2(m_2)}...
19
votes
3answers
1k views

A curious sequence of rationals: finite or infinite?

Consider the following function repeatedly applied to a rational $r = a/b$ in lowest terms: $f(a/b) = (a b) / (a + b - 1)$. So, $f(2/3) = 6/4 = 3/2$. $f(3/2) = 6/4 = 3/2$. I am wondering if it is ...
9
votes
1answer
892 views

Collatz stopping-time and Poisson distribution, and connection to other problems?

I read many threads about Collatz here - so don't worry, this is no attempt to any proof, just asking about a curious fact: This graph gives the stopping-time of Collatz sequences up to $n=10^8$ (...
-3
votes
1answer
613 views

Point me to an attempt to Proove Collatz Conjecture by Substitution and Factor analysis? [closed]

Summary of Question: Where can I find a discussion of attempting to prove the Collatz Conjecture via substitution and abstract examination? I've done a lot of reading on the problem, including ...
0
votes
1answer
1k views

Implication for cycles (of some length $m$) in Collatz-type problems: typical ratio between largest and smallest element?

Background Consider Collatz-type problems of the form $an + 1$, where $a > 2$ is a positive, odd integer (e.g., $3n + 1$, $5n +1 $, $7n + 1$, etc.). For convenience, automatically divide by two. ...
6
votes
2answers
3k views

Larger cycle than 4, 2, 1 in Collatz iteration?

(Here I discuss the Collatz problem only for positive integers.) It is possible, by computation, to find all cycles in the Collatz iteration of a fixed length. It is clear that an increase must be ...
-1
votes
1answer
556 views

Collatz related question [closed]

Howdy, Not sure this will be entirely clear, but when considering the relationship between a start value n in the Collatz algorithm and the length of the sequence generated by n, is there a function ...