Journey Through Discovery : Exploring Primality in Modular Arithmetic, A

From comparing prime to composite modulus to the analyzing the characteristics of certain elements called "generators" our cohort is re-discovering the properties of modular arithmetic, along with what applications this might have in regard to cryptography. During the Fall 2009 semester, our cohort considered the impacts of using prime numbers as a modulus and then raising each number smaller than our modulus to ranging exponents. This generated a small set of numbers varying in size; thus being called "generators". This semester our research has taken into account composite modulus, as well as the investigatory question of, "How can we find 'generators'"?