MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $G$ be a simple group of order $p^{2}-1$ where $p$ is Mersenne prime.

I am looking for a contradiction when $p\mid |Aut(G)|$. Does anyone knows how we can get a contradiction? Thanks.

share|cite|improve this question
Johannas ( asks (in a now-deleted answer): Contradiction to what? That $G$ is simple? $$ $$ Rashed answers: Yes Contradiction to $G$ is simple. – Anton Geraschenko Jul 28 '12 at 20:13
up vote 6 down vote accepted

Yes, if you mean contradiction to the simplicity of $G.$ Let $P$ be a Sylow $p$-subgroup of ${\rm Aut}(G).$ Let $Q$ be a $P$-invariant Sylow $q$-subgroup of $G$ where $q$ is an odd prime divisor of $p-1$ (there is one such as the number of Sylow $q$-subroups of $G$ is certainly not divisible by $p,$ while $P$ permutes them, so fixes at least one). $P$ permutes the non-identity elements of $Q$ by conjugation (thinking of $P$ as a subgroup of the semidirect product $GP).$ Since there are certainly fewer than $p$ such elements, each orbit must be of length $1$. In other words, $[P,Q] =1$ in the semidirect product. Let $R$ be a $P$-invariant Sylow $2$-subgroup of $G.$ Since $p+1$ is a power of $2$ and $q$ was an arbitrary odd prime divisor of $p-1,$ we have $G = RC_{G}(P).$ Hence $[G,P] = [R,P] \leq R. $ But $[G,P] \lhd G.$ If $P \neq 1,$ then we have $[G,P] \neq 1.$ Since $G$ is simple, $[G,P] = G \leq R.$ But then $G$ is a $2$-group and $|G| = 2,$ which is not the case.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.