Cyclic number (group theory)¶

A positive integer n such that every group of order n is cyclic, equivalently n is coprime to Euler's totient phi(n).

Version: v2 · 2026-09-19 · History
Domain-specific #: 4012
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Finite Group Theory and Number Theory → Mathematics

Core Idea¶

Cyclic numbers are square-free and satisfy a prime-divisibility criterion preventing any prime factor of n from dividing another factor minus one. Prime factorization controls the possible Sylow actions and semidirect products; the coprimality condition removes noncyclic extensions, forcing every group of that order to be cyclic. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of finite group theory and number theory. It is the domain-specific identity determined by the integer is positive, Euler-totient and group-order conventions are explicit, gcd(n,phi(n)) equals one, and the equivalent square-free prime-divisibility conditions and all-groups conclusion are stated.

How would you explain it like I'm…

Only-One-Way Sizes

In math, a group is a set of moves you can combine and undo. For some sizes, every group of that size turns out to be just one move repeated in a loop, with no other way to build it. Those special sizes are called cyclic numbers.

Sizes That Force a Loop

A group is a set of moves that can be combined, like turns and flips. The simplest groups are cyclic: one move repeated over and over gives every other move, like the hands of a clock. For most sizes, you can build both cyclic groups and more tangled ones. But for some sizes, no matter how you try, every group of that size turns out to be cyclic. Those sizes are called cyclic numbers, and you can spot them by a rule about their prime factors: no prime factor can be repeated, and no prime factor can divide one less than another prime factor.

Orders With Only Cyclic Groups

In group theory, a positive integer n is a cyclic number if every group of order n is cyclic. There's a clean test: n must be square-free (no prime appears twice in its factorization), and no prime factor p of n can divide q − 1 for another prime factor q. Equivalently, n and φ(n), Euler's totient, share no common factor: gcd(n, φ(n)) = 1. For example, 15 = 3 × 5 qualifies, since 3 does not divide 4 and 5 does not divide 2, so every group of order 15 is cyclic. But 6 = 2 × 3 fails because 2 divides 3 − 1, and indeed the symmetries of a triangle form a noncyclic group of order 6. The condition works because it rules out every way of building a noncyclic group from the pieces the prime factors allow.

A positive integer n is a cyclic number (in the group-theoretic sense) if every group of order n is cyclic. The characterization is that gcd(n, φ(n)) = 1, where φ is Euler's totient function. Equivalently, n is square-free and, for any two prime factors p and q of n, p does not divide q − 1. The reason is structural: the prime factorization of n controls which Sylow subgroups and which actions between them are possible, and hence which semidirect products exist. Square-freeness rules out noncyclic groups like ℤ/p × ℤ/p, and the divisibility condition rules out nontrivial actions of one Sylow subgroup on another, so no noncyclic extension of order n can be built. For example, n = 15 is cyclic, while n = 6 is not, because 2 divides 3 − 1 and the symmetric group S3 exists. Care is needed not to confuse this notion with the digit-rotation 'cyclic numbers' of number theory.

Scope of Application¶

Cyclic number (group theory) belongs to finite group theory and number theory and is useful where the analyst can specify the typed finite group theory and number theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the integer is positive, Euler-totient and group-order conventions are explicit, gcd(n,phi(n)) equals one, and the equivalent square-free prime-divisibility conditions and all-groups conclusion are stated. The scope is broad within that domain but bounded by the need for the integer is positive, Euler-totient and group-order conventions are explicit, gcd(n,phi(n)) equals one, and the equivalent square-free prime-divisibility conditions and all-groups conclusion are stated.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the integer is positive, Euler-totient and group-order conventions are explicit, gcd(n,phi(n)) equals one, and the equivalent square-free prime-divisibility conditions and all-groups conclusion are stated the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Cyclic number (group theory). Cyclic number (group theory) compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed finite group theory and number theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the integer is positive, Euler-totient and group-order conventions are explicit, gcd(n,phi(n)) equals one, and the equivalent square-free prime-divisibility conditions and all-groups conclusion are stated independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of finite group theory and number theory because they reuse the typed finite group theory and number theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Prime factorization controls the possible Sylow actions and semidirect products; the coprimality condition removes noncyclic extensions, forcing every group of that order to be cyclic., and type the carrier, state every parameter and convention in the definition, test that the integer is positive, Euler-totient and group-order conventions are explicit, gcd(n,phi(n)) equals one, and the equivalent square-free prime-divisibility conditions and all-groups conclusion are stated, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Cyclic number (group theory) Domain-specific

Parents (1) — outgoing typed relations

Cyclic number (group theory) is a kind of Classification Prime

What makes it its own entry: the domain-specific identity determined by the integer is positive, Euler-totient and group-order conventions are explicit, gcd(n,phi(n)) equals one, and the equivalent square-free prime-divisibility conditions and all-groups conclusion are stated.

Hierarchy path (1) — routes to 1 parentless root

Cyclic number (group theory) → is a kind of Classification

Neighborhood in Abstraction Space¶

Cyclic number (group theory) sits in a crowded region of the domain-specific corpus (9^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Integer Classifications & Arithmetic Functions (45 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25