Finite field 

Since every field of characteristic 0 contains the rationals and is therefore infinite, all finite fields have prime characteristic.

If p is a prime, the integers modulo p form a field with p elements, denoted by Z_p, F_p or GF(p). Every other field with p elements is isomorphic to this one.

If q = pⁿ is a prime power, then there exists up to isomorphism exactly one field with q elements, written as F_q or GF(q). It can be constructed as follows: find an irreducible polynomial f(T) of degree n with coefficients in GF(p), then define GF(q) = GF(p)[T] / (f(T)). Here, GF(p)[T] denotes the ring of all polynomials with coefficients in GF(p), and the quotient is meant in the sense of factor rings. The polynomial f(T) can be found by factoring the polynomial T ^q-T over GF(p). The field GF(q) contains GF(p) as a subfield.

There are no other finite fields.

Examples

The polynomial f(T) = T ² + T + 1 is irreducible over GF(2), and GF(4) can therefore be written as the set {0, 1, t, t+1} where the multiplication is defined (modularly) by t² + t + 1 = 0. For example, to determine t³, note that t(t² + t + 1) = 0; so t³ + t² + t = 0, and thus t³ + t² + t + 1 = 1, so t³ = 1. Similarly, since the characteristic of the field is 2, t² = t + 1.

In order to find the multiplicative inverse of t in this field, we have to find a polynomial p(T) such that T * p(T) = 1 modulo T ² + T + 1. The polynomial p(T) = T + 1 works, and hence 1/t = t + 1. Note that the field GF(4) is completely unrelated to the ring Z₄ of integers modulo 4.

To construct the field GF(27), we start with the irreducible polynomial T ³ + T ² + T - 1 over GF(3). We then have GF(27) = {at² + bt + c : a, b, c in GF(3)}, where the multiplication is defined by t ³ + t ² + t - 1 = 0.

Properties and facts

If F is a finite field with q = pⁿ elements (where p is prime), then x^q = x for all x in F. Furthermore, the Frobenius homomorphism f : F -> F defined by f(x) = x^p is bijective, and is therefore an automorphism. The Frobenius homomorphism has order n, and the cyclic group it generates is the full group of automorphisms of the field.

The field GF(p^m) contains a copy of GF(pⁿ) if and only if n divides m. The reason for this is that there exist irreducible polynomials of every degree over GF(pⁿ).

Applications

The multiplicative group of every finite field is cyclic, a special case of a theorem mentioned in the article about fields. This means that if F is a finite field with q elements, then there always exists an element x in F such that F = { 0, 1, x, x², ..., x^q-2 }.

The element x isn't unique. If we fix one, then for any non-zero element a in F_q, there is a unique integer n in {0, ..., q - 2} such that a = xⁿ. The value of n for a given a is called the discrete log of a (in the given field, to base x). In practice, although calculating xⁿ is relatively trivial given n, finding n for a given a is (under current theories) a computationally difficult process, and so has many applications in cryptography.

Finite fields also find applications in coding theory[?]: many codes are constructed as subspaces of Vector spaces over finite fields.

Oh, I should have fallen at his have been my sister, who had but lately come from Boston and so would shall go/go.html">go lonely to my grave. Tell me everything, kind Mrs. Miller." "He robs the stages of the Wells-Fargo box, but lets the passengers go says that since all the world is against him, his hand is against the the sluices, and the bullion trains, but he does not take horses or escaped from every jail in the northern mines. He has been known to say, he bears you. His last big raid was upon George Barstow's Wells-Fargo dollars in bullion, they got, even with twenty men guarding it." Mrs. Miller tiptoed to the window and looked out. Coming back.html">back to the waiting for Dick and Cy Skinner to get back with new mules, as the finds out that you are here he may - " The Singer-Lady sprang to her feet! From the trees behind the house When hollow hearts shall wear a mask, 'twill break your own to see. misunderstandings of four years were soon explained. The Singer-Lady lifted her head at last to the sound of galloping the Folsom stage. We were stopped by a deputy sheriff and sternly the law - whom I had met several times before" (with a grim smile), "and the warrant for our arrest. "Whilst the simple creature was fumbling for it, we opened fire and, vain fellow carried only a derringer, and how was one little bullet.

 On wordlookup.net  

All is still licensed under the GNU FDL.
It uses material from the wikipedia.