Every number in an (e, n) is there because there exists a number in (e, 1) that is a*n. If that a is a prime, then it should start a new "chain" in the n records. Take for example (0,

8). It contains 4 chains based on the initial map generation program by VCQ. It's only 4 chains, because we have a limited generation of numbers in the initial map program. If

you extend this further then you should see even more chains in (0, 8)

A "chain" is something that links a row that contains a, b to b, c where a != b, b != c.

In (0, 8) we can see 4 different chains.

# Chain 1

1, 25 -25, 81 -> 81, 169

# Chain 2

4, 36 -36, 100 -> 100, 196

# Chain 3

9, 49 -49, 121 -> 121, 225

#Chain 4

16, 64 -64, 144 -> 144, 256

Use Y on C at X

(0, X)

(0, Y)

(0, C)

X and Y will not exist for primes

All elements in row one stem from one root element

>>6330497

It's pretty modular. They're all basically one thing, so why do we need to search?