The Number of Subgroups and Cyclic Subgroups of Finite Group and Its Application by GAP Program
Abstract
In this paper, we present a novel approach for calculating the set of subgroups of a finite group, focusing on cyclic subgroups, and using it to establish the quantity of all subgroups in the direct product of two groups. Specifically, we consider the Dicyclic group of order \(4n\) and the Cyclic group of order \(p\). Let \(τ(n)\) denote the total number of divisors of \(n\), and \(σ(n)\) denote the summation of all divisors of \(n\). Using these functions, we derive a formula for the number of subgroups in the group \(T4n × Cp\). We then use the computer program GAP to find all \(T4n × Cp\) with exactly \(|T4n × Cp| - t\) cyclic subgroups for \(t ≥ 1\).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.