In 1994, Dr. Peter Shor developed an algorithm for finding the period of large prime numbers. This algorithm is called Shor’s Algorithm and it enables quantum computers to calculate the period faster than classical computers. Classical computers implement a “brute-force” strategy for calculations by systematically trying every possible value. Alternatively, Shor’s algorithm sequentially tests the most probable number instead. An exploration of this algorithm’s implemented mathematics and a comparison with classical computing will be the focus of this poster.