This presentation explores some of the patterns that are evident within the Phi values of Eulerís Toitient Function. Despite its many implications in the field of RSA cryptography, there is much to be learned about the inner workings of this complicated function for finding the number of values less than and relatively prime to a specific number.
|Presenter:||Ellen Nary (Undergraduate Student)|
|Time:||9:20 am (Session I)|
Writing @ The Graduate Level
6 pm - 7 pm