Читать книгу Cryptography, Information Theory, and Error-Correction - Aiden A. Bruen - Страница 86

1 1 Recall that a number is primeif it has no factors save itself and 1. So 11 is prime, but is not since 2 and 3 divide 6, i.e. they are factors of 6.

2 2 Fermat's theorem says that when is prime and is not a multiple of .

3 3 Testing for primality means to see whether the number in question is a prime number.

4 4 is Euler's Phi Function see Chapter 19 for further details.