Doesn't look like we can use gcds for the cells in (e',1) where the a'[t] values are our a multiplied by something. There are lots of gcds greater than 1. Our a isn't even the highest prime gcd out of all of them. This one, for example, has a gcd of 73 between the a values in (390,1,32) and (390,1,43), which is larger than a=43.

Chris, I really want to know, why do you keep telling us you're going to explain how part of this works only to revert back to giving us hints every time? I mean if you want us to figure it out rather than being explicitly told then why would you even tell us you're going to explain it on a particular date? It's very discouraging.

>>8819

>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.

Just thought I'd run through a quick visual example of this so I might as well post it here. We already know the a values in (f',1) and (e',1) will have different parities. This just shows that a does indeed turn up twice as a factor of the a'[t] values in both (e',1) and (f',1), multiplied by numbers of a different parity based on e and f.

>The sequential probability of consecutive primes being in a random value of [e',1] are low and place huge restrictions on the other primes, including a and including the values of x.

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.

>>8821

Nice, forgot the picture

>>8819

>Each of those factors have to appear early and forever after once they appear in the grid. The sequential probability of consecutive primes being in a random value of [e',1] are low and place huge restrictions on the other primes, including a and including the values of x.

Here's one example of the patterns of the consecutive primes in q as they appear in (e',1) and (f',1). There's definitely a pattern to them (based on p+2-t and t+p), but can anyone spot any overlapping in this pattern that we can use for anything? I would have used a bigger example but I wanted something that would fit in a screenshot.

>>8824

Those are negative elements. There's always a beginning element in a cell and the variable values in the elements all grow from there in particular patterns (other than e and n). Negative elements aren't technically valid elements, but we can analyze what would happen if we made the growth pattern go backwards.

>>8827

See >>8823

>>8829

>Can see a' growth of +4 / t for both the e & f.

That's just the way a[t] grows in all (e,1) and (f,1) is all.

>Have you done anything in negative t space?

> - thinking about what an a'[0] or a'[-1] might be for the (e,1).

He did say the lookup had something to do with negative space. What he meant is obviously up for debate (and I can't remember the wording), but it could be helpful. I'll have a look soon.

>>8835

>>8834

Some of us have been talking about what primes we're meant to be using, and we're confused.

>>8780

>I can understand using primes that are only the sum of two squares as an accelerant for certain c, but remove 23 and other primes that end in 11 in binary, the sum of two squares that are odd end in 01.

If the two types of primes you're talking about are primes that end in 01 and primes that end in 11, and you're saying that primes that end in 01 are sums of two squares that are odd and that they can be used "as an accelerant for certain c" (meaning using only those primes is useful in specific situations but not every situation), why are you then telling us to remove primes that end in 11? That would leave us with only primes that end in 01, which, in the same sentence, you told us are useful for some specific c values and not all of them.

So are we just using odd sums of two squares primes (5, 13 etc), or are we using all consecutive primes (3, 5, 7, etc)? What specific numbers are we using?