(1 point) This question concerns primality testing. Consider the composite number 555.

Recall Fermat's Little Theorem: For any prime p and integer a, ^(1)1mod.

It happens that the converse to FLT is often but not always true. That is, if n is composite and a is an integer, then more often than not ^(1)1mod.

We can use this as the basis of a simple primality test, called the Fermat Test.

For 555 we make the following definitions. 1) We call a a Fermat Liar for =555 if ^(1)1mod, where (0,1,1). 2) We call a a Fermat Witness for =555if ^(1)1mod, where (0,1,1).

Please answer the following.

a) What is the first Fermat Liar in 555?

b) What is the first Fermat Witness in 555?

c) How many Fermat Liars are in 555? Remember not to count 0,1, or 1.

(1 point) This question concerns primality testing. Consider the composite number 555. Recall Fermat's Little Theorem: For any prime p and integer a, QP-1 = 1 mod p. It happens that the converse to FLT is often but not always true. That is, if n is composite and a is an integer, then more often than not an-1 # 1 mod n. We can use this as the basis of a simple primality test, called the Fermat Test. For a Z555 we make the following definitions. 1) We call a a Fermat Liar for n = 555 if an-1 = 1 mod n, where a (0, 1, n 1). 2) We call a a Fermat Witness for n = 555 if an-1 # 1 mod n, where a (0,1, n 1). Please answer the following. a) What is the first Fermat Liar in Z555? b) What is the first Fermat Witness in Z555 ? c) How many Fermat Liars are in Z555 ? Remember not to count 0,1, or n 1