5 Determination of p

Theoretically, p could be found using an extension to more than 2 numbers of the Euclid gcd algorithm. But in practice, the $t_{\rm k}$ are not known to infinite precision, and the Euclid algorithm is numerically unstable for non integer numbers. A practical solution could then be to stop the algorithm when the smallest number is smaller than some $\epsilon$.Otherwise, the spectral window is probably the most efficient way to find p in this fuzzy environment. p is the inverse of the smallest $\nu$ for which $G_{N}(\nu)$ is greater than some value just below one.