If a prime number $p$ divide the number of elements of order $k$ (for some $k\neq p$) in a finite group $G$, then whether we can say that $p$ divide order of $G$?
Prime divisor in a finite group
1
$\begingroup$
finite-groups
-
0Try adding a bit more detail to this question. It seems that English might not be your first language, so don't be discouraged, but you'll get better answers if you say a bit about where you encountered this problem, what you've tried etc. – 2012-12-03
-
0@Simon Hayward: We know that the number of elements of order $k$ is equal to $\sum|cl_{G}(x_{i})|$ such that $|x_{i}|=k$. It is clear that if $p\mid|cl_{G}(x_{i})|$ , then $G$ has an element of order $p$. But when $p\mid\sum |cl_{G}(x_{i})|$, then this is a question that whether group $G$ has an element of order $p$? – 2012-12-03
1 Answers
2
No. Consider a group of prime order.
Addition: you can get some more insight into the problem by considering the 3rd Sylow theorem. Take for example a group $G$ of order $p_1p_2\ldots p_r$ where $p_k$ are pairwise different primes. Then the number of elements of order $p_k$ equals $n_k(p_k-1)$, where $n_k$ is the number of $p_k$-Sylow groups. The 3rd Sylow theorem yields that $n_k$ divides $|G|/p_k$. Hence your assertion holds for those primes dividing $n_k$.
The situation becomes more complicated if the primes $p_k$ occur with multiplicities in the group order. Then things depend strongly on the structure of the $p_k$-Sylow groups and their intersections.
-
0Thanks. If $G$ is not $p$-group, then how? – 2012-12-03
-
0@Mathematics123: there are groups for which your statement is true, and there are those for which it is false. – 2012-12-03
-
0@akkkk: Can you give me an example when it is false? – 2012-12-03
-
0@Mathematics123: uh... Hagen just did... – 2012-12-03