How this calculation works
Choose addition modulo n, multiplication of the units modulo n, polygon symmetries or a custom finite table. Every product is checked, including associativity for all triples. The result lists identity, inverses, element orders and whether the group is commutative or cyclic.
Table[a,b] = a ⋆ b; (a ⋆ b) ⋆ c = a ⋆ (b ⋆ c)A worked example
Addition modulo 4 has order 4, identity 0, inverses 0, 3, 2, 1 and element orders 1, 4, 2, 4. It is cyclic and commutative.
Good to know
Finite exact operations only, with at most 24 elements. Custom tables must supply every product and pass all group axioms. For dihedral groups n means polygon sides and the order is 2n; for modular models n is the modulus. This does not infer an abstract group from an arbitrary symbolic presentation.
Reference: Judson: Abstract Algebra, groups, permutations and cosets (opens in a new tab) ↗
A table records the operation, not just the elements
Addition modulo 4 and multiplication of the units modulo 8 both produce four-element groups, but their element orders differ. In the first, adding 1 repeatedly visits every element. In the second, every nonidentity element squares to the identity. Equal group sizes therefore do not establish that two groups have the same structure.
Try the cyclic model with n = 4, then the units model with n = 8. Compare the listed orders and the cyclic result. The modulus is not always the number of elements: units modulo 8 are only 1, 3, 5 and 7 because the other residues are not coprime to 8.
A row is the left factor and a column is the right factor. For addition this distinction is easy to overlook because the table is symmetric. Polygon symmetries provide a useful counterexample: a reflection followed by a rotation can differ from the reverse composition.
Cosets organize a validated group relative to a chosen subgroup. Inspecting the operation table first makes the products used in those sets explicit.
Check every axiom before calling it a group
In a custom table, list the elements in the same order for the rows and columns and enter products without headers. The labels are treated as exact symbols. Renaming a label consistently changes the notation, not the underlying operation.
Closure means every product stays in the listed set. Associativity compares both bracketings of every triple. A two-sided identity must leave every element unchanged, and each element needs a two-sided inverse. A table can have one of each symbol in every row and column yet still fail associativity.
The dihedral option labels a symmetry r^i s^e, with r a single rotation and s a reflection. The calculator uses s r = r⁻¹ s and Dₙ has 2n elements. Some textbooks instead put the total order in the subscript; check that convention when comparing answers. These are formal group operations, not measurements of an irregular physical polygon.
A few questions, answered
Why does the units model leave out some residues?
Multiplication modulo n has inverses precisely for residues coprime to n. Including a nonunit can destroy the inverse requirement. For n = 8, the unit residues are 1, 3, 5 and 7.
Is a symmetric operation table enough to prove a group?
Symmetry shows commutativity of the entered operation. It does not establish associativity, an identity or inverses. All group checks must still pass.
Does a failed custom table mean no group exists on these labels?
No. It means the particular products entered fail a group requirement. A different operation on the same set could be a valid group.