Math 2.0

concept

Primitive root modulo n

Summary

A primitive root modulo nn is an integer whose powers give every residue class modulo nn that is coprime to nn. The definition of a primitive root modulo n gives the precise form.

What this node needs for W2
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Primitive_root_modulo_n, lead section

What links here

Definitions