ead:====================================================an: TEST WHETHER A NUMBER IS PRIME.ax: USE PROBABILISTIC TEST BASED ON FERMAT'S THEOREM.a: SEE KNUTH, "SEMINUMERICAL ALGORITHMS".a:9b: PROMPT FOR NUMBER, TEST IT, AND PRONOUNCE VERDICT.ub:====================================================b: DEFINE PARAMETERS.b:b N,P,X,Y : DOUBLE PRECISIONcK  : NUMBER OF TEST CASES=c:----------------------------------------------------qc: GET A NUMBER TO BE TESTED. CHECK THE SIZE.yc:cc "NUMBER"; N : GET A NUMBER TO TESTc N  c N > "TOO BIG" : *d:----------------------------------------------------Pd": DETERMINE WHETHER N IS PRIME.Xd,:od6 "TEST NUMBER: ";d; N (N) d@ I K : TEST CASESdJ X  ((N)) : TEST VALUEdT X;-e^  : PERFORM TEST`eh Y  | : NOT PRIME?her Ie| : : NOT PRIME IF Y <> 1e:----------------------------------------------------e: PRINT THE VERDICT.e: f Y  N; "IS PROBABLY PRIME."Df Y  N; "IS NOT PRIME."f:----------------------------------------------------f  : RUN THE PROGRAM AGAINf:----------------------------------------------------%g: SUBROUTINE. COMPUTE Y = [X^(N-1)] MOD N.-g:AgY  : P Nxg P (P)  : IS P IS EVEN, SKIPgY Y X : Y Y (YN) N : (Y * X) MOD NgX X X : X X (XN) N : (X * X) MOD NhP (P) : P   hFh&:====================================================