Number Theory | Discrete Log Rules

We state and prove some properties for the discrete logarithm / index with respect to a primitive root r.

[paul]

Here is an addition to the list. The index of a number x with respect to a prim. root r I will write as I sub r (x).

5. I sub a (b) . I sub b (c) = I sub a (c) (mod phi(n))
where a and b are primitive roots mod n, assuming that n is s.t there exist at least two primitive roots mod n. It is of course analogous to the trick to change the base of logarithms.

[georgesadler]

Professor Penn, this is a solid explanation of Discrete Log Rules with respect to Number Theory primitive roots. I have to review these concepts for a deep understanding in Number Theory. These concepts continue to be theoretical.