Completed
Number Theory | Primitive Roots modulo n: Definition and Examples
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Primitive Roots Modulo n
Automatically move to the next video in the Classroom when playback concludes
- 1 Number Theory | Order of an integer modulo n: Proposition 1
- 2 Number Theory | Primitive Roots modulo n: Definition and Examples
- 3 Number Theory | Order of an element modulo n Proposition 2
- 4 Number Theory | Order of a^k mod n
- 5 Number Theory | Number of Primitive Roots modulo n
- 6 Number Theory | All primitive roots modulo 22
- 7 Number Theory | Solutions of x^d-1 =0 mod p.
- 8 Number Theory | Integers of order d mod p
- 9 Number Theory | Products of primitive roots modulo p
- 10 Number Theory | If gcd(m,n)=1 there are no primitive roots modulo mn!!
- 11 Number Theory | Primitive roots modulo p -- Technical Lemma 1
- 12 Number Theory | Primitive roots modulo p -- Technical Lemma 2
- 13 Number Theory | There is a primitive root modulo every power of an odd prime!!
- 14 Number Theory | There is a primitive root modulo 2p^n!!
- 15 Number Theory | When are there primitive roots modulo n?
- 16 Number Theory | Primitive roots of 54
- 17 Number Theory | A primitive root for 2*5^n
- 18 Number Theory | Definition of the index with respect to a primitive root modulo n.
- 19 Number Theory | The discrete root -- Example 2
- 20 Number Theory | Existence of an mth root modulo n
- 21 Number Theory | Solving an exponential congruence with primitive roots: Example 1
- 22 Number Theory | Solving an exponential congruence using primitive roots: Example 2.
- 23 Number Theory | Existence of a solution to an exponential congruence-- Example
- 24 Primitive roots modulo n and the structure of U(n)
