Jump to content

algebra

Featured Replies

  • 4 weeks later...

I assume you're talking about the cyclic group [math]C_{60}=\{0,1,...,59\}[/math]. Then the generators are exactly the [math]a\in C_{60}[/math] with [math]gcd(a,60)=1[/math]. Thus there are

[math]\varphi(60)=\varphi(3)\varphi(4)\varphi(5)=2\cdot2\cdot4=16[/math] generators.

I assume you're talking about the cyclic group [math]C_{60}=\{0,1,...,59\}[/math]. Then the generators are exactly the [math]a\in C_{60}[/math] with [math]gcd(a,60)=1[/math]. Thus there are

[math]\varphi(60)=\varphi(3)\varphi(4)\varphi(5)=2\cdot2\cdot4=16[/math] generators.

 

That would be a reasonable assumption, since if a group is generated by any single element it is, by definition cyclic and there is, up to isomorphism, only one such group of a given order.

 

The alternative interpretation of the question would be to determine the elements in each minimal generating set for each group of order 60. This is a much more involved project as one would have to classify all finite groups of order 60 -- I suppose that Sylow theorems would be a good place to start. The project does not appeal to me.

Archived

This topic is now archived and is closed to further replies.

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.

Configure browser push notifications

Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.