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 you’re counting my eyebrows, I can help you. There are two.”
—Billy Wilder (b. 1906)
“In order to really enjoy a dog, one doesn’t merely try to train him to be semihuman. The point of it is to open oneself to the possibility of becoming partly a dog.”
—Edward Hoagland (b. 1932)
“Icebergs behoove the soul
(both being self-made from elements least visible
to see them so; fleshed, fair, erected indivisible.”
—Elizabeth Bishop (1911–1979)