題組內容
1. Answer each problem below briefly. (4 points each)
Suffice it to write down the solutions; no computations are required.
(c) (4 points) Consider the following primality testing algorithm based on Fermat's little theorem function FermatPrimalityTest(n,k)
Given the smallest Carmichael number 561 = 3ㆍ11ㆍ17, what is the probability that the call FermatPrimalityTest(561,1) returns true?
Given the smallest Carmichael number 561 = 3ㆍ11ㆍ17, what is the probability that the call FermatPrimalityTest(561,1) returns true?