CorollaryStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-26

How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The number of necklaces of length $n$ on an $m$ -letter alphabet is $\frac{1}{n} \sum_{d ∣ n} φ (d) m^{n / d}$

Statement

Let $m \geq 1$ and $n \geq 1$ . The number of necklaces of length $n$ on an $m$ -letter alphabet is

$\frac{1}{n} \sum_{d ∣ n} φ (d) m^{n / d} .$

Facts & Assumptions

Given: Naturals $m \geq 1$ and $n \geq 1$ , and the class $A : = m Z$ of $m$ coloured atoms.

[L1]

If a combinatorial class $A$ has no size-zero objects, then over a commutative $Q$ -algebra its cycle construction has generating function $OGF (CYC (A)) = \sum_{k \geq 1} \frac{φ (k)}{k} \log \frac{1}{1 - A (x^{k})}$ (Over a commutative $Q$ -algebra, $CYC (A)$ has generating function $\sum_{k \geq 1} \frac{φ (k)}{k} \log \frac{1}{1 - A (x^{k})}$ ).

Proof

technique · direct

1.1

The class $A$ has generating function $A (x) = m x$ . Its cycle class is exactly the class of coloured necklaces, with size equal to necklace length.

construct

1.2

For each $k \geq 1$ , one has $\log (1 / (1 - m x^{k})) = \sum_{j \geq 1} m^{j} x^{k j} / j$ , so the coefficient of $x^{n}$ in this series is $0$ unless $k ∣ n$ , and is $m^{n / k} / (n / k)$ when $k ∣ n$ .

algebra

2.1

Taking the coefficient of $x^{n}$ in [L1] and using steps 1.1 and 1.2 gives $[x^{n}] OGF (CYC (A)) = \sum_{k ∣ n} (φ (k) / k) \cdot (m^{n / k} / (n / k)) = (1 / n) \sum_{k ∣ n} φ (k) m^{n / k}$ . This coefficient is exactly the number of necklaces of length $n$ .

step 1.1step 1.2L1algebra∎

Depends on

Used by

Binary necklaces of length 6 from both CYC(2Z) and Burnside's lemma Example

Dependency tree · two levels

10 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

Philippe Flajolet and Robert Sedgewick, Analytic Combinatorics (standard reference, not scraped)
Stephen Melczer, An Invitation to Enumeration, Chapter 5: Combinatorial Constructions (standard reference, not scraped)

The number of necklaces of length nn on an mm-letter alphabet is 1n∑d∣nφ(d)mn/dn1​∑d∣n​φ(d)mn/d