Mathematica 9 is now available
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Mathematica > Mathematics and Algorithms > Discrete Mathematics > Combinatorial Functions > FiniteAbelianGroupCount >
Mathematica > Mathematics and Algorithms > Mathematical Functions > Integer Functions > Combinatorial Functions > FiniteAbelianGroupCount >

FiniteAbelianGroupCount

FiniteAbelianGroupCount[n]
gives the number of finite Abelian groups of order n.
  • Integer mathematical function, suitable for both symbolic and numerical manipulation.
Table of values:
Table of values:
In[1]:=
Click for copyable input
Out[1]=
 
In[1]:=
Click for copyable input
Out[1]=
Evaluate for large arguments:
FiniteAbelianGroupCount threads element-wise over lists:
Number of non-Abelian groups of order n:
Compare cumulative counts of even and odd numbers of Abelian groups:
The number of finite Abelian groups can be found using PartitionsP:
FiniteAbelianGroupCount[n] depends only on prime exponents of n:
FiniteAbelianGroupCount is a multiplicative function:
FiniteAbelianGroupCount evaluates only for explicit integer values:
Use Simplify to find implicit integers in arguments:
Successive differences of FiniteAbelianGroupCount modulo 2:
New in 7
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF