Hello Anons! :)

Our Definite Purpose is that WE are going to solve this, no matter how long it takes!

And Infinite Intelligence will come to our Aid as we keep our purpose Clear and Strong.

Ok, so we start with C

We create BigN and BigN-1

Those two are the upper limit of our search for n and n-1

They are also the upper limit for x and t.

(for our given C)

We know that the na transform into e and -f puts us right between two important groups in e and -f

Those two groups are:

1. a(n-1) and (an)

2. b(n-1) and (bn)

Here's c287( attached). Dark green is na transform in -f and e.

As you all can see, the a(n-1) and (an) records are 3 elements above both the -f and e na transform elements.

Also, you can all see the b(n-1) and (bn) records are 4 and 5 elements down from the na transform elements.

3,4,5 ???

Lol, Pythagorean triangle, at least for this solution for c287

3^2 + 4^2 = 5^2

VQC is also hinting at the ability to Scan/Search all c287 columns for -2 and 31, looking in those offset columns for a pair that matches our C.

Starting with Big N and Big N-1, then moving to row 1.

The offset between b(n-1) and (bn) is the ONLY similar pattern we currently know in row 1 that compares to the n and (n-1) offset.

Easy way to search is to move down (higher x and t) from the na transform in -2 and 31 looking for the b(n-1) and (bn) records.

Which are offset by one.

All we have to do is subtract each offset pair and do c / b.

We are looking for a remainder of 0,

Where the answer is a.

Thoughts, Anons ??