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)
“Dule and wae for the order sent our lads to the Border;
The English, for ance, by guile won the day:
The Flowers of the Forest, that foucht aye the foremost,
The prime o’ our land, are cauld in the clay.”
—Jean Elliot (1727–1805)
“psychologist
It is through friendships that teenagers learn to take responsibility, provide support, and give their loyalty to non- family members. It is also in teenage friendships that young people find confidants with whom to share thoughts and feelings that they are not comfortable sharing with their parents. Such sharing becomes one of the elements of true intimacy, which will be established later.”
—David Elkind (20th century)