In this section
The 5x+1 equation multiplies by 5, adds one, and then divides out all the factors or 2 and 3. As the order of this division is significant the detailed descent is a bit ambiguous. In this diagram I draw out the area near the root of the three assuming that the powers of three are divided out first, then the powers of 2.
![]() |
When compared to the 3x+1 tree there is clearly more scaffolding (yellow) and fewer significant numbers (green). Because we chose to go 6-2-1 the number 3 appears nowhere in the tree. This is true of all odd multiples of three. We could choose to divide out the multiples of 2 first, but this would exclude a separate set of numbers (most multiples of 2). |
Here though I only deal in "significant" numbers so the order of division becomes irrelevant. Here is a python script to generate the next significant number in the 5x+1 sequence. It assumes that 'x' isn't a multiple of 2 or 3.
This shows the tree generated by seed values up to 301. The labels indicate the number of powers of 2 and 3 that had to be divided out to get from one number to the next. The colour scheme shows the remainder modulo 6 (pink=1, red=5). Click on the image for a larger version.
As we did with 3x+1 we can search for seeds that generate the largest value encountered so far, and the longest descent. The following table shows records for seeds less than 1000. The image on the right shows where these values fit into the tree, click on it for more detail.
The lists are getting a little long so let's just continue with the values.
|
|
Glide Records measure the longest encountered sequence of numbers that are all greater than the starting value. <to do>
<to do>