Finite Field Notes: Difference between revisions
Jump to navigation
Jump to search
Adamcolton (talk | contribs) Created page with "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 <e; k <e; n and gcd(n,k) == 1. For any prim..." |
Adamcolton (talk | contribs) No edit summary |
||
| Line 1: | Line 1: | ||
I learned all this for cyclic keys, then I forgot it. This time I'm taking notes | 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 <e; k <e; n and gcd(n,k) == 1. For any prime, φ(p) = p-1. | The number of values k for which 1 <e; k <e; n and gcd(n,k) == 1. For any prime, φ(p) = p-1. | ||
Revision as of 04:25, 17 January 2016
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 <e; k <e; n and gcd(n,k) == 1. For any prime, φ(p) = p-1.