4. What does the randomized primality testing algorithm (based on the little Fermat theorem) return for...

Transcribed Image Text:

4. What does the randomized primality testing algorithm (based on the little Fermat theorem) return for n = 281 and a = 2? Is it "yes" (i.e. prime) or "no" (i.e. compos- ite)? - 4. What does the randomized primality testing algorithm (based on the little Fermat theorem) return for n = 281 and a = 2? Is it "yes" (i.e. prime) or "no" (i.e. compos- ite)? -