>>9830

That would be very nice of you. Once Miller-Rabin is coded into the grid, if it happens before it’s solved, it will be the simplest way to understand number theory in existence.

I can help code this. This algorithm uses the Riemann hypothesis and it uses modular functions which ECC also makes heavy use of.

Also of note

Complex roots of unity in the Miller-Rabin algorithm have consequence for the factors of the number that is being primality tested. Possible to formulate in terms of the grid?

>>9835

That does exist, it’s a big e and the first row is a factor or n from what I remember

But unless you find something special about calculating possible rows, (think I saw a variant of Pascal’s triangle related to it), it won’t be the easiest way to decrease the search space

>>9838

No

>>9840

>3

>>9846

1 John 4:10

Deterministic Miller-Rabin test that relies on two hypotheses

Riemann hypothesis and a hypothesis that it is sufficient to test prime witnesses only to determine primality accurately

pastebin.com/wszQwN01

>>9847

Correction:

pastebin.com/wzsQwN01

>>9848

Was only testing it on rsa primes and semiprimes when I uploaded this, apparently my natural logarithm function becomes too inaccurate when the numbers get vqc example sized

I’ll implement some precomputed witnesses tomorrow to change that

A temporary fix to make small examples accurate is change the variable m in ln from (3*(p/2)) to 8