— Variable: **prime:prngs**

prime:prngsis the random-state (see Random Numbers) used by these procedures. If you call these procedures from more than one thread (or from interrupt),`random`

may complain about reentrant calls.

- Robert Solovay and Volker Strassen, A Fast Monte-Carlo Test for Primality, SIAM Journal on Computing, 1977, pp 84-85.

— Function: **jacobi-symbol**` p q`

Returns the value (+1, −1, or 0) of the Jacobi-Symbol of exact non-negative integer

pand exact positive odd integerq.

— Variable: **prime:trials**

prime:trialsthe maxinum number of iterations of Solovay-Strassen that will be done to test a number for primality.

— Function: **prime?**` n`

Returns

`#f`

ifnis composite;`#t`

ifnis prime. There is a slight chance`(expt 2 (- prime:trials))`

that a composite will return`#t`

.