On the number of generating pairs for the groups and .
Theorem A yields the condition under which the number of solutions of equation in a finite -group is divisible by (here is a fixed positive integer). Theorem B which is due to Avinoam Mann generalizes the counting part of the Sylow Theorem. We show in Theorems C and D that congruences for the number of cyclic subgroups of order which are true for abelian groups hold for more general finite groups (for example for groups with abelian Sylow -subgroups).
In this paper as the main result, we determine finite groups with the same prime graph as the automorphism group of a sporadic simple group, except .
Let be a finite group. The prime graph of is a simple graph whose vertex set is and two distinct vertices and are joined by an edge if and only if has an element of order . A group is called -recognizable by prime graph if there exist exactly nonisomorphic groups satisfying the condition . A 1-recognizable group is usually called a recognizable group. In this problem, it was proved that is recognizable, if is an odd prime and is odd. But for even , only the recognizability...
We investigate the situation when the inner mapping group of a commutative loop is of order , where is a prime number, and we show that then the loop is solvable.