and upper bounds for the start of the cycle, and a more detailed search of the range must be performed if the exact value of is needed. Also, most algorithms do not guarantee to find directly, but may find some multiple . (Continuing the search for an additional steps, where is the smallest prime divisor of , will either find the true or prove that .)

Computer representation

Except in toy examples like the above, will not be specified as a table of values. Such a table implies space complexity,

1.Previous
3.Next