Well. Step to step, Doc.
I think M() can have one full correct axiomatic definition. BUT ALSO I post the pseudocode, at other forum. And the C code here. The theory of the M function start solving the question:¿ whats the distance from a prime p to any f(i) series?. Answer: f(d) mod p. After i find what i named "tserie". Here is "n+e=(2^g)e'". Any tserie gives a integral equation. Here is: (eEnd)(2^M)(eStart) = n*D.
The C source is only the resolution of the tserie.
This is, start n+1=(2^g)e',n+e'=(2^g)e'',until you get e=1.
¿ always you back to one ? Yes.
¿ is something like Collatz ending always on 1 ? Yes, is the same thing. I posted also about it.
If you compile, links, and execute the C code, you get the right results.
For a practical user, what makes the M() is put any prime on their place.
I think cpu time is best used computing M, that making trials on dividers.
The tserie is like the Touring Machine. Slow, but with a strong theory. Can be someone can make the step from my theorical tserie to a faster language.
JM M
Last fiddled with by JM Montolio A on 20180306 at 18:06
