Given that all factors in a column are factors of the elements of the first cell in their column, how is that pattern used to factor the product of any two primes.
Hints:
Have you tried turning it off and on again? Mirror?
+(o)+
If c is an integer, particularly an integer that is the product of two different primes, where the c squared appear in COLUMN ZERO. How many times does it appear? What are the patterns of these appearances?
How do you USE the Row and Column to find what you need?
What did Einstein say about co-In(c)iden(c)e???
Good question.
The cells that have elements have infinite elements, yet they are constructible, so only a few and finite amount needed to represent the entire grid into infinity both in e and n columns and rows and in each of the cells that contains at least one element.
Taken as a whole, the grid is the equivalent to a superposition of infinite qubits.
The "collapse" of the superposition occurs with the input variables d and e, (the square root and remainder of c), leaving the positions in the column e of the values of n.
For reference, see the quantum Fourier transform from Shor's algorithm.
VIRTUAL QUANTUM COMPUTERS exist in the Mandelbrot set
BQP = P
squared circle
two objects thought to be different finally proven to be the same object.
1bda7f92691ec49a855af5cc0cbe22aa1cbb7e698dd1af876afed3af9f2cd8303eeae459ac5129457d61475ee13dd9d6e21c2d0d1275ffe0a86e9a5d9c06069f