Congruence condition on Sylow numbers

From Groupprops

This article gives the statement, and possibly proof, of a constraint on numerical invariants that can be associated with a finite group

This article describes a congruence condition on an enumeration, or a count. It says that in a finite group and modulo prime number, the number of Sylow subgroups, i.e., the number of subgroups of prime power order whose index is relatively prime to the order satisfies a congruence condition.
View other congruence conditions | View divisor relations

Statement

Let be a finite group and a prime. Let be the -Sylow number of , i.e., the number of -Sylow subgroups of . Then:

.

Since all the -Sylow subgroups are conjugate, equals the index of any -Sylow subgroup. Thus, this is equivalent to the following: if is a -Sylow subgroup:

.

Related facts

Other parts of Sylow's theorem

.

This fact is often used along with the congruence condition on Sylow numbers.

Generalizations

Converse

A converse of sorts might be: whenever is a natural number such that , there exists a finite group such that , i.e., is the number of -Sylow subgroups of .

This is false. However, some partial converses are true:

Applications

Proof

This proof assumes that we already know that there exist -Sylow subgroups of .