Prove a group is $p$-divisible for a prime $p$.

Mathematics Asked by Chris Christopherson on October 20, 2020

I am wondering how to prove that a finite $G$ with no elements of order $p$ for some prime $p$ implies that $G$ is $p$-divisible. I am a bit confused with how to approach this. It seems to be very related to Cauchy’s Theorem. A couple observations: A Group is $n$-divisible iff the automorphism $gto g^k$ is a surjection.

Maybe this helps?

One Answer

If there are no elements of order $p$, the order of the finite group $|G|$ is co-prime with $p$ (that is a corollary of Cauchy's theorem and the definition of prime numbers).

Take any $1ne ain G$. Then the order $|a|=m$ divides $|G|$ by Lagrange theorem, hence it is co-prime with $p$.

So for some integers $u,v$ we have $um+vp=1$. Hence $a=a^{um+vp}=a^{mu}(a^v)^p=(a^v)^p$. So $a$ has a root of degree $p$, namely $a^v$. So $G$ is $p$-divisible.

Correct answer by JCAA on October 20, 2020

Add your own answers!

Related Questions

Manifolds Definition

1  Asked on February 8, 2021


How many passwords possible?

3  Asked on February 8, 2021 by sagigever


Sets; is (A∩B)∪C the same as A∩(B∪C)?

1  Asked on February 8, 2021 by user839131


Graph theory: strong regular graph

1  Asked on February 7, 2021 by spencer-ireland


Find solution of this ODE

1  Asked on February 7, 2021 by ongky-denny-wijaya


Confused on proof questions about relations

0  Asked on February 7, 2021 by atlecx


Ask a Question

Get help from others!

© 2022 All rights reserved. Sites we Love: PCI Database, MenuIva, UKBizDB, Menu Kuliner, Sharing RPP