deletions | additions       diff --git a/Primality.tex b/Primality.tex  index 4d6e09c..cdb64e6 100644  --- a/Primality.tex  +++ b/Primality.tex 
...
1;28 & 0 & 11×29×101×239×281×4649×909091×121499449 \\  1;29 & 0 & 3191×16763×43037×62003×77843839397 \\  1;30 & 0 & 3×7×11×13×31×37×41×211×241×271×2161×9091×2906161 \\  1;31 & 0 & 2791×6943319×57336415063790604359 \\  1;32 & 0 & 11×17×73×101×137×353×449×641×1409×69857×5882353 \\  1;33 & 0 & 3×37×67×21649×513239×1344628210313298373 \\  1;34 & 0 & 11×103×4013×2071723×5363222357×21993833369 \\  1;35 & 0 & 41×71×239×271×4649×123551×102598800232111471 \\  \end{array}  \end{equation} 
...
1;17n\in\mathbb{Z} & 2071723×5363222357 \\  1;18n\in\mathbb{Z} & 52579?? \\  1;19n\in\mathbb{Z} & 1;19 \\  1;20n\in\mathbb{Z} & 27961 \\  1;21n\in\mathbb{Z} & 10838689 \\  1;22n\in\mathbb{Z} & 513239  1;23n\in\mathbb{Z} & 1;23  1;24n\in\mathbb{Z} & 99990001  1;25n\in\mathbb{Z} &  \hline  \end{array}  \end{equation} 
...
We note that $n\in\mathbb{P}$ that are not $2$ appear to have two, larger primes introduced as divisible factors. (sometimes more? $13$. [semiprime?].  $10$,$12$,$14$, may or may not have some curious relationship as thier numbers are $9091,9901,909091$... $9091,9901,909091$...$99990001$,  Think [False concatenation of $90$ -> $(90;;3)+1$], [think added permutations],  does this apply to $333667$ as $(3;3|6;3)+1$. This sounds ridiculous which is why it's exciting. Groups of equal numbers of $9,0$, with $1$ added, sorted into all permutations. [One is prime??]  To find more factors, one could use the previously found factors to quickly divide the number.  For example if we wanted to find the prime factors of $1;50$, [given the previously foudn information of up to $1;25$], we may look at the divisors of $50$, $1,2,5,10,25,50$, and identify that the prime factorisation of $1;50$ will be $11×41×271×9091×21401×25601×182521213001xF$, where $F$ are the associated divisors with $n=50$. We know $1;50$ is not prime, as $50$ is not prime.  Task: construct a sieve of Sieve of Eratosthenes style algorithm which uses this concept as a test for primality?  Information required: The appending patterns of the form $d_1d_2...d_N;n$. This is a big task.