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)
“They ought to put out the eyes of painters as they do goldfinches in order that they can sing better.”
—Pablo Picasso (1881–1973)
“There surely is a being who presides over the universe; and who, with infinite wisdom and power, has reduced the jarring elements into just order and proportion. Let speculative reasoners dispute, how far this beneficent being extends his care, and whether he prolongs our existence beyond the grave, in order to bestow on virtue its just reward, and render it fully triumphant.”
—David Hume (1711–1776)