>>8819

The low primes act to filter out the numbers that a cannot be based on what we know in [e,1] and, importantly in [-f,1]. Because one is odd, and one is even, the overlap and distribution of odd numbers in one of these columns and e' is such that a lookup becomes possible.

>>8821

>So the next thing to look into could maybe be a comparison between the prime factors of each a'[t] value in both (e',1) and (f',1), using consecutive primes for q.

Cool! I'll have time to put in some work on this after my workday is finished. Thanks Senpai for verifying that we're on the right track!

>>8819

So we’re expanding c to c’ and looking for the prime factors.

Those new elements can be easily calculated, based on Grid Rules.

The Grid itself is awesome.

Never ending patterns of truth.

And logic.

Beautiful!

I have another idea.

What if we make a list of possible a values based on the limitation of (prime d)? Will be huge.

Then begin "Ruling" them out with the factors we find in the c'=abq=qc search

Each new column (from each small prime) limits our search space much further.

It's a few parts:

1. Searching each (small prime) leading up to q.

(Why is it named Q, lol??)

and as we go, crossing vast swathes of numbers off the list of possible a values. Find a solution? Great. If not, step 2.

1. If that doesn't find a solution, multiply each small prime with each small prime, creating new semi-prime combos. Check and verify for a solution.

2. Find new ways to limit the search.

3. Wash, Rinse, Repeat.

4. Keep a list of "Ruled-Out" a values, until the solution emerges.