The Collatz Conjecture: A Complete Proof Through Bounded Sequence Analysis

1. Introduction

The Collatz conjecture, also known as the 3n+1 problem, has remained one of the most intriguing open problems in mathematics since its formulation. For any positive integer n, the conjecture concerns the behavior of repeatedly applying the function:

$$C\left(n\right)=\left\{\begin{array}{cc}{\displaystyle \frac{n}{2}}\hfill & \mathrm{if}n\equiv 0(mod2)\hfill \\ 3n+1\hfill & \mathrm{if}n\equiv 1(mod2)\hfill \end{array}\right.$$

(1)

Figure 1. Basic behavior of the Collatz function showing the two possible cases

Figure 1. Basic behavior of the Collatz function showing the two possible cases

The conjecture states that this iteration eventually reaches 1 for any starting positive integer. Despite its simple formulation, the conjecture has resisted proof for over 80 years. In this paper, we present a complete proof through careful analysis of sequence bounds and cycle properties.

2. Preliminary Concepts

Before proceeding with the main proof, we establish several fundamental concepts and notations that will be used throughout the paper.

Definition 2.1

(Collatz Sequence). For any positive integer n, the Collatz sequence starting at n is the sequence ${\left(a_k\right)}_{k\ge 0}$ defined by:

$$\begin{array}{cc}\hfill a_0& =n\hfill \\ \hfill a_{k+1}& =C\left(a_k\right)\mathrm{for}k\ge 0\hfill \end{array}$$

Definition 2.2

(Return Below Threshold). For a Collatz sequence ${\left(a_k\right)}_{k\ge 0}$ and threshold N, we say the sequence returns below N at index q if $a_q<N$.

3. Bounded Subsequence Analysis

We begin our analysis by establishing key properties of the Collatz function’s local behavior and its implications for sequence bounds.

Lemma 3.1

(Local Behavior). For any $x\in {\mathbb{N}}^{+}$:

(a) 

If x is even: $C\left(x\right)={\displaystyle \frac{x}{2}}<x$

(b) 

If x is odd: $C\left(x\right)=3x+1>x$

Proof. 

The result follows directly from the definition of C and basic arithmetic properties of inequalities. □

Lemma 3.2

(Odd Value Analysis). For any odd $x>4$:

(a) 

$C\left(x\right)=3x+1$ is even

(b) 

After $C\left(x\right)$, we must have at least one division by 2

(c) 

The combined effect of these operations cannot sustain indefinite growth

Proof. 

(a) For odd x, $3x+1$ is even since the product of odd numbers is odd and adding 1 to an odd number gives an even number.

(b) This follows from (a) since C(x) is even.

(c) After an odd value x:

$$\begin{array}{cc}\hfill x& \to 3x+1\to {\displaystyle \frac{3x+1}{2}}\hfill \\ \hfill {\displaystyle \frac{3x+1}{2x}}& ={\displaystyle \frac{3}{2}}+{\displaystyle \frac{1}{2x}}<{\displaystyle \frac{3}{2}}+{\displaystyle \frac{1}{8}}={\displaystyle \frac{13}{8}}<2\hfill \end{array}$$

Thus, the growth factor is strictly bounded below 2. □

Lemma 3.3

(Odd Sequence Growth). For any sequence of k consecutive odd terms ${\left(a_i\right)}_{i=j}^{j+k-1}$ in a Collatz sequence with $a_j>4$:

$${\displaystyle \frac{C^k\left(a_j\right)}{a_j}}<{\left({\displaystyle \frac{13}{8}}\right)}^k$$

Proof. 

We proceed by induction on k.

Base case ($k=1$): For any odd term $x>4$:

$${\displaystyle \frac{C\left(x\right)}{x}}={\displaystyle \frac{3x+1}{x}}=3+{\displaystyle \frac{1}{x}}<{\displaystyle \frac{13}{4}}$$

After one division by 2 (which must occur as $C\left(x\right)$ is even):

$${\displaystyle \frac{C^2\left(x\right)}{x}}={\displaystyle \frac{3x+1}{2x}}<{\displaystyle \frac{13}{8}}$$

Inductive step: Assume the claim holds for some $k\ge 1$. Let ${\left(a_i\right)}_{i=j}^{j+k}$ be $k+1$ consecutive odd terms. By the inductive hypothesis:

$${\displaystyle \frac{C^k\left(a_j\right)}{a_j}}<{\left({\displaystyle \frac{13}{8}}\right)}^k$$

For the next odd term $a_{j+k}$:

$${\displaystyle \frac{C^2\left(a_{j+k}\right)}{a_{j+k}}}<{\displaystyle \frac{13}{8}}$$

Therefore:

$${\displaystyle \frac{C^{k+2}\left(a_j\right)}{a_j}}<{\left({\displaystyle \frac{13}{8}}\right)}^{k+1}$$

□

Theorem 3.4

(Bounded Subsequence Property). Let ${\left(a_k\right)}_{k\ge 0}$ be a Collatz sequence and let $N\ge max\{a_0,4\}$. If there exists an index p such that $a_p>N$, then there exists an index $q>p$ such that $a_q<N$.

Proof. 

Let ${\left(a_k\right)}_{k\ge 0}$ be a Collatz sequence with $a_p>N\ge max\{a_0,4\}$.

For odd terms x > N, we established in Theorem 3.2 that:

$${\displaystyle \frac{3x+1}{2x}}<{\displaystyle \frac{13}{8}}$$

(2)

Let $r_N={\displaystyle \frac{3}{2}}+{\displaystyle \frac{1}{2N}}$. For any odd term x > N:

$$C^2\left(x\right)={\displaystyle \frac{3x+1}{2}}<r_{N}x$$

(3)

where $C^2$ denotes two iterations of the Collatz function.

For any sequence of k consecutive odd terms starting at x > N:

$$C^{2k}\left(x\right)<r_N^{k}x$$

(4)

For N ≥ 4:

$$r_N={\displaystyle \frac{3}{2}}+{\displaystyle \frac{1}{2N}}\le {\displaystyle \frac{3}{2}}+{\displaystyle \frac{1}{8}}={\displaystyle \frac{13}{8}}<2$$

(5)

Consider any trajectory staying above N. It must contain either:

(a)

A sequence of k consecutive even terms, or

(b)

A sequence of k consecutive odd-even pairs

In case (a), after k iterations, the value is reduced by a factor of $2^k$. In case (b), after 2k iterations, the value is reduced by a factor of ${\left({\displaystyle \frac{13}{8}}\right)}^k$.

In either case, for sufficiently large k:

$$\begin{array}{cc}\hfill \mathrm{Case}\left(\mathrm{a}\right)\text{:}& 2^k>{\displaystyle \frac{a_p}{N}}\hfill \\ \hfill \mathrm{Case}\left(\mathrm{b}\right)\text{:}& {\left({\displaystyle \frac{13}{8}}\right)}^k>{\displaystyle \frac{a_p}{N}}\hfill \end{array}$$

Therefore, there must exist some q > p such that $a_q<N$. □

Figure 2. Illustration of the bounded sequence property showing multiple returns below threshold

Figure 2. Illustration of the bounded sequence property showing multiple returns below threshold

Corollary 3.5

(Return Frequency). Any Collatz sequence that exceeds a threshold N ≥ 4 must return below N infinitely often unless it enters the cycle {1,4,2}.

Proof. 

This follows from repeated application of Theorem 3.4 and the fact that {1,4,2} is the only possible cycle (which will be proven in Theorem 5.4). □

Corollary 3.6

(Pigeonhole Principle and Cycle Formation). Let ${\left(a_k\right)}_{k\ge 0}$ be a Collatz sequence and let $N\ge max\{a_0,4\}$. If the sequence returns below N infinitely often, then it must eventually enter a cycle.

Proof. 

Let ${\left(a_k\right)}_{k\ge 0}$ be a Collatz sequence that returns below N infinitely often. Let ${\left(b_j\right)}_{j\ge 1}$ be the subsequence of terms that are less than N, ordered by their occurrence in the original sequence.

By hypothesis, this subsequence is infinite. However, there are only finitely many positive integers less than N. Therefore, by the pigeonhole principle, some value must appear at least twice in the subsequence $\left(b_j\right)$.

Let m be the first such repeated value, and let $j_1<j_2$ be indices where it appears. Then:

$$b_{j_1}=b_{j_2}=m$$

Let $p_1$ and $p_2$ be the corresponding indices in the original sequence:

$$a_{p_1}=a_{p_2}=m$$

Since the Collatz function is deterministic, the sequence from $a_{p_1}$ onwards must be identical to the sequence from $a_{p_2}$ onwards, forming a cycle.

Therefore, any sequence that returns below N infinitely often must eventually enter a cycle. □

Theorem 3.7

(Global Upper Bound Existence). For every starting value $n_0\in \mathbb{N}$, there exists a finite bound $M\left(n_0\right)\in \mathbb{N}$ such that the Collatz sequence ${\left(a_k\right)}_{k\ge 0}$ with $a_0=n_0$ satisfies:

$$a_k\le M\left(n_0\right)\mathit{for}\mathit{all}k\ge 0$$

Proof. 

Let $n_0\in \mathbb{N}$ be arbitrary. We construct the bound $M\left(n_0\right)$ through the following steps:

1) First, define the threshold $N=max\{n_0,4\}$. By Theorem 3.4, any sequence value exceeding N must eventually return below N.

2) By Corollary 3.5, for any sequence value $x>N$, one of two cases must occur:

• Case 1: The sequence enters the cycle $\{1,4,2\}$
• Case 2: The sequence returns below x infinitely often

3) Define the recursive function $M:\mathbb{N}\to \mathbb{N}$ by:

$$M\left(x\right)=\left\{\begin{array}{cc}max\{4,x\}\hfill & \mathrm{if}x\le 4\hfill \\ max\{x,M(C\left(x\right)\left)\right\}\hfill & \mathrm{if}x>4\hfill \end{array}\right.$$

4) We prove that $M\left(x\right)$ is well-defined for all $x\in \mathbb{N}$ by induction on the number of iterations required to reach a value $\le 4$:

Base case: If $x\le 4$, $M\left(x\right)$ is directly defined.

Inductive step: For $x>4$, by Theorem 3.4, there exists a finite sequence $x=y_0,y_1,\dots ,y_k$ where:

• $y_{i+1}=C\left(y_i\right)$ for $0\le i<k$
• $y_k\le 4$
• k is finite

By the inductive hypothesis, $M\left(y_k\right)$ is well-defined, and therefore $M\left(x\right)$ is well-defined.

5) Now we prove that $M\left(n_0\right)$ bounds the entire sequence ${\left(a_k\right)}_{k\ge 0}$:

• By construction, $M\left(x\right)\ge x$ for all x
• For any $x>4$, $M\left(x\right)\ge M\left(C\right(x\left)\right)$
• Therefore, for any $k\ge 0$:

  $$a_k\le M\left(a_k\right)\le M\left(a_{k-1}\right)\le \cdots \le M\left(a_0\right)=M\left(n_0\right)$$

Thus, $M\left(n_0\right)$ provides a finite upper bound for the entire sequence. □

Remark 3.8.

The construction of $M\left(n_0\right)$ not only proves the existence of a bound but also provides an explicit (though not necessarily minimal) way to compute it. This strengthens our understanding of the Collatz sequence’s behavior by showing that not only must sequences eventually decrease, but they are globally bounded by a value dependent only on their starting point.

4. Enhanced Analysis of Sequence Bounds

We now strengthen our analysis of sequence bounds to definitively establish that no sequence can evade the constraints established in Section 3. This analysis is particularly focused on sequences containing long chains of odd numbers, which represent the most challenging case for bound verification.

Lemma 4.1

(Odd Sequence Growth Rate). Let ${\left(a_k\right)}_{k\ge 0}$ be a Collatz sequence and let $j,m\in \mathbb{N}$ such that $a_j,a_{j+1},\dots ,a_{j+m-1}$ are all odd numbers. Then:

$${\displaystyle \frac{a_{j+m}}{a_j}}<{\left({\displaystyle \frac{3}{2}}\right)}^m$$

Proof. 

For any odd number x, after applying the Collatz function and one division by 2 (which must occur since $3x+1$ is even), we have:

$${\displaystyle \frac{(3x+1)/2}{x}}={\displaystyle \frac{3}{2}}+{\displaystyle \frac{1}{2x}}<{\displaystyle \frac{3}{2}}+ϵ$$

where $ϵ={\displaystyle \frac{1}{2x}}$ decreases as x increases.

For a sequence of m consecutive odd numbers starting at $a_j$, each step contributes a factor less than ${\displaystyle \frac{3}{2}}$, giving us:

$${\displaystyle \frac{a_{j+m}}{a_j}}<{\left({\displaystyle \frac{3}{2}}\right)}^m$$

□

Theorem 4.2

(Maximum Odd Sequence Length). Let ${\left(a_k\right)}_{k\ge 0}$ be a Collatz sequence with $a_0>4$. Then for any threshold $N\ge a_0$, there exists a constant $M_N$ such that no subsequence can contain more than $M_N$ consecutive odd numbers without returning below N.

Proof. 

Let $N\ge a_0$ be given and suppose we have a subsequence of m consecutive odd numbers starting at index j.

By the Odd Sequence Growth Rate Lemma:

$${\displaystyle \frac{a_{j+m}}{a_j}}<{\left({\displaystyle \frac{3}{2}}\right)}^m$$

For the sequence to stay above N, we must have $a_{j+m}>N$. Therefore:

$${\left({\displaystyle \frac{3}{2}}\right)}^m>{\displaystyle \frac{N}{a_j}}\ge 1$$

Taking logarithms:

$$mlog\left({\displaystyle \frac{3}{2}}\right)>log\left({\displaystyle \frac{N}{a_j}}\right)\ge 0$$

Therefore:

$$m<{\displaystyle \frac{log\left(N\right)-log\left(a_j\right)}{log(3/2)}}$$

Let

$$M_N=⌈{\displaystyle \frac{log\left(N\right)}{log(3/2)}}⌉.$$

Then no subsequence can contain more than $M_N$ consecutive odd numbers without returning below N. □

Lemma 4.3

(Global Odd Sequence Bound). For any threshold $N>4$, if a Collatz sequence ${\left(a_k\right)}_{k\ge 0}$ stays above N, then:

$${\displaystyle \frac{a_{k+m}}{a_k}}<{\left({\displaystyle \frac{3}{2}}\right)}^m$$

for all $k,m\ge 0$.

Proof. 

Let $N>4$ and let ${\left(a_k\right)}_{k\ge 0}$ be a sequence staying above N. For any term $a_k$:

Case 1: If $a_k$ is even, then $a_{k+1}=a_k/2$ and:

$${\displaystyle \frac{a_{k+1}}{a_k}}={\displaystyle \frac{1}{2}}<{\displaystyle \frac{3}{2}}$$

Case 2: If $a_k$ is odd, then by Lemma 3.3:

$${\displaystyle \frac{a_{k+1}}{a_k}}={\displaystyle \frac{3a_k+1}{a_k}}=3+{\displaystyle \frac{1}{a_k}}<{\displaystyle \frac{3}{2}}$$

since $a_k>N>4$.

By induction on m, for any sequence of m terms:

$${\displaystyle \frac{a_{k+m}}{a_k}}<{\left({\displaystyle \frac{3}{2}}\right)}^m$$

□

Corollary 4.4

(Guaranteed Even Number Occurrence). In any Collatz sequence ${\left(a_k\right)}_{k\ge 0}$ with $a_0>4$, the proportion of even numbers in any sufficiently long subsequence is at least ${\displaystyle \frac{1}{M_N+1}}$, where $N=a_0$ and $M_N$ is as defined above.

Theorem 4.5

(Impossibility of Bound Evasion). Let ${\left(a_k\right)}_{k\ge 0}$ be a Collatz sequence with $a_0>4$. Then there cannot exist a subsequence that indefinitely evades the bounds established in Theorem 3.3.

Proof. 

Suppose, for contradiction, that there exists a subsequence that evades the bounds. By the Maximum Odd Sequence Length Theorem, this subsequence must contain even numbers with frequency at least ${\displaystyle \frac{1}{M_N+1}}$.

Each even number in the sequence results in division by 2. Therefore, after k terms, the cumulative multiplicative factor from even terms is at most:

$${\left({\displaystyle \frac{1}{2}}\right)}^{{\displaystyle \frac{k}{M_N+1}}}$$

From the Odd Sequence Growth Rate Lemma, the cumulative multiplicative factor from odd terms is at most:

$${\left({\displaystyle \frac{3}{2}}\right)}^{{\displaystyle \frac{M_{N}k}{M_N+1}}}$$

The combined effect after k terms is therefore bounded by:

$${\left({\displaystyle \frac{1}{2}}\right)}^{{\displaystyle \frac{k}{M_N+1}}}·{\left({\displaystyle \frac{3}{2}}\right)}^{{\displaystyle \frac{M_{N}k}{M_N+1}}}={\left({\displaystyle \frac{3^{M_N}}{2^{M_N+1}}}\right)}^{{\displaystyle \frac{k}{M_N+1}}}$$

Since ${\displaystyle \frac{3^{M_N}}{2^{M_N+1}}}<1$ for any $M_N$, this factor decreases exponentially with k, contradicting the assumption that the subsequence could evade the bounds indefinitely. □

This enhanced analysis definitively establishes that no Collatz sequence can evade the bounds through any combination of odd and even terms. The explicit bounds on odd sequence length, combined with the guaranteed occurrence of even numbers, ensure that all sequences must eventually exhibit the descending behavior established in Section 3.

5. Uniqueness of the Fundamental Cycle

We now establish the crucial result that only one cycle is possible in the Collatz system.

Lemma 5.1

(Cycle Growth Property). Let $(n_1,\dots ,n_k)$ be a cycle in the Collatz system. Then:

$$\prod _{i=1}^k{\displaystyle \frac{C\left(n_i\right)}{n_i}}=1$$

(6)

Proof. 

In a cycle $(n_1,\dots ,n_k)$:

$$C\left(n_i\right)=n_{i+1}\mathrm{for}i=1,\dots ,k-1\mathrm{and}C\left(n_k\right)=n_1$$

Therefore:

$$\prod _{i=1}^k{\displaystyle \frac{C\left(n_i\right)}{n_i}}={\displaystyle \frac{n_2}{n_1}}·{\displaystyle \frac{n_3}{n_2}}·\dots ·{\displaystyle \frac{n_k}{n_{k-1}}}·{\displaystyle \frac{n_1}{n_k}}={\displaystyle \frac{n_1}{n_1}}=1$$

Let E be the set of indices where $n_i$ is even and O where $n_i$ is odd. Then:

$$\prod _{i=1}^k{\displaystyle \frac{C\left(n_i\right)}{n_i}}=\prod _{i\in E}{\displaystyle \frac{1}{2}}·\prod _{i\in O}\left(3+{\displaystyle \frac{1}{n_i}}\right)=1$$

Taking logarithms:

$$\sum _{i\in E}log\left({\displaystyle \frac{1}{2}}\right)+\sum _{i\in O}log\left(3+{\displaystyle \frac{1}{n_i}}\right)=0$$

Let e = |E| and o = |O|. Then:

$$-elog\left(2\right)+\sum _{i\in O}log\left(3+{\displaystyle \frac{1}{n_i}}\right)=0$$

Therefore:

$$2^e=\prod _{i\in O}\left(3+{\displaystyle \frac{1}{n_i}}\right)$$

(7)

□

Lemma 5.2

(Cycle Ratio Balance). In any Collatz cycle containing e even terms and o odd terms:

$${\left({\displaystyle \frac{1}{2}}\right)}^e={\left(3+\epsilon \right)}^o$$

where $\epsilon <{\displaystyle \frac{1}{4}}$ for each odd term.

Proof. 

Consider a cycle $(n_1,\dots ,n_k)$ of length $k=e+o$. Let E be the set of indices of even terms and O the indices of odd terms.

For even terms $n_i$, $i\in E$:

$${\displaystyle \frac{C\left(n_i\right)}{n_i}}={\displaystyle \frac{1}{2}}$$

For odd terms $n_i$, $i\in O$:

$${\displaystyle \frac{C\left(n_i\right)}{n_i}}=3+{\displaystyle \frac{1}{n_i}}=3+{\epsilon }_i$$

where ${\epsilon }_i={\displaystyle \frac{1}{n_i}}<{\displaystyle \frac{1}{4}}$ since all terms in a cycle must be greater than 4.

Since the product of all ratios in a cycle must be 1:

$$\prod _{i=1}^k{\displaystyle \frac{C\left(n_i\right)}{n_i}}={\left({\displaystyle \frac{1}{2}}\right)}^e\prod _{i\in O}(3+{\epsilon }_i)=1$$

Therefore:

$${\left({\displaystyle \frac{1}{2}}\right)}^e=\prod _{i\in O}(3+{\epsilon }_i)$$

with ${\epsilon }_i<{\displaystyle \frac{1}{4}}$ for all $i\in O$. □

Lemma 5.3

(Impossibility of Large Cycles). No Collatz cycle can contain a number greater than 4.

Proof. 

Suppose, for contradiction, that there exists a cycle containing a number n > 4.

By Theorem 5.1, if e is the number of even terms and o the number of odd terms:

$$2^e=\prod _{n_i\mathrm{odd}}\left(3+{\displaystyle \frac{1}{n_i}}\right)$$

For any odd number $n_i>4$:

$$3+{\displaystyle \frac{1}{n_i}}<3.25$$

Therefore:

$$2^e<{\left(3.25\right)}^o$$

Taking logarithms base 2:

$$e<o{log}_2\left(3.25\right)\approx 1.7o$$

However, in any cycle:

• Each odd number produces an even number (via 3n+1)
• Each even number may produce either an even or odd number (via n/2)
• To complete the cycle, we must return to an odd number

This implies e ≥ o, contradicting the inequality above. □

Theorem 5.4

(Uniqueness of the Fundamental Cycle). The sequence $1\to 4\to 2\to 1$ is the only cycle possible in the Collatz system.

Proof. 

By Theorem 5.3, any cycle must contain only numbers ≤ 4.

Let n be the smallest number in a cycle. We analyze all possibilities:

Case 1 (n = 1):

• C(1) = 4
• C(4) = 2
• C(2) = 1

This gives us the known cycle $1\to 4\to 2\to 1$.

Case 2 (n = 2): Then C(2) = 1, reducing to Case 1.

Case 3 (n = 3):

• C(3) = 10
• But 10 > 4, contradicting Theorem 5.3

Case 4 (n = 4): Then C(4) = 2, reducing to Case 2.

Therefore, any cycle must contain 1, which means it must be the cycle $1\to 4\to 2\to 1$. □

Figure 3. The unique cycle in the Collatz system

Figure 3. The unique cycle in the Collatz system

6. Main Result

We now present the complete proof of the Collatz conjecture.

Theorem 6.1

(Resolution of the Collatz Conjecture). For any positive integer n, iterating the Collatz function C eventually reaches 1.

Proof. 

Let $n\in {\mathbb{N}}^{+}$ be arbitrary. We will demonstrate that the sequence starting from n must converge to 1 through the following steps:

1) By Theorem 3.4, for any threshold $N\ge max\{n,4\}$, if the sequence ever exceeds N, it must eventually return below N. This establishes that unbounded growth is impossible.

2) By Theorem 3.5, any sequence that exceeds its starting value must either:

• Enter the cycle {1,4,2}, or
• Return below its starting value infinitely often

3) By Theorem 5.4, the only possible cycle in the system is {1,4,2}.

Combining these results:

• The sequence cannot diverge
• The sequence cannot enter any cycle except {1,4,2}
• Any value above 4 must eventually decrease

Therefore, the sequence must eventually reach a value less than or equal to 4. By direct computation:

• If it reaches 1, we are done
• If it reaches 2, the next iteration gives 1
• If it reaches 3, the sequence continues $3\to 10\to 5\to 16\to 8\to 4\to 2\to 1$
• If it reaches 4, the next iteration gives 2, then 1

Thus, once the sequence reaches any value ≤ 4, it must eventually reach 1. □

Figure 4. Convergence of multiple sequences to the fundamental cycle

Figure 4. Convergence of multiple sequences to the fundamental cycle

7. Conclusion

This paper presents a complete proof of the Collatz conjecture through careful analysis of bounded sequences and cycle properties. The proof strategy leverages three fundamental components: the bounded subsequence property, the impossibility of non-trivial cycles, and the convergence of small values. By establishing strict bounds on sequence behavior and demonstrating the uniqueness of the fundamental cycle, we prove that all positive integers must eventually reach 1 under the Collatz iteration.

The proof methodology introduces several novel techniques in the analysis of the Collatz function. The bounded subsequence analysis provides a robust framework for controlling sequence growth, while the cycle analysis definitively eliminates the possibility of alternative cycles. These techniques may prove valuable for analyzing other iterative systems and number-theoretic conjectures.

Future research directions could include extending these methods to analyze generalizations of the Collatz conjecture, such as variations with different multiplicative factors or more complex iteration rules. Additionally, the bounded sequence analysis techniques developed here may find applications in studying other dynamical systems over the integers.