<\/p>\n\n\n\n
If one wants to test whether p<\/em> is prime, then we can pick random integers a<\/em> and see whether the congruence holds. If it does not hold for a value of a<\/em>, then p<\/em> is composite. This congruence is unlikely to hold for a random a<\/em> if p<\/em> is composite. Therefore, if the equality does hold for one or more values of a<\/em>, then we say that p<\/em> is probably prime<\/a>.<\/p>\n\n\n\n <\/p>\n\n\n\n Please write a probabilistic program based on Fermat’s little theorem checking if a given number is prime<\/strong>. Use “random” function, which returns a random number from zero to n – 1, e.g. (random 5) may return 0, 1, 2, 3, or 4. Please, write also the standard deterministic program based on the well-known definition:<\/strong><\/p>\n\n\n\n A prime number is<\/strong> a number that can only be divided by itself and 1 without remainders<\/strong>.<\/p>\n\n\n\n <\/p>\n\n\n\n Let’s assume that 100 Fermat’s tests is enough to be sure if the number is prime. Which program is theoretically better and which performs better in real life? Can you guess why?<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":" From Wikipedia, the free encyclopedia: In number theory, Fermat’s little theorem states that if p is a prime number, then for any integer a, the number ap \u2212 a is an integer multiple of p. In the notation of modular arithmetic, this is expressed as: If one wants to test whether p is prime, then we can pick random integers a and see whether the congruence holds. If it does not hold for a … <\/p>\n