MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How many different non-isomorphic Abelian groups of order n are possible ??

share|cite|improve this question

closed as too localized by Alex Bartel, Qiaochu Yuan, Pete L. Clark, David Hansen, HJRW Feb 10 '11 at 17:22

This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.

As many as you want. Just have a look at the structur theorem for finite abelian groups. Also this question is not appropriate for MO. You may want to pose this kind of questions at – Johannes Hahn Feb 10 '11 at 15:44
Ohk thanx for ur help.. – Mahesh Gupta Feb 10 '11 at 16:29

Depending on the interpretation of the question, I either somewhat agree or disagree with the commenter. In view of this, I would like to encourage the OP to (in the future) be more detailed when asking questions.

The question of determining the number of non-isomorphic finite abelian groups of order $n$ for a fixed $n$ is, assuming one is able to determine the factorization of $n$ into primes, not too complicated a task if one is aware of the structure theorem of finite abelian groups (STFA). The problem is via the STFA actually the problem of determining in how many ways one can factor $n$ as$n_1 \dots n_r$ with $1<n_1 \mid \dots n_r$ ; or possibly simpler first decomposing into prime powers / $p$-groups and only then carrying out this consideration. In any case, this translates to the problem in how many ways one can partition the multiplicties of the primes occuring in $n$. Or, explicitly, the number for $n$ is $\prod_{i=1}^k P(e_i)$ where $n=p_1^{e_1}\dots p_n^{e_k}$ is the factorization into primepowers and $P$ denotes the number of partitions.

In particular, on the one hand there cannot be an absolute bound (independent of $n$) on the number of isomorphy classes of finite ablian groups of a given order; on the other hand, there exists arbitrarily large $n$ where there is a unique equivalence class, namely precisely if $n$ is squarefree.

However, there is also the question of counting all isomorphy classes of finite abelian groups (up to a given order).

Let $A(x)$ denote the number of isomorphy classes of finite abelian groups of order at most $x$. The question of determining the asymptotic of $A(x)$ was first considered by Erd{\H o}s and Szekeres.

It is (at least) known that $A(x) = C_1 x + C_2 x^{1/2}+ C_3 x^{1/3} + \Delta(x)$ where $\Delta(x)= O(x^{55/219} (\log x)^7)$ and $C_i = \prod_{j=1, j\neq i}^{\infty} \zeta(j/i)$ and $\zeta$ is Riemann's zeta-function.

The 'at least' means that this is the best result I know (due to Sargos and Wu, 2000), but in view of the fact that the problem of improving estimates for $\Delta(x)$ was considered a lot it might well be the case that since 2000 there were further improvements I am unaware of.

share|cite|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.