Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-16
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.

A modulus with primitive roots has exactly φ(φ(n)) primitive roots

Statement

If n1 admits a primitive root, then it has exactly φ(φ(n)) primitive roots.

Facts & Assumptions

Given: A positive modulus n admitting a primitive root.

[L1]

Primitive roots are exactly generators of the unit group (A unit is a primitive root modulo n if and only if it generates (Z/nZ)×).

Proof

technique · direct
1.1

By the Given and [L1], the unit group is cyclic of order φ(n), and its generators are exactly the primitive roots.

givenL1
2.1

Applying [L2] with m=φ(n) yields φ(φ(n)) primitive roots. At n=1 this is φ(1)=1, counting the unique class.

step 1.1L2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 45 results over 10 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources