Finite Field Notes: Difference between revisions

Revision as of 04:26, 17 January 2016

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

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

Revision as of 04:25, 17 January 2016 view source Adamcolton (talk \| contribs) Bureaucrats, Interface administrators, Administrators 4 edits No edit summary ← Older edit		Revision as of 04:26, 17 January 2016 view source Adamcolton (talk \| contribs) Bureaucrats, Interface administrators, Administrators 4 edits No edit summary Newer edit →
Line 2:		Line 2:

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