>>646

>>623

>>624

Alright lads, I'm back to work.

>t+p, t+2p, t+3p,..

>and

>p+1-t, 2p+1-t, 3p+1-t,..

>Since xx+e = 2na, every cell in row (e,1) contains a catalog of all values of na for a remainder e within the value a for those elements.

Ok, at this point my big question is this: Can we use row one to generate all prime answers for the diff of squares equation? VQC hinted at this by saying that we could manipulate c to get it into row one somehow. If that's the case, then all t equations apply, and it will make our work much easier. Maybe not, tho. Thoughts, Anons?

>>650

t is a direct derivate of x, different equations for odd and even e. Given e AND a, you can easily compute x starting from c. Agreed, PMA. T is the index variable for row 1. But we need a first to calculate x, because d-a=x

For t=1 in row 1, here are the equations to derive var a:

(0,0) a =2

odd e: a = (e+1)/2

even e: a= e/2

This gives us the starting seed for a in row 1, t=1. How do we scale up to t=2, t=3, etc? You can solve for b in t=1 using our equations. Then b drops to var a in t=2, new b. Then b in t=2 drops to a in t=3. New b in t=3. Then b drops to a in t=4. Ad infinitum for all row 1 a and b vars.