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:
“But counting up to two
Is harder to do....”
—Philip Larkin (1922–1986)
“Until the end of the Middle Ages, and in many cases afterwards too, in order to obtain initiation in a trade of any sort whatever—whether that of courtier, soldier, administrator, merchant or workman—a boy did not amass the knowledge necessary to ply that trade before entering it, but threw himself into it; he then acquired the necessary knowledge.”
—Philippe Ariés (20th century)
“The popularity of that baby-faced boy, who possessed not even the elements of a good actor, was a hallucination in the public mind, and a disgrace to our theatrical history.”
—Thomas Campbell (1777–1844)