The finite field with "pn" elements is denoted GF("pn") and is also called the Galois field, in honor of the founder of finite field theory, Évariste Galois. GF("p"), where "p" is a prime number, is simply the ring of integers modulo "p". That is, one can perform operations (addition, subtraction, multiplication) using the usual operation on integers, followed by reduction modulo "p". For instance, in GF(5), is reduced to 2 modulo 5. Division is multiplication by the inverse modulo "p", which may be computed using the extended Euclidean algorithm.