What is the order of a group element?

It's the smallest positive integer k such that combining the element with itself k times (via the group's operation) produces the identity element — 0 for additive groups, 1 for multiplicative groups.

How is the order computed in (ℤₙ, +)?

It has a direct closed-form formula: the order of a is n / gcd(a, n), derived from how many times you need to add a to itself before the sum is a multiple of n.

How is the order computed in (ℤ/nℤ)ˣ?

There's no simple closed-form formula, so this calculator computes it directly: repeatedly multiply a by itself modulo n and count the steps until the result returns to 1.

What is (ℤ/nℤ)ˣ?

It's the multiplicative group of units modulo n — the set of integers from 1 to n−1 that are coprime to n (and therefore have a multiplicative inverse), under multiplication mod n.

What is Lagrange's theorem?

It states that the order of any subgroup (and, as a special case, any element) of a finite group must evenly divide the order of the whole group — this calculator explicitly checks and displays that division as a built-in sanity check.

What happens if a isn't coprime to n in the multiplicative group?

Then a isn't actually an element of (ℤ/nℤ)ˣ at all (it has no multiplicative inverse), so it has no well-defined multiplicative order, and this calculator reports that directly instead of a misleading number.

How large an n can this calculator handle?

This calculator supports n up to 10,000, keeping both the additive gcd-based formula and the multiplicative repeated-multiplication search instant.

Where is element order used in real life?

It's central to cryptography (the discrete logarithm problem, Diffie-Hellman key exchange, and RSA all depend on multiplicative orders), primality testing algorithms, and the structure theory of finite groups in abstract algebra.

Group Theory Order Calculator — Find an Element's Order

Our Group Theory Order Calculator finds the order of an element a — the smallest positive number of times you must combine it with itself to reach the identity — in either the additive group (ℤₙ, +) or the multiplicative group of units (ℤ/nℤ)ˣ, and verifies Lagrange's theorem by confirming the element's order divides the group's order.

Quick Answer

Choose a group and enter n and a to instantly find the element's order, with a Lagrange's theorem divisibility check shown.

Group

How to Use the Group Theory Order Calculator — Element Order in ℤₙ Online

1
Choose the group: (ℤₙ, +) or the multiplicative group (ℤ/nℤ)ˣ.
2
Enter n and the element a whose order you want to find.
3
Click 'Calculate' to see the element's order and the Lagrange's theorem check.

Why Use Group Theory Order Calculator — Element Order in ℤₙ Online?

The order of a group element is the smallest positive k such that combining the element with itself k times (adding it k times, or raising it to the kth power) returns the group's identity. In the additive group (ℤₙ, +), this has a clean closed form: the order of a is n / gcd(a, n). In the multiplicative group of units (ℤ/nℤ)ˣ — which only contains elements coprime to n — there's no simple formula, so this calculator finds it directly by repeated multiplication until reaching 1. Either way, Lagrange's theorem guarantees the element's order always evenly divides the group's total order (n for the additive group, or φ(n) for the multiplicative group), and this calculator shows that division explicitly as a built-in consistency check.

Frequently Asked Questions

Related Tools

Ring and Field Calculator — Modular Arithmetic in ℤₙ Online

Perform +, −, ×, ÷ in ℤₙ (integers mod n), see whether ℤₙ is a field or just a ring, and list its units and zero divisors. Free calculator, instant results.

Euler's Totient Function Calculator — φ(n) Online

Calculate Euler's totient function φ(n) — the count of integers from 1 to n coprime to n — via prime factorization. Free calculator showing the full factorization.

Primitive Root Calculator — Find a Generator mod n

Find the smallest primitive root modulo n — a generator of the multiplicative group mod n — with existence checking via Euler's totient function. Free calculator.