| Hint | Answer | % Correct |
|---|---|---|
| Who is the namesake for the function phi(m), which returns the number of integers less than or equal to m that are relatively prime to m? | Euler | 100%
|
| Name the theorem: If b is an integer, p is a prime, and p does not divide b, then b^(p-1) == 1 mod p. | Fermat's Little Theorem | 100%
|
| Name the theorem: If b, c are relatively prime to each other, then b^(phi(c)) == 1`mod c | Euler's theorem | 50%
|
| The above means that b^(p-2) is the ______ ______ of b modulo p? | Multiplicative inverse | 0%
|
| The above means that b^(phi(c) - 1) is the ______ ______ of b modulo c? | Multiplicative inverse | 0%
|
| If 2^m == 2 mod m, m is known as __________. | Pseudoprime | 0%
|
| If c^m == c mod m, where c is an integer, m is known as ________ to the ____ c.Enter answers separated by comma | Pseudoprime,base | 0%
|