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)
“In order to get to East Russet you take the Vermont Central as far as Twitchell’s Falls and change there for Torpid River Junction, where a spur line takes you right into Gormley. At Gormley you are met by a buckboard which takes you back to Torpid River Junction again.”
—Robert Benchley (1889–1945)
“Kitsch is the daily art of our time, as the vase or the hymn was for earlier generations. For the sensibility it has that arbitrariness and importance which works take on when they are no longer noticeable elements of the environment. In America kitsch is Nature. The Rocky Mountains have resembled fake art for a century.”
—Harold Rosenberg (1906–1978)