Search the courses, subjects, tracks, games and features, or jump straight to a page.
4 cards from this section. Quick, good the night before a test.
Define the order of a finite field.
Think about how many elements exist in a given set.
What is a prime characteristic?
Recall prime numbers and their properties.
What does the order of a finite field represent?
Focus on what 'order' typically indicates in mathematics.
Is it true that all finite fields must have prime order?
Recall the formula |F| = p^r.
Given a prime p = 7 and r = 3, illustrate how to construct a finite field and explain the significance of irreducible polynomials in your construction.
Use the Euclidean method to check if your polynomial is irreducible.
Prove that the mapping g from Z_p^r to the finite field is a bijection.
Construct the proof using closure and mapping properties of the elements.
5 more questions in this section. Enroll free to practise them all.
Enroll free