deletions | additions       diff --git a/9090+3.tex b/9090+3.tex  index e3b5a2c..172f15c 100644  --- a/9090+3.tex  +++ b/9090+3.tex 
...
\end{equation}  These appear always divisible by 3. We may have unearted a form, $3030... +1$. As expected.  The nest thing to check would be all numbers $1$ through $9$ for a similar +1 form. If such numbers are always divisible by $3$ thenn we know if any prime of the form $(90;;n)+1$, were a double prime, it must be the upper of the two with a pair of the form $(90;;n)-2$. $(90;;n)-1$.  By the digit sum we probably know the next sequence $9090+9...$ cannot be prime. 
...
\end{array}  \end{equation}  Will all be divisible by $9$. \begin{equation}  \begin{array}{|c|c|c|}  \hline  (90;;n)-1 & p? & rep \\  \hline  (90;;1)-1 & 1 & 89 \\  (90;;2)-1 & 0 & 61×149 \\  (90;;3)-1 & 1 & (90;;3)-1 \\  (90;;4)-1 & 1 & (90;;4)-1 \\  (90;;5)-1 & 0 & 2549×3566461 \\  (90;;6)-1 & 0 & 11^2×7513148009 \\  (90;;7)-1 & 0 & 79×203279×5660929 \\  (90;;8)-1 & 0 & 19×6679×71637804989 \\   (90;;9)-1 & 0 & 23×29×743×1834394194069 \\  (90;;10)-1& 0 & 163×557724484104852203 \\  (90;;11)-1& 1 & (90;;11)-1 \\  (90;;12)-1& 0 & 11174664913×81352856319953 \\  (90;;13)-1& 0 & 367×276707645239×895200038153 \\  (90;;14)-1& 0 & 23887×97928921×3886285801408807 \\  (90;;15)-1& 1 & (90;;15)-1 \\  (90;;16)-1& 0 & 43×2171377491319×973651478526809717 \\  (90;;17)-1& 0 & 11×19^2×54184152902129×42250819759581371 \\  (90;;18)-1& 0 & 348637×2607557170039063813964355214997 \\   (90;;19)-1& 0 & 113×389×1901×12037×18553×3410051×1428577723920407 \\  (90;;20)-1& 0 & 23^2×67×79×77862675719×41698499254488057125923 \\  (90;;21)-1& 1 & (90;;21)-1 \\  (90;;22)-1& 0 & 116548301×316802597×2462139382578592432493671937 \\  (90;;23)-1& 0 & 29×89×223×614701×25695112744556108783455528889830703 \\  \hline  \end{array}  \end{equation}