Further Maths Help
Watch
Announcements
Page 1 of 1
Skip to page:
My AS Further Maths exam is tomorrow. I've revised all the topics that may come up but I need help with one of them: GROUPS!
I have two questions:
What's a proper subgroup and why do we need to find it?
How do you find a proper subgroup from a group?
Thanks
I have two questions:
What's a proper subgroup and why do we need to find it?
How do you find a proper subgroup from a group?
Thanks

0
reply
Report
#2
(Original post by SS__)
My AS Further Maths exam is tomorrow. I've revised all the topics that may come up but I need help with one of them: GROUPS!
I have two questions:
What's a proper subgroup and why do we need to find it?
How do you find a proper subgroup from a group?
Thanks
My AS Further Maths exam is tomorrow. I've revised all the topics that may come up but I need help with one of them: GROUPS!
I have two questions:
What's a proper subgroup and why do we need to find it?
How do you find a proper subgroup from a group?
Thanks


0
reply
0
reply
Report
#4
(Original post by SS__)
Could you maybe explain that in words with no notations? Thanks
Could you maybe explain that in words with no notations? Thanks
0
reply
(Original post by NotNotBatman)
H is a proper subgroup of G if the set on which H is defined is contained within the set on which G is defined, but not equal and the binary operations of each group are the same.
H is a proper subgroup of G if the set on which H is defined is contained within the set on which G is defined, but not equal and the binary operations of each group are the same.
M = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} under the binary operation of multiplication modulo 11.
List all the proper subgroups of M.
Thanks again!
0
reply
Report
#6
(Original post by SS__)
Thanks for that! Could you help me with this question, it's about applying this rule.
M = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} under the binary operation of multiplication modulo 11.
List all the proper subgroups of M.
Thanks again!
Thanks for that! Could you help me with this question, it's about applying this rule.
M = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} under the binary operation of multiplication modulo 11.
List all the proper subgroups of M.
Thanks again!
The two most basic subgroups of any group are: the group itself, and the group containing only its identity element (?).
Every other subgroup is considered to be proper.
To find all the proper subsets, you can pick out elements one by one out of




Also note that for something like




Also note that the amount of elements in a subgroup must divide the number of elements in the main group. I.e. the amount of elements we have in M is 10, and the amount of elements we have in

The divisors of 10 are (excluding obvious ones): 2 and 5.
Therefore your proper subgroups will contain either 2 or 5 elements.
An easy way to check whether this will happen to your pick of number, say

Here,



Picking 10 gives


Anyway, how to do what you need to do should be explained in your theory as the method may be different.
(?) The identity element may be used as a proper subgroup, but it is trivial. Best to check with your exam board to see if you need to mention this as a group or not.
1
reply
(Original post by RDKGames)
Not my strong place but seeing as nobody has come to help, here's something:
The two most basic subgroups of any group are: the group itself, and the group containing only its identity element (?).
Every other subgroup is considered to be proper.
To find all the proper subsets, you can pick out elements one by one out of
, so say you pick
, then generate the following group:
(modulo 11), or putting it in order,
and note that we can discard higher powers because on modulo 11 they just revent back to what we have right now, hence we do not gain any new elements. Hence this is one of the proper subgroups under the same operation.
Also note that for something like
you will get that it is the exact same group as
(check!), hence you won't get any proper subgroups from it. We would here call
a generator of
.
Also note that the amount of elements in a subgroup must divide the number of elements in the main group. I.e. the amount of elements we have in M is 10, and the amount of elements we have in
is 5. So this is satisfied.
The divisors of 10 are (excluding obvious ones): 2 and 5.
Therefore your proper subgroups will contain either 2 or 5 elements.
An easy way to check whether this will happen to your pick of number, say
, and is to raise it to the power of 2 or 5. If the result is 1 (mod 11), then this element will give you a proper subgroup.
Here,
and
therefore you do not need to cover
.
Picking 10 gives
so this will definitely give you a proper subgroup. Indeed, we have that 
Anyway, how to do what you need to do should be explained in your theory as the method may be different.
(?) The identity element may be used as a proper subgroup, but it is trivial. Best to check with your exam board to see if you need to mention this as a group or not.
Not my strong place but seeing as nobody has come to help, here's something:
The two most basic subgroups of any group are: the group itself, and the group containing only its identity element (?).
Every other subgroup is considered to be proper.
To find all the proper subsets, you can pick out elements one by one out of




Also note that for something like




Also note that the amount of elements in a subgroup must divide the number of elements in the main group. I.e. the amount of elements we have in M is 10, and the amount of elements we have in

The divisors of 10 are (excluding obvious ones): 2 and 5.
Therefore your proper subgroups will contain either 2 or 5 elements.
An easy way to check whether this will happen to your pick of number, say

Here,



Picking 10 gives


Anyway, how to do what you need to do should be explained in your theory as the method may be different.
(?) The identity element may be used as a proper subgroup, but it is trivial. Best to check with your exam board to see if you need to mention this as a group or not.

0
reply
X
Page 1 of 1
Skip to page:
Quick Reply
Back
to top
to top