Putnam 2007 A5
- Session A
Suppose that a finite group has exactly elements of order , where is a prime. Prove that either or divides .
Curated text Kedlaya Putnam archive. Quoted with source.
Solutions
Human solution Solution 1 by Manjul Bhargava, Kiran Kedlaya and Lenny Ng
The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).
Human solution Solution 2 by Sameer Kailasa
Here is a proof of the result, via an (famous/very clever/pretty) idea James McKay used to prove Cauchy's theorem.
Let denote the set of -tuples where and . Note that acts on by cyclic rotations. Thus, we have Orbits of size 1 correspond to tuples of the form , i.e. elements of order , excepting the orbit corresponding to the trivial tuple . Thus, On the other hand, note that because the first elements of any -tuple can be chosen totally arbitrarily, and then the last element of the tuple is fixed. Taking the equation for modulo , we see that if divides , then divides , as desired.
Mathematics Stack Exchange. Open licence.
Similar problems
These problems have the most words in common with this statement.