deletions | additions       diff --git a/Introduction.tex b/Introduction.tex  new file mode 100644  index 0000000..bee5546  --- /dev/null  +++ b/Introduction.tex 
...
\section{Introduction}  As mentioned in previous articles [Include Here] on this account, theere exist divisor functions that tell the number of divisors a number has, but also those that generate a map that tells which divisors they are notably the Cosine method described in [Include Here].  This allows number to be written as strings with as many digits as that number. For example \begin{equation}  1=1 \\  2=11 \\  3=101 \\  4=1101 \\  5=10001 \\  6=111001 \\  \end{equation}  The interpretation of this is that, 1 is dvisible by 1 (left hand digit), 2 is divisible by 1 and 2, three is divisible by 1, not 2, but 3, 4 by 1, and 2, not 3, but 4. etc.  The numbers are generated by a cascading column sequence, in the left most column every number is 1, in the next across the sequence is 10101010... in the next 100100100100.. etc.  Due to the triangular nature of this pattern, if one extrapolates the zeros back up the column from the diagonal row of 1's, then the numbers are followed by 0's such that it is fair to rewrite equation 1 as \begin{equation}  1=100000 \\  2=110000 \\  3=101000 \\  4=110100 \\  5=100010 \\  6=111001 \\  \end{equation}