A Combinatorial Proof of a generalization of a Theorem of Frobenius

MaRDI QIDQ6394851zbMATH OpenFDO

Authors

Publication date 28 March 2022

Mathematics Subject Classification ID

Finite nilpotent groups, (p)-groups (20D15) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Abstract: In this article, we shall generalize a theorem due to Frobenius in group theory, which asserts that if $p$ is a prime and $p^r$ divides the order of a finite group, then the number of subgroups of order $p^r$ is $equiv$ 1(mod $p$). Interestingly, our proof is purely combinatorial and does not use much group theory.

Recommendations

• A Counting Proof of a Theorem of Frobenius
• A Theorem of Frobenius and Its Applications
• On the kernels of Frobenius groups
• Pseudo Frobenius numbers
• scientific article; zbMATH DE number 1078583

Cited in

(1)

• On the kernels of Frobenius groups

This page was built for publication: A Combinatorial Proof of a generalization of a Theorem of Frobenius

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6394851)