[Update: I added an additional assumption to question 3.]
This set is due May 13 at 10:30 am. Remember that we will have an additional meeting that day. Details of the homework policy can be found on the syllabus and here. This set is extra credit.
Let be a finite set and let
be a subgroup of the group
of permutations of the elements of
Define a relation
on
by saying that
iff either
or
- Begin by showing that
is an equivalence relation.
For each denote by
the equivalence class of
i.e.,
Suppose now that in addition, for any there is some permutation
such that
- Show that all the equivalence classes have the same size:
for all
Now assume as well that is a prime number, and that
contains at least one transposition
for some
with
- Conclude that
As an application, suppose that is a prime number and
is irreducible and of degree
Assume that
has exactly
real roots and 2 complex (non-real) roots.
- Conclude that
In particular, let
- Show that
Now suppose that is prime, and let
- Show that if
is an odd integer then
Let
and show that
is irreducible over
Now find
Typeset using LaTeX2WP.