Here's some Kanye fo yo ass.

https: //youtu.be/6CHs4x2uqcQ

>>6023

Mistakes here, but idea is sound. Should have said (n-1) instead of n0.

>>6024

Hobo! Nice to see you faggot! :)

>>6057

>>6058

Here's my working "code"

If (f-1) mod 8 = 1, Then (n-1) mod 8 = 3, (2d-1)(n-1) = 5. nn mod 8 = 0. Total mods = 9

If (f-1) mod 8 = 3, then (n-1) mod 8 = 3, (2d-1)(n-1) = 3, nn mod 8 = 0. Total mods = 9

If (f-1) mod 8 = 5, then (n-1) mod 8 = 3, (2d-1)(n-1) = 1, nn mod 8 = 0. Total mods = 9

If (f-1) mod 8 = 7, then (n-1) mod 8 = 3, (2d-1)(n-1) = 7, nn mod 8 = 0. Total mods = 17

So let's test.

Because if this idea is correct, we can iterate (n-1) based on the mod of (f-1)

Again, I could be wrong. My mind is in locked mode, so let's prove this idea wrong and move on to the next one.

I think tho that the mods give us a big CLUE to what fits!

Got placement for the 8 mods.

(I think)

Here's c85527 at (f-1) * 2 with mods included. Think I found a good location for them. It makes all gaps on the border = 40.

Split evenly to each 1Tu.

Here's my working diagram. Comments and corrections appreciated!

There's more to explain.

For this example, (f-1) div 8 =40.

So, nearest square to that is 36.

composed of T(5)=15 and T(6)=21 = 36

Tu remainder is 4. so 36 +4 = 40

so the light blue are 4 units added back in for each yellow and green square of 36.

Mods are in red, added at the center unit and at the corners and midpoints, creating gaps of 40, which our Tu remainder can fill (4 * 10 )

Not sure if this is right, just pushing my mind to explore possible answers.

Thoughts, Anons?

>>6114

Uh hey guise, I may have figured out the answer! Can I please get some eyes on this? Hey GA, this output is excellent. This is that na transform idea of being able to find the connections between (1,c) (prime) and (e,1). I'm studying now.

I have a few questions:

column 'bs' - this is d+n, correct?

column 'ls' - this is x+n, correct?

Here's the path I'm seeing:

Start at (1,c) a=1 b=145

na transform to (e,1) using d+(n-1) = 61-1+12 =72

So now we go to (1,1,12). d=72, a=61 (from na in (e,1) )

NOW CHECK THIS OUT LADS!

d+n squares for (1,c) and (e,1) match! = 73

x+n for (1,1,12) = 12

x+n for prime = 12

Now we construct the (prime) element.

(Prime x+n)^2 = 12^2 =144

c=145 + 144 = 289 = c + (prime d+n)

we know prime d = 12, same at (1,c)

289 = (17^2) = (n + 12) solve for n

n = 5

BOOM!

So basically (1,c) and (e,1) share the same (d+n) squares. We use the na transform to move from (1,c) to (e,1).

Then, (e,1) and (prime) share the same (x+n) square. So now, we work backwards to construct the prime element.

We have the correct (x+n) square and the value of c. so we do (x+n) + c = (d+n).

Then we use our d value of 12 along with (d+n) to isolate n.

BOOM!

Let's run some more test cases and verify!

Better screenshot on this post! Ok, here's my work in progress. It may seem simplistic, but please bear in mind that every number here is derived starting ONLY from c. Our (e,1) record gets us close enough to iterate. (maybe why we spent so much time learning to iterate?) Anyhow, just trying to move the ball forward. Comments and corrections welcome and appreciated!

>>6142

I am 100% committed to this quest, and will continue until it is solved.

Feeling tired and negative energy tonight.

But hopeful that positivity will return soon!

Let's unite our minds and souls and spirits in a request for Divine Guidance.

Savvy?

>>6290

>>6291

>>6292

Thanks VQC! Nice to see you :)