I will have more time to post tomorrow.

Thank you for your patience.

Tomorrow I will show the way in which na and (n-1)a relationships between a[t] and d[t] in row 1 cells (e,1) and the pattern in column zero (n,0), these can both be used to factor arbitrary c in < O(log l) where l is the length of c in bits.

Thank you again for being patient.

After this, we will demonstrate on the longest (2048 bit) RSA number and then factor the remaining numbers.

Then we will set up a new thread for elliptic curve discussions including why Fermat's Last Theorem took so long and required complex new objects (unnecessary).