1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Subgroups and prime order elements

  1. Apr 11, 2010 #1
    The question:

    Let n > 1 be a fixed integer and let G be a group. If the set H = {x in G : |x| = n} together with the identity forms a subgroup of G, what can be said about n?

    I know that n must be prime, but I can't figure out why that would be. The elements of h only have order 1 or n and no others and the order of an element divides the order of the (sub)group. Are we making the assumption that since there are no other divisors of the group order, n must be prime? Or is it something else...

    Any insight would be appreciated.

    W. =)
  2. jcsd
  3. Apr 12, 2010 #2
    No - take integers modulo 12 (under addition) with n=4. {0,3,6,9} is a subgroup.
  4. Apr 12, 2010 #3
    Is this supposed to be a counterexample? Did you account for the fact that |6|=2 since 6+6=0?
  5. Apr 12, 2010 #4
    Your intuition about n being prime is correct. As for your assumption question --- it is not an assumption; it is what you have to prove!

    Try a proof by contradiction. That is, suppose n = ab with a>1 and b>1. Now consider any element h in H. Since |h|=n=ab, we have [itex]h^{ab}=(h^a)^b[/itex]. Can you see how to get a contradiction out of this?
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook