drygdryg/calc
1
0
Fork 0
mirror of https://github.com/lcn2/calc.git synced 2025-08-19 01:13:27 +03:00
Code Issues Packages Projects Releases Wiki Activity

Release calc version 2.11.0t10

Browse Source
This commit is contained in:
Landon Curt Noll
1999-11-11 05:15:39 -08:00
parent 86c8e6dcf1
commit 96c34adee3
283 changed files with 2380 additions and 3032 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
help/ptest
View File

@@ -55,7 +55,7 @@ DESCRIPTION
For the random case (skip = 0), the probability that any one test
with random base b will return 1 if n is composite is always
less than 1/4, so with count = k, the probability is less
than 1/4^k. For most values of n the probability is much
than 1/4^k. For most values of n the probability is much
smaller, possible zero.
RUNTIME
@@ -77,7 +77,7 @@ RUNTIME
If the word-count for n is less than conf("redc2"), REDC algorithms
are used in evaluating ptest(n, count, skip) when small-factor
cases have been eliminated. For small word-counts (say < 10)
cases have been eliminated. For small word-counts (say < 10)
this may more than double the speed of evaluation compared with
the standard algorithms.
@@ -114,7 +114,7 @@ EXAMPLE
These results show that a is a strong pseudoprime for all 11 prime
bases less than or equal to 31, and for all positive integer bases
less than or equal to 21, but not for the bases 37 and 22. The
less than or equal to 21, but not for the bases 37 and 22. The
probability that ptest(a,-1,0) (or ptest(a,1,0)) will return 1 is
about 0.19.