🦚
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
  2. Operation Table

Testing an ECF

A simple ECF test using the table

PreviousNavigatingNextShrinking Numbers

Last updated 2 years ago

CtrlK

We have seen a relationship of numbers in different rows within a column in the previous section. This actually provides a rather handy method to test whether some ECF may be valid for some trajectory that starts with a given number.

Let us re-write the formula from before:

β(n+k,ρ)=β(n,ρ)+k3m2pm\beta(n + k, \rho) = \beta(n, \rho) +k\frac{3^{m}}{2^{p_m}}β(n+k,ρ)=β(n,ρ)+k2pm​3m​

Now, let us reinterpret this by rewriting n=1n=1n=1 and k=n−1k=n-1k=n−1 as follows:

β(n,ρ)=β(1,ρ)+(n−1)3m2pm\beta(n, \rho)=\beta(1, \rho)+(n-1)\frac{3^m}{2^{p_m}}β(n,ρ)=β(1,ρ)+(n−1)2pm​3m​

Recall that if ECF belongs to the Collatz sequence of a number, then the terminating number would be 1. So, we could assume β(n,ρ)=1\beta(n, \rho)=1β(n,ρ)=1 and then rewrite the equation above:

1=β(1,ρ)+(n−1)3m2pm1=\beta(1, \rho)+(n-1)\frac{3^m}{2^{p_m}}1=β(1,ρ)+(n−1)2pm​3m​
n=2pm3m(1−β(1,ρ))+1n=\frac{2^{p_m}}{3^m}\left(1-\beta(1,\rho)\right)+1n=3m2pm​​(1−β(1,ρ))+1

If this equation holds, then ρ\rhoρ is indeed the ECF of the Collatz sequence for nnn.

This method is does not make sense until we find an efficient way to calculate β(1,ρ)\beta(1,\rho)β(1,ρ). This part of the research remains open.