1. Not finding help here? Sign up for a free 30min 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!

Subgroup proof - is this even true?

  1. Sep 9, 2014 #1
    1. The problem statement, all variables and given/known data

    Prove that G cannot have a subgroup H with |H| = n - 1, where n = |G| > 2.

    2. Relevant equations



    3. The attempt at a solution

    Counter-example, the multiplicative group R and its subgroup, multiplicative group R+. Or, the additive group Z, and its subgroup of integer multiples of 2. What am I missing here? I think this is trivial for finite groups, but they don't say finite groups, they don't say anything.
     
  2. jcsd
  3. Sep 9, 2014 #2

    Dick

    User Avatar
    Science Advisor
    Homework Helper

    Saying n=|G| implies that the group is finite and has order n. Otherwise |H| = n - 1 wouldn't make much sense.
     
  4. Sep 9, 2014 #3
    OK

    Thanks
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted



Similar Discussions: Subgroup proof - is this even true?
Loading...