The number of elements of order 2 in a group is fairly restricted: 0, odd, or infinity. All such possibilities occur already in the trivial group and in dihedral groups.

The number of elements of order 3 in a group can be shown to be similarly restricted: 0, 2 mod 6, or infinity. However, something strange happens: not all possibilities can be realized.

Even worse, there is a fairly small number that I cannot decide whether it is or is not the number of elements of order 3 in a finite group:

Is there a group with exactly 92 elements of order 3?

More boldly, I would like to know (but feel free to answer only the first question):

Exactly which numbers occur as the number of elements of order 3 in a group?

Background: Such questions were studied a bit by Sylow and more heavily by Frobenius. The theorem that the number of elements of order p is equal to −1 mod p is contained in one of Frobenius’s 1903 papers. Since elements of order 3 come in pairs, this doubles to give 2 mod 6 for p=3.However, Frobenius’s results were improved some 30 years later by P. Hall who showed that if the Sylow p-subgroups are not cyclic, then the number of elements of order p is −1 mod p

^{2}.If the Sylows are cyclic of order p

^{n}, then the number of subgroups of order p is congruent to 1 mod p^{n}by the standard counting method. If the Sylow itself is order p, then the subgroup generated by the elements of order p acts faithfully and transitively on the Sylow subgroups, so for small enough numbers, the subgroup can just be looked up.In all cases, we can assume the group is finite since the subgroup generated by the elements of a fixed order is finite (assuming there are only finitely many elements of that fixed order).

Easier example: For instance there is no group with exactly 68 elements of order 3, since such a group would have cyclic Sylow 3-subgroups by Hall, order 3 Sylows by the counting, but then would have 34 Sylow 3-subgroups, and so (the subgroup generated by the elements of order 3 would) be a primitive group of degree 34. One checks the list of primitive groups of degree 34 (that is, A_{34}and S_{34}, both with ginormous Sylow 3-subgroups) to see no such group exists.One could also try 140, but the action need not be primitive so the table lookup is harder. Such a group has Sylows of order 3, but is not solvable, so is somewhat restricted.

**Answer**

Let p,p′≡2(mod3) be prime.

Suppose that G is a group with the following properties:

(i) The 3-Sylow subgroup of G is cyclic;

(ii) The number of elements of order 3 in G is 2pp′.

Claim: There exists a group which *in addition* satisfies either:

(iiia) G is simple; *or*

(iiib) 3||#G, and G surjects onto Z/3Z.

Remark: Suppose that G is a group with cyclic 3-Sylow subgroups. Since all 3-Sylow subgroups are conjugate, this implies that every subgroup of

order 3 in G is also conjugate.

Proof: We may assume that G is not simple, and hence admits a proper normal

subgroup H.

Suppose that H is a normal subgroup of G. If 3 divides #H, then

H contains a subgroup of G of order 3. All such subgroups are

conjugate in G, and since H is normal, they all lie in H. Thus

G and H have the same number of elements of order 3.

Moreover, the 3-Sylow subgroup of H is clearly cyclic, and so we may

replace G by H.

Suppose that (#H,3)=1. Then G/H still has a cyclic 3-Sylow subgroup, and hence every element of order 3 in G/H is conjugate. This implies that every element of order 3 in G/H lifts to an element of order 3 in G. Thus G/H has at most 2pp′ elements of order three. Yet by a theorem of Frobenius, the number N of g∈G of order exactly 3 is divisible by ϕ(3)=2, and the number N+1 of elements of order dividing 3 is divisible by 3. Hence N≡2(mod6). Thus the

number of elements of G/H of order 3 is either 2 or 2pp′. In the latter case, we replace G by G/H.

We may now assume that G/H has exactly 2 elements of order 3.

Clearly G/H has a unique subgroup of order 3, which must be normal.

Thus G/H and G have a quotient of order 13#(G/H), and thus G contains

a normal subgroup F of order 3#H. As above, we may replace G by F.

Note, however, that 3 exactly divides #F, and

F surjects onto Z/3Z, and thus, by Schur-Zassenhaus

(overkill in this case, of course), F is a semi-direct product.

My understanding of Jack’s argument:

Suppose that p′=2, so G has 4p elements of order 3. We still assume that the 3-Sylow of G is cyclic. G acts by conjugation on the 2p subgroups of order p, giving a map G→S2p. Let Q be one of these subgroups, and let M be the normalizer of Q. Let P be a 3-Sylow containing Q. Certainly [G:M]=2p, by the orbit-stabilizer formula.

If X⊂G contains M, then [G:X]=1,2,p, or 2p. Let N be the normalizer of P. Clearly M⊃N. Thus P⊂M, and thus P is a 3-Sylow of M. Similarly, P is also a 3-Sylow subgroup of X. The Sylow theorems applied to M and X thus imply that [X:N],[M:N]≡1(mod3), and thus [X:M]≡1(mod3). Hence, since [X:M]=1,2,p or 2p, and, since p≡2(mod3), either X=M or X=G. Thus M is a maximal subgroup of G, and hence the action of G is primitive.

Now we suppose:

Assumption (*): The only primitive subgroups of S2p are A2p and S2p.

Then, we deduce that some quotient of G is either A2p or S2p. If G is simple, we deduce that G=A2p, which doesn’t have cyclic

3-Sylows if 2p>5. If G is a semi-direct product of Z/3Z with a group of order coprime to 3, then G cannot surject onto A2p or S2p if p>2. It seems to follow that:

If p≡5,8(mod9) and Assumption (*) holds, then G cannot have 4p elements of order 3. (The congruence conditions on p ensure that the 3-Sylow of G is cyclic).

**Attribution***Source : Link , Question Author : Jack Schmidt , Answer Author :
7 revs, 2 users 73%Septimus Harding
*