Hello AA! I'm following. Here's my starter list. Let's build on it.
Here's a start for the list/program:
pick a c value from the grid. (let's start with odd x+n c values).
(prime) element shown.
(1,c) Big N.
(-f, c) Big N-1.
(e na transform).
(-f na transform).
(prime) x+n
(prime) d+n
(f-1) div 8
(f-1) mod 8
u and u+1 (to create odd x+n)
in (e,1) show (an) and (bn)
in (-f,1) show a(n-1) and b(n-1)
calc the needed movement from (e na transform) to (an) and (bn)
calc the needed movement from (-f na transform) to a(n-1) and b(n-1)
show polite numbers from (f-1) div 8 and multiply until we get a lock from rm (2d-1)
find the element in (e,1) that contains the f value which if we take SQRT(f) will give the correct x+n value