>>9852

>>9854

If this is the case, how would I go about using it?

>>9857

I'll look into it. I did see that the Miller-Rabin had the divide by 2 until odd and I was reminded of our recursive tree.

But I can't seem to see how it would be connected with the "virtual columns" (if it is).

>>9861

While I appreciate that, I guess my problem is I can't find any good questions right now. Odd how that works, huh.

Essentially, it's a square root factorizing algorithm. But we're missing something, the nontrivial transform.

>>9862

The first derivative of the grid is defined by >>9718?

So the second derivative would be a repeat of the above, but with the new values. Then rinse and repeat for more derivatives (if needed).

>>9861

Another thing I noticed in the Miller-Rabin test is the list of primes needed to check against for a set of number.

Which makes me think of q. Which also makes me think vqc =vector q, c? That we make a list of primes from column 1 (q) which we then use in a modification of the Miller-Rabin test against c to determine if it is a prime or not (and to get a factor).

Since the Miller-Rabin constructs a tree (although not directly, but abstractly) we'll do the same, but the end result will be similar. In the end we won't need to construct the tree, but for now it is a helpful method of learning. How far off am I? I can easily be way, way off.