Skip to main content
added 1 character in body
Source Link

Let $G$ be a nonabelian finite simple group, and let $p$ and $q$ be distinct prime divisors of the order of $G$. Is it true that the number of elements of $G$ of order $p$ never equals the number of elements of $G$ of order $q$?

Remark: My husband ran a GAP computation checking all nonabelian finite simple groups of order less than 30000000400000000, and did not find a counterexample.

Let $G$ be a nonabelian finite simple group, and let $p$ and $q$ be distinct prime divisors of the order of $G$. Is it true that the number of elements of $G$ of order $p$ never equals the number of elements of $G$ of order $q$?

Remark: My husband ran a GAP computation checking all nonabelian finite simple groups of order less than 30000000, and did not find a counterexample.

Let $G$ be a nonabelian finite simple group, and let $p$ and $q$ be distinct prime divisors of the order of $G$. Is it true that the number of elements of $G$ of order $p$ never equals the number of elements of $G$ of order $q$?

Remark: My husband ran a GAP computation checking all nonabelian finite simple groups of order less than 400000000, and did not find a counterexample.

Became Hot Network Question
Source Link

Finite simple groups with the same numbers of elements of orders p and q

Let $G$ be a nonabelian finite simple group, and let $p$ and $q$ be distinct prime divisors of the order of $G$. Is it true that the number of elements of $G$ of order $p$ never equals the number of elements of $G$ of order $q$?

Remark: My husband ran a GAP computation checking all nonabelian finite simple groups of order less than 30000000, and did not find a counterexample.