FiniteAbelianGroupCount
gives the number of finite Abelian groups of order n.
Details
- Integer mathematical function, suitable for both symbolic and numerical manipulation.
- FiniteAbelianGroupCount automatically threads over lists.
Examples
open allclose allScope (2)
Applications (2)
Properties & Relations (6)
FiniteAbelianGroupCount[n] gives the number of Abelian groups of order n:
FiniteGroupCount[n] gives the number of groups of order n, both Abelian and non-Abelian:
For low orders, FiniteGroupData lists explicit representative Abelian groups of a given order:
Construct permutation group representations of those 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:
FindSequenceFunction can recognize the FiniteAbelianGroupCount sequence:
Possible Issues (1)
FiniteAbelianGroupCount evaluates only for explicit integer values:
Use Simplify to find implicit integers in arguments:
Neat Examples (1)
Successive differences of FiniteAbelianGroupCount modulo 2:
Text
Wolfram Research (2008), FiniteAbelianGroupCount, Wolfram Language function, https://reference.wolfram.com/language/ref/FiniteAbelianGroupCount.html.
CMS
Wolfram Language. 2008. "FiniteAbelianGroupCount." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/FiniteAbelianGroupCount.html.
APA
Wolfram Language. (2008). FiniteAbelianGroupCount. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/FiniteAbelianGroupCount.html