deletions | additions       diff --git a/The 90 Thing.tex b/The 90 Thing.tex  index 9955863..5f4bae2 100644  --- a/The 90 Thing.tex  +++ b/The 90 Thing.tex 
...
The non-existance of a $q$ in the range [1,n] that $n-q \; \mathrm{mod} \; (1+2q) = 0$, then $(90;;n)+1$, is neccesary but not sufficient for a primality check. However, for larger $n$, it may be expected that this check becomes more and more like a primality check??? [Why?]  However if one was going to search for a large prime in this form it would be wise to run this very quick check before hand. As in a matter of seconds one can tell that $(90;1000000076)+1$ may be prime, but $(90;1000000077)+1$ definately is not!  This is cute, as instead of cheking a number a billion digits long, we can check a number log_{10}(digits) in a linear way.