10 Rollback to Revision 8

# [deletedquestion]Implicationform-cyclesinCollatz-typeproblems.

[deleted][deleted]

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.

The $3n + 1$ problem has a single known positive cycle $(1, 2)$. This cycle has period $2$, and the maximum value this cycle obtains differs from its minimum value by a power of two; that is $2 = 2 \cdot 1$.

The $7n + 1$ problem has a positive cycle $(1, 4, 2)$. This cycle has period $3$, and the maximum value $4 = 2^2 \cdot 1$ is the minimum value multiplied by some power of two.

The $5n + 1$ problem has three positive cycles: $(1, 3, 8, 4, 2)$, $(13, 33, 83, 208, 104, 52, 26)$, and $(17, 43, 108, 54, 27, 68, 34)$. The first cycle has period $5$, and its maximum $8 = 2^3 \cdot 1$. The other two cycles have period $7$, and one of these $7$-cycles has a maximum value $208 = 2^4 \cdot 13$.

Question

Is it known whether the existence of a positive $m$-cycle in such a Collatz-type problem implies the existence of a positive $m$-cycle such that its maximum $M$ and its minimum $\mu$ are related by $M = 2^k \mu$, for some $k \in \mathbb{N}$?

Edit

I used $m$-cycle to denote a cycle of period $m$ when it has already been standardized that $m$-cycle means a cycle with $m$ local minima. Either affirmative answer would serve just as well, however.

Question 2

Does the existence of a nontrivial (positive) cycle in the $3n+1$ problem imply the existence of a nontrivial (positive) cycle with maximum $M$ and minimum $m$ such that $M = 2^k m$, for some $k \in \mathbb{N}$?

Note: If you prefer to work with the odd-only transformation, the condition would be that the maximum element transforms into the minimum element.

9 deleted 923 characters in body; edited tags; edited title; [made Community Wiki]

# Implicationform-cyclesinCollatz-typeproblems.[deletedquestion]

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.

The $3n + 1$ problem has a single known positive cycle $(1, 2)$. This cycle has period $2$, and the maximum value this cycle obtains differs from its minimum value by a power of two; that is $2 = 2 \cdot 1$.

The $7n + 1$ problem has a positive cycle $(1, 4, 2)$. This cycle has period $3$, and the maximum value $4 = 2^2 \cdot 1$ is the minimum value multiplied by some power of two.

The $5n + 1$ problem has three positive cycles: $(1, 3, 8, 4, 2)$, $(13, 33, 83, 208, 104, 52, 26)$, and $(17, 43, 108, 54, 27, 68, 34)$. The first cycle has period $5$, and its maximum $8 = 2^3 \cdot 1$. The other two cycles have period $7$, and one of these $7$-cycles has a maximum value $208 = 2^4 \cdot 13$.

Question

Is it known whether the existence of a positive $m$-cycle in such a Collatz-type problem implies the existence of a positive $m$-cycle such that its maximum $M$ and its minimum $\mu$ are related by $M = 2^k \mu$, for some $k \in \mathbb{N}$?

Edit

I used $m$-cycle to denote a cycle of period $m$ when it has already been standardized that $m$-cycle means a cycle with $m$ local minima. Either affirmative answer would serve just as well, however.

Question 2

Does the existence of a nontrivial (positive) cycle in the $3n+1$ problem imply the existence of a nontrivial (positive) cycle with maximum $M$ and minimum $m$ such that $M = 2^k m$, for some $k \in \mathbb{N}$?

Note: If you prefer to work with the odd-only transformation, the condition would be that the maximum element transforms into the minimum element.

[deleted][deleted]

8 deleted 5 characters in body

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.

The $3n + 1$ problem has a single known positive cycle $(1, 2)$. This cycle has period $2$, and the maximum value this cycle obtains differs from its minimum value by a power of two; that is $2 = 2 \cdot 1$.

The $7n + 1$ problem has a positive cycle $(1, 4, 2)$. This cycle has period $3$, and the maximum value $4 = 2^2 \cdot 1$ is the minimum value multiplied by some power of two.

The $5n + 1$ problem has three positive cycles: $(1, 3, 8, 4, 2)$, $(13, 33, 83, 208, 104, 52, 26)$, and $(17, 43, 108, 54, 27, 68, 34)$. The first cycle has period $5$, and its maximum $8 = 2^3 \cdot 1$. The other two cycles have period $7$, and one of these $7$-cycles has a maximum value $208 = 2^4 \cdot 13$.

Question

Is it known whether the existence of a positive $m$-cycle in such a Collatz-type problem implies the existence of a positive $m$-cycle such that its maximum $M$ and its minimum $\mu$ are related by $M = 2^k \mu$, for some $k \in \mathbb{N}$?

Edit

I used $m$-cycle to denote a cycle of period $m$ when it has already been standardized that $m$-cycle means a cycle with $m$ local minima. Either affirmative answer would serve just as well, however.

Question 2

Does the existence of a nontrivial (positive) cycle in the $3n+1$ problem imply the existence of a nontrivial (positive) cycle with maximum $M$ and minimum $m$ such that $M = 2^k m$, for some $k \in \mathbb{N}$?

Note: If you prefer to work with only the odd-only transformation, the condition would be that the maximum element transforms into the minimum element.

7 added 4 characters in body
6 edited body
5 added 1 characters in body; added 12 characters in body
4 Typo.
3 Aesthetic changes.
2 Corrected typo.
1