diff options
| author | Marco Bodrato <bodrato@mail.dm.unipi.it> | 2012-12-14 17:11:08 +0100 |
|---|---|---|
| committer | Marco Bodrato <bodrato@mail.dm.unipi.it> | 2012-12-14 17:11:08 +0100 |
| commit | 255c6b5c5e500576aebe42606feaca74308c76c7 (patch) | |
| tree | 4df29d2c87eda9fc242182bc2454e02b8f141593 | |
| parent | 6dbf8e11f9502971a4ed53a5e39abbd4b53fecae (diff) | |
| download | gmp-255c6b5c5e500576aebe42606feaca74308c76c7.tar.gz | |
doc/gmp.texi: typo removed.
| -rw-r--r-- | doc/gmp.texi | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/gmp.texi b/doc/gmp.texi index 24d6a9477..77a4be702 100644 --- a/doc/gmp.texi +++ b/doc/gmp.texi @@ -3500,7 +3500,7 @@ This function does some trial divisions, then some Miller-Rabin probabilistic primality tests. The argument @var{reps} controls how many such tests are done; a higher value will reduce the chances of a composite being returned as ``probably prime''. 25 is a reasonable number; a composite number will then be -identified as a prime with a probability of less than @m{2^{-50}}. +identified as a prime with a probability of less than @m{2^{-50},2^(-50)}. Miller-Rabin and similar tests can be more properly called compositeness tests. Numbers which fail are known to be composite but those which pass |