**24**

votes

**0**answers

555 views

### Relaxed Collatz 3x+1 conjecture

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

**11**

votes

**1**answer

199 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 ...

**7**

votes

**0**answers

272 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

**1**answer

1k 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 ...

**4**

votes

**0**answers

281 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 ...

**14**

votes

**1**answer

565 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 ...

**0**

votes

**1**answer

251 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 ...

**4**

votes

**2**answers

729 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

**0**answers

147 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

**1**answer

1k 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

**1**answer

192 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 ...

**19**

votes

**3**answers

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 ...

**-2**

votes

**1**answer

455 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

**1**answer

815 views

### Implication for m-cycles in Collatz-type problems.

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.
...

**5**

votes

**2**answers

2k 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 ...

**0**

votes

**1**answer

455 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 ...