# Standard math reference

This appendix is a reference of the standard math module.

## Standard math module

Symbol | Description
--- | ---
afnix-mth | module
afnix:mth | nameset

get-random-integer Integer none|Integer

The `get-random-integer` function returns a random integer number. Without argument, the integer range is machine dependent. With one integer argument, the resulting integer number is less than the specified maximum bound.

get-random-real Real none|Boolean

The `get-random-real` function returns a random real number between 0.0 and 1.0. In the first form, without argument, the random number is between 0.0 and 1.0 with 1.0 included. In the second form, the boolean flag controls whether or not the 1.0 is included in the result. If the argument is false, the 1.0 value is guaranted to be excluded from the result. If the argument is true, the 1.0 is a possible random real value. Calling this function with the argument set to true is equivalent to the first form without argument.

get-random-relatif Relatif Integer|Integer Boolean

The `get-random-relatif` function returns a n bits random positive relatif number. In the first form, the argument is the number of bits. In the second form, the first argument is the number of bits and the second argument, when true produce an odd number, or an even number when false.

get-random-prime Relatif Integer

The `get-random-prime` function returns a n bits random positive relatif probable prime number. The argument is the number of bits. The prime number is generated by using the Miller-Rabin primality test. As such, the returned number is declared probable prime. The more bits neede, the longer it takes to generate such number.

fermat-p Boolean Integer|Relatif Integer|Relatif

The `fermat-p` predicate returns true if the little fermat theorem is validated. The first argument is the base number and the second argument is the prime number to validate.

miller-rabin-p Boolean Integer|Relatif Integer|Relatif

The `miller-rabin-p` predicate returns true if the Miller-Rabin test is validated. The first argument is the base number and the second argument is the prime number to validate.

prime-probable-p Boolean Integer|Relatif [Integer]

The `prime-probable-p` predicate returns true if the argument is a probable prime. In the first form, only an integer or relatif number is required. In the second form, the number of iterations is specified as the second argument. By default, the number of iterations is specified to 56.