Here you will find information concerning my undergraduate research. It was focused on fast algorithms for testing if a number is prime. I survey the following algorithms: Wilson (slow, but historically relevant), Miller-Rabin (fast, but probabilistic), AKS (polynomial, but inneficient in practice) and Goldwasser-Kilian (elliptic curve based, fast and also provides a checkable certificate).