Miller Rabin Testing-资料.docVIP

1.2.6 Example: Testing for Primality This section describes two methods for checking the primality of an integer n, one with order of growth , and a probabilistic algorithm with order of growth . The exercises at the end of this section suggest programming projects based on these algorithms. Searching for divisors Since ancient times, mathematicians have been fascinated by problems concerning prime numbers, and many people have worked on the problem of determining ways to test if numbers are prime. One way to test if a number is prime is to find the numbers divisors. The following program finds the smallest integral divisor (greater than 1) of a given number n. It does this in a straightforward way, by testing n for divisibility by successive integers starting with 2. (define (smallest-divisor n) (find-divisor n 2)) (define (find-divisor n test-divisor) (cond (( (square test-divisor) n) n) (( divides? test-divisor n) test-divisor) (else (find-divisor n (+ test-divisor 1))))) (define (divides? a b) (= (remainder b a) 0)) We can test whether a number is prime as follows: n is prime if and only if n is its own smallest divisor. (define (prime? n) (= n (smallest-divisor n))) The end test for find-divisor is based on the fact that if n is not prime it must have a divisor less than or equal to . 44 This means that the algorithm need only test divisors between 1 and . Consequently, the number of steps required to identify n as prime will have order of growth . The Fermat test The primality test is based on a result from number theory known as Fermats Little Theorem. 45 Fermats Little Theorem: If n is a prime number and a is any positive integer less than n, then a raised to the nth power is congruent to a modulo n. (Two numbers are said to be congruent modulo n if they both have the same remainder when divided by n. The remainder of a number a when divided by n is also referred to as the remainder modulo nmodulo n remainder of a modulo n, or