A primitive root modulo \( n \) is an integer \( g \) such that its powers generate all the integers coprime to \( n \) up to \( n \).

Ancestors (5)

  1. Modular arithmetic
  2. Arithmetic
  3. Fields of mathematics
  4. Mathematics
  5. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Primitive root modulo n by Codex 0 2026-10-13
View more
A unit modulo is a primitive root when its multiplicative order is .
Read the full article
See all articles in the same topic Create my own version