Trajectory & Sequence
There will be many numbers visited as we traverse from some number n 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:
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:
Any slice of this could be considered a trajectory:
52β26β13
10β5β16
13β40
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:
Here, the notation works as follows:
n0β=R0β(n) and x0β is the power of two used within R0β.
niβ=R(niβ1β) and xiβ is the power of two used within that R.
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:
Note that 17 appears twice at the start, because it is already an odd number and R0β will not do anything, thus x0β=0.
Last updated