The collection G of all integers in [ 1 , 4 0 3 6 ] that are coprime to 4 0 3 6 form a group under multiplication modulo 4 0 3 6 . As an example, the product of 7 and 1 0 0 7 in G is 3 0 1 3 , since 7 × 1 0 0 7 ≡ 3 0 1 3 ( m o d 4 0 3 6 ) .
How many subgroups does G have?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
That tensor product on the first line of your solution is probably a typo, no?
Is there a formula for the number of subgroups of C 2 × G based on the number of subgroups of G , where G is an abelian group?
Log in to reply
I'm not sure that there is a formula. There is Goursat's Theorem, which says there is a 1-1 correspondence between subgroups of the direct product G 1 × G 2 and triples ( G 1 / N 1 , G 2 / N 2 , φ ) , where G 1 / N 1 and G 2 / N 2 are quotient groups and φ : G 1 / N 1 → G 2 / N 2 is an isomorphism.
I didn't know the definition of subgroup. But I have another solution in more familiar way. I found that a subgroup H can contain either only three terms { 1 , a , b } or H = G .
The three termed group easily makes the sense that a × b = 1 ( m o d 4 0 3 6 ) .
And a × b = 1 ( m o d 4 0 3 6 ) for 0 < a , b < 4 0 3 6 for a , b co-prime to 4 0 3 6 in 1 0 0 7 ways and 1 more way for H = G . So, total 1 0 0 8 ways. I have got this using Python.
There is total 2 0 1 5 C 2 = 2 0 2 9 1 0 5 ways to make that three termed group. And 2 0 2 9 1 0 5 1 0 0 7 = 2 0 1 5 1 . Exactly the ratio of that number and number of total residues. For modulo 3 the ratio comes 2 0 1 5 × 2 0 1 4 1 0 0 9 × 2 .
If I am doing mistake somewhere please help in recognizing that.
Log in to reply
Since the group is isomorphic to C 2 × C 1 0 0 8 , it has a subgroup of order 2 and a subgroup of order 1 0 0 8 . You seem to be saying that the only subgroups of G either are equal to G or else have order 3 , which is false. For that matter, { 1 } is a subgroup of order 1 , which is another group your thinking misses.
You are saying that the subgroup H has three elements, if it is not equal to G . This would mean that H was cyclic of order 3 , and hence that there was an element x ∈ H of order 3 , so that H = { 1 , x , x 2 } . There is only one such group, namely { 1 , 3 4 0 1 , 3 6 6 1 } .
Oh. I didn't know that the a × a multiplication was also included. Thank you sir.
Problem Loading...
Note Loading...
Set Loading...
Since 4 0 3 6 = 2 2 × 1 0 0 9 , the ring Z 4 0 3 6 is isomorphic to the direct product of rings Z 4 × Z 1 0 0 9 , and hence the group of units G = Z 4 0 3 6 × is isomorphic to the direct product of cyclic groups Z 4 × × Z 1 0 0 9 × ≡ C 2 × C 1 0 0 8 Let us determine the number of subgroups of C 2 × C N . Suppose that C 2 is generated by a . Let f : C 2 × C N → C N be the projection homomorphism. If H is a subgroup of C 2 × C N , then f ( H ) is a subgroup of C N , and so is cyclic, generated by some c ∈ C N . Let S = { x ∈ C 2 ∣ ( x , c ) ∈ H } . There are 3 cases to consider:
We deduce that C 2 × C N has two subgroups for each subgroup of C N of odd order, and three subgroups for each subgroup of C N of even order. Now C N contains one subgroup for each positive divisor of N . Thus if we write N = 2 u M where u ≥ 0 is an integer and M is an odd integer, then C 2 × C N possesses 3 σ 0 ( N ) − σ 0 ( M ) subgroups, where σ 0 ( n ) is the number of positive integer divisors of n .
Finally, since 1 0 0 8 = 2 4 × 3 2 × 7 we deduce that G = Z 4 0 3 6 × has 3 × σ 0 ( 1 0 0 8 ) − σ 0 ( 6 3 ) = 3 ( 5 × 3 × 2 ) − ( 3 × 2 ) = 8 4 subgroups.