This module supports modular values and arithmetic. The moduli are integers (at least 2) and the values are either integers or Gaussian integers. The usual arithmetic operations may be used.
CL-MOD-PRIME is a library of number theory for CL. Return (values RESULT FAIL-PROBABILITY). If N is a prime, then RESULT is always T. Otherwise, if N is composite, then RESULT may be T or NIL. At most ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback