Homepage Solution manuals David S. Dummit Abstract Algebra Exercise 4.5.55 (Converse to the preceding exercise)

Exercise 4.5.55 (Converse to the preceding exercise)

Prove the converse to the preceding exercise: if n 2 is an integer such that every group of order n is cyclic, then n = p 1 p 2 p r is a product of distinct primes and p i does not divide p j 1 for all i , j . [If n is not of this form, construct noncyclic groups of order n using direct products of noncyclic groups of order p 2 and 𝑝𝑞 , where p q 1 .]

Answers

Proof. Let G be a group of order n 2 .

  • If ν p ( n ) > 1 for some p , then | G | = p 2 u , for some integer u . Consider the group

    G = Z p × Z p × Z u .

    For all x G 2 , x 𝑝𝑢 = 1 , thus there is no element of order n = p 2 u in G , so G is not cyclic.

  • Suppose that there are two prime divisors p , q of n = | G | such that p q 1 . Then there exists a non abelian group H of order 𝑝𝑞 (see the proof in “Example, groups of order 𝑝𝑞 ” p. 143, or in Chapter 5, where H is constructed as a semi-direct product).

    Then the group

    G = H × Z v

    has order n = 𝑝𝑞𝑣 . Moreover G is not abelian, so G is not cyclic.

This proves that if every group of order n is cyclic, then n = p 1 p 2 p r is a product of distinct primes and p i does not divide p j 1 for all i , j . □

User profile picture
2026-04-14 11:08
Comments