olymmath

Putnam 2007 A5

  • Session A

Suppose that a finite group has exactly nn elements of order pp, where pp is a prime. Prove that either n=0n=0 or pp divides n+1n+1.

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 SS denote the set of pp-tuples (a1,a2,⋯ ,ap)(a_1, a_2, \cdots, a_p) where ai∈Ga_i \in G and a1a2a3⋯ap=1a_1 a_2 a_3 \cdots a_p = 1. Note that Z/pZ\mathbb{Z}/p\mathbb{Z} acts on SS by cyclic rotations. Thus, we have ∣S∣=#{orbits of size 1}+#{orbits of size p}⋅p|S| = \#\{\text{orbits of size 1}\} + \#\{\text{orbits of size p}\} \cdot p Orbits of size 1 correspond to tuples of the form (x,x,x,⋯ ,x)(x, x, x, \cdots, x), i.e. elements x∈Gx\in G of order pp, excepting the orbit corresponding to the trivial tuple (1,1,1,⋯1)(1, 1, 1, \cdots 1). Thus, #{orbits of size 1}=#{elements of order p}+1=n+1\#\{\text{orbits of size 1}\} = \#\{\text{elements of order }p\} + 1 = n+1 On the other hand, note that ∣S∣=∣G∣p−1|S| = |G|^{p-1} because the first p−1p-1 elements of any pp-tuple can be chosen totally arbitrarily, and then the last element of the tuple is fixed. Taking the equation for ∣S∣|S| modulo pp, we see that if pp divides ∣G∣|G|, then pp divides n+1n+1, as desired.

Mathematics Stack Exchange. Open licence.

Similar problems

These problems have the most words in common with this statement.

Locator putnam/2007/a5 · Tag AD8Z9SET71 · Edit this page on GitHub · Keys: j next, k previous