Counting By Order of Elements
Suppose G is a finite group of order n, and d is a divisor of n. The number of elements in G of order d is a multiple of φ(d), where φ is Euler's totient function, giving the number of positive integers no larger than d and coprime to it. For example in the case of S3, φ(3) = 2, and we have exactly two elements of order 3. The theorem provides no useful information about elements of order 2, because φ(2) = 1, and is only of limited utility for composite d such as d=6, since φ(6)=2, and there are zero elements of order 6 in S3.
Read more about this topic: Order (group Theory)
Famous quotes containing the words counting, order and/or elements:
“What we commonly call man, the eating, drinking, planting, counting man, does not, as we know him, represent himself, but misrepresents himself. Him we do not respect, but the soul, whose organ he is, would he let it appear through his action, would make our knees bend.”
—Ralph Waldo Emerson (1803–1882)
“All grandeur, all power, all subordination to authority rests on the executioner: he is the horror and the bond of human association. Remove this incomprehensible agent from the world and at that very moment order gives way to chaos, thrones topple and society disappears.”
—Joseph De Maistre (1753–1821)
“Nature confounds her summer distinctions at this season. The heavens seem to be nearer the earth. The elements are less reserved and distinct. Water turns to ice, rain to snow. The day is but a Scandinavian night. The winter is an arctic summer.”
—Henry David Thoreau (1817–1862)