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:
“If all power is in the people, if there is no higher law than their will, and if by counting their votes, their will may be ascertained—then the people may entrust all their power to anyone, and the power of the pretender and the usurper is then legitimate. It is not to be challenged since it came originally from the sovereign people.”
—Walter Lippmann (1889–1974)
“In schools all over the world, little boys learn that their country is the greatest in the world, and the highest honor that could befall them would be to defend it heroically someday. The fact that empathy has traditionally been conditioned out of boys facilitates their obedience to leaders who order them to kill strangers.”
—Myriam Miedzian, U.S. author. Boys Will Be Boys, ch. 3 (1991)
“Our institutions have a potent digestion, and may in time convert and assimilate to good all elements thrown in, however originally alien.”
—Herman Melville (1819–1891)