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 (0)

There are currently no matching articles.
See all articles in the same topic Create my own version