gives the number of finite Abelian groups of order n.
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 all close allBasic Examples (2)
Scope (2)
FiniteAbelianGroupCount[2 ^ 500]FiniteAbelianGroupCount threads element-wise over lists:
FiniteAbelianGroupCount[{2, 4, 6}]Applications (2)
Number of non-Abelian groups of order n:
Table[FiniteGroupCount[n] - FiniteAbelianGroupCount[n], {n, 20}]Compare cumulative counts of even and odd numbers of Abelian groups:
ListPlot[Accumulate[Table[Mod[FiniteAbelianGroupCount[k], 2], {k, 1000}]] / Range[1000]]Properties & Relations (6)
FiniteAbelianGroupCount[n] gives the number of Abelian groups of order n:
FiniteAbelianGroupCount[24]FiniteGroupCount[n] gives the number of groups of order n, both Abelian and non-Abelian:
FiniteGroupCount[24]For low orders, FiniteGroupData lists explicit representative Abelian groups of a given order:
FiniteAbelianGroupCount[24]ab24 = FiniteGroupData[24, "Abelian"]FiniteGroupData[#, "Order"]& /@ ab24Construct permutation group representations of those groups:
FiniteGroupData[#, "PermutationGroupRepresentation"]& /@ ab24GroupOrder /@ %The number of finite Abelian groups can be found using PartitionsP:
Times@@PartitionsP[Last /@ FactorInteger[45]]FiniteAbelianGroupCount[45]FiniteAbelianGroupCount[n] depends only on prime exponents of n:
FiniteAbelianGroupCount /@ {2 ^ 21, 3 ^ 21, 7 ^ 21, 11 ^ 21}FiniteAbelianGroupCount is a multiplicative function:
FiniteAbelianGroupCount[3 ^ 2 7 ^ 3]FiniteAbelianGroupCount[3 ^ 2] FiniteAbelianGroupCount[7 ^ 3]FindSequenceFunction can recognize the FiniteAbelianGroupCount sequence:
Table[FiniteAbelianGroupCount[n], {n, 10}]FindSequenceFunction[%, n]Possible Issues (1)
FiniteAbelianGroupCount evaluates only for explicit integer values:
FiniteAbelianGroupCount[12 + (E + 1) ^ 2 - Expand[(E + 1) ^ 2]]Use Simplify to find implicit integers in arguments:
Simplify[%]Neat Examples (1)
Successive differences of FiniteAbelianGroupCount modulo 2:
ArrayPlot[Mod[NestList[Differences, FiniteAbelianGroupCount[Range[100]], 100], 2]]Related Guides
Related Links
History
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
BibTeX
@misc{reference.wolfram_2026_finiteabeliangroupcount, author="Wolfram Research", title="{FiniteAbelianGroupCount}", year="2008", howpublished="\url{https://reference.wolfram.com/language/ref/FiniteAbelianGroupCount.html}", note=[Accessed: 13-June-2026]}
BibLaTeX
@online{reference.wolfram_2026_finiteabeliangroupcount, organization={Wolfram Research}, title={FiniteAbelianGroupCount}, year={2008}, url={https://reference.wolfram.com/language/ref/FiniteAbelianGroupCount.html}, note=[Accessed: 13-June-2026]}