Thank you, very thoughtful for us non-skilled programmers! Is this 5D Anon??
Thanks MM! I've got all my java files from AA's code running properly with BigInteger. I'm still learning to code myself, but I'm studying all the code to learn how to do it myself. Honestly I'm still a newb, but learning quickly.
This is an interesting crumb from >>8638:
>These primarily focus on navigation bi-directionally across row n=1 and within a cell at [-f,n] and [e,n].
So that means to me that once we've established (-f',1) (-f,1) (e,1) (e',1) we search left and right in row 1, along with up and down within [t] values for each row 1 cell. c'=abq=qc
Every time we multiply c with a (small prime), that new c' value has a new e column.
So the series of (small primes) give us a bunch of new info in row 1. Interesting that for c145, BigN' is found at (49,49) which ties into the diagonal clue VQC hinted at.
>I've found 3 ways, row 1, column 0, and the diagonal.
Perhaps one of the new BigN' values always lands in the diagonal path from the origin? Not sure, just pointing out an interesting find.
Hey Chris, can you come out and play now that you're in the US?