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:
“Love is sinister,
is mean to us in separation;
makes our thin bodies thinner.
This fellow Death
lacks mercy
and is good at counting our days.
And Master,
you, too, are subject
to the plague of jealousy
so think:
how could womenfolk,
soft as sprouts,
live like this?”
—Amaru (c. seventh century A.D.)
“People press toward the light not in order to see better but in order to shine better.—We are happy to regard the one before whom we shine as light.”
—Friedrich Nietzsche (1844–1900)
“The two elements the traveler first captures in the big city are extrahuman architecture and furious rhythm. Geometry and anguish. At first glance, the rhythm may be confused with gaiety, but when you look more closely at the mechanism of social life and the painful slavery of both men and machines, you see that it is nothing but a kind of typical, empty anguish that makes even crime and gangs forgivable means of escape.”
—Federico García Lorca (1898–1936)