This preview shows page 1. Sign up to view the full content.
Unformatted text preview: be positive integers with gcd( m,n ) = d . Show that over any eld the greatest common divisor of x m-1 and x n-1 is x d-1. Hint: Use the Euclidean algorithm. 4. If E and F are subelds of GF ( p k ) with p m and p n elements respectively, use the previous exercise to show that E F contain p d elements, where d = gcd( m,n )....
View Full Document
- Spring '11