List all cosets in Z24 of each of the given subgroups?

B asked 11 months ago (Tiebreaker) a. <[3]> b. <[16]> The back of the book says that a is [0]+<[3]> = {[0],[3],[6],[9],[12],[15],[18],[21]}, [1]+<[3]> = {[1],[4],[7],[10],[13],[16],[19],[22]}, and [2]+<[3]> = {[2],[5],[8],[11],[14],[17],[20],[23]} But I don't know how they got this answer... Any help would be great, I'm not getting a good grasp on this chapter. Vote for Best Answer Follow Watchlist

Other Answers (1)

Answerer #1 answered 11 months ago A coset is when you take a subgroup and you combine each element in that subgroup with a given element of the full group. For a non-abelian group, you have to specify whether it's a left or right coset, because it matters if you did he group operation on the left or the right. For brevity's sake, I'm going to drop he []'s. <3> = {0, 3, 6, 9, 12, 15, 18, 21}. The left coset of <3> with respect to 0 in Z24 is: 0 + <3> = {0 + 0, 0 + 3, 0 + 6, 0 + 9, 0 + 12, 0 + 15, 0 + 18, 0 + 21> = {0, 3, 6, 9, 12, 15, 18, 21}. So for a group G and a subgroup H, there are |G| different left cosets of H (which are identical to the right cosets for abelian groups). You just take an element of G and combine it with each element of H. These are not all necessarily distinct however. If x is a member of the left coset of H with respect to y, then the left coset of H with respect to x is going to be the exact same coset. That's why there's one 3 cosets listed above for <3>. All the members of Z24 are already exhausted, so the other cosets will just be copies of these three. In this way, cosets are said to "partition" the group, because they split it into a certain number of partitions of size |H|. (What does this say about how |G| and |H| relate?)

Let G= Z24 and H =<18 list the element of all the distinct right coset of H and G and construct the group table for the factor of