Klee Irwin (2017)

In Part I, we introduce the notion of simplex-integers and show how, in contrast to digital numbers, they are the most powerful numerical symbols that implicitly express the information of an integer and its set theoretic substructure. In Part II, we introduce a geometric analogue to the primality test that when p is prime, it divides \binom{p}{k}=(p(p-1)…(p-k+1)