Finite Field Notes

From Adam Colton
Revision as of 04:26, 17 January 2016 by Adamcolton (talk | contribs)
Jump to navigation Jump to search

I learned all this for cyclic keys, then I forgot it. This time I'm taking notes

Totient

The number of values k for which 1 ≤ k ≤ n and gcd(n,k) == 1. For any prime, φ(p) = p-1.