- #1

hmw

- 2

- 0

## Homework Statement

Determine all integers for which there exists a unique abelian group of order n.

## Homework Equations

## The Attempt at a Solution

All prime integers?

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter hmw
- Start date

- #1

hmw

- 2

- 0

Determine all integers for which there exists a unique abelian group of order n.

All prime integers?

- #2

Dick

Science Advisor

Homework Helper

- 26,263

- 621

Shouldn't you prove it?

- #3

The Chaz

- 206

- 0

This holds trivially for prime numbers.

Claim: For n "square-free", [tex]\mathbb{Z}_n[/tex] is (up to isomorphism) the unique abelian group of order n.

We extend the fact that [tex] \mathbb{Z}_{ab} \cong \mathbb{Z}_a \times \mathbb{Z}_b \Leftrightarrow gcd(a, b) = 1[/tex] by induction to an arbitrary amount of factors. Then the factors (which are also the subscripts of Z, and the orders of the groups) are pairwise coprime, and we have our result.

Thoughts?

Share:

- Replies
- 38

- Views
- 4K

- Replies
- 3

- Views
- 1K

- Last Post

- Replies
- 4

- Views
- 427

- Replies
- 6

- Views
- 489

- Last Post

- Replies
- 16

- Views
- 2K

- Replies
- 4

- Views
- 534

- Replies
- 4

- Views
- 1K

- Replies
- 6

- Views
- 304

- Replies
- 3

- Views
- 701

- Replies
- 5

- Views
- 253