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 >
Mathematica > Mathematics and Algorithms > Mathematical Functions > Integer Functions > Combinatorial Functions >

FiniteAbelianGroupCount

FiniteAbelianGroupCount[n]
gives the number of finite abelian groups of order n.
  • Integer mathematical function, suitable for both symbolic and numerical manipulation.
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 number 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