🦚
Collatz Prefixes
  • Collatz Prefixes
  • Theory
    • Introduction
    • Trajectory & Sequence
    • Exponential Canonical Form
    • Inverse Canonical Form
    • Recursive Index-Parity Tree
    • Path-Indexed Prefix Tree
      • Finding Nature
      • Parent & Child
    • Operation Table
      • Navigating
      • Testing an ECF
      • Shrinking Numbers
    • Iterative Method
Powered by GitBook
On this page
  1. Theory

Trajectory & Sequence

PreviousIntroductionNextExponential Canonical Form

Last updated 2 years ago

CtrlK

There will be many numbers visited as we traverse from some number nnn all the way down to 1. Consider these visited numbers in the order they appear, any slice of this list of numbers will be a trajectory. We have a handy notation for this as follows:

n→F1(n)→F2(n)→…→Fm(n)n \to F^1(n) \to F^2(n) \to \ldots \to F^m(n)n→F1(n)→F2(n)→…→Fm(n)

If the trajectory ends with 1, we call this to be a sequence.

Note that a sequence can continue indefinitely after 1, and repeat many 1s until finally terminating. For our convenience, a sequence will refer to a trajectory that ends with 1 and does not repeat.

For example, the number 17 has the following sequence:

17→52→26→13→40→20→10→5→16→8→4→2→117 \to 52 \to 26 \to 13 \to 40 \to 20 \to 10 \to 5 \to 16 \to 8 \to 4 \to 2 \to 117→52→26→13→40→20→10→5→16→8→4→2→1

Any slice of this could be considered a trajectory:

  • 52→26→1352 \to 26 \to 1352→26→13

  • 10→5→1610 \to 5 \to 1610→5→16

Reduced Trajectories

As we can see, trajectories can be rather lengthy; even with small starting numbers. We have already mentioned that looking at odd numbers suffice, and indeed they will make analyzing these trajectories a lot prettier too. The notation will be similar to before:

n→x0R0(n)→x1R(n0)→x2R(n1)→x3…→xmR(nm−1)n \xrightarrow{x_0} R_0(n) \xrightarrow{x_1} R(n_0) \xrightarrow{x_2} R(n_1) \xrightarrow{x_3} \ldots \xrightarrow{x_m} R(n_{m-1})nx0​​R0​(n)x1​​R(n0​)x2​​R(n1​)x3​​…xm​​R(nm−1​)

Here, the notation works as follows:

  • n0=R0(n)n_0 = R_0(n)n0​=R0​(n) and x0x_0x0​ is the power of two used within R0R_0R0​.

  • ni=R(ni−1)n_i = R(n_{i-1})ni​=R(ni−1​) and xix_ixi​ is the power of two used within that RRR.

Likewise, if the last number in the reduced trajectory is 1 then this is called to be a reduced sequence.

Looking again at number 17, its reduced sequence this time:

17→017→213→35→4117 \xrightarrow{0} 17 \xrightarrow{2} 13 \xrightarrow{3} 5 \xrightarrow{4} 1170​172​133​54​1

Note that 17 appears twice at the start, because it is already an odd number and R0R_0R0​ will not do anything, thus x0=0x_0 = 0x0​=0.

13→4013 \to 4013→40