ed/Odin
1
0 Fork 0
mirror of https://github.com/Ed94/Odin.git synced 2026-10-15 21:39:44 -07:00
Code Issues Packages Projects Releases Wiki Activity

big: Fix M-R.

Browse Source
This commit is contained in:
Jeroen van Rijn committed 2021-09-02 19:59:59 +02:00
1 parent 31918d3b8f
commit 7fa04fa018
2 files changed
+9 -38
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

core/math/big/prime.odin
+4 -4
View File
@@ -223,7 +223,7 @@ internal_int_prime_miller_rabin :: proc(a, b: ^Int, allocator := context.allocat
/*
Ensure `b` > 1.
*/
if internal_gt(b, 1) { return false, nil; }
if internal_lte(b, 1) { return false, nil; }
/*
Get `n1` = `a` - 1.
@@ -291,10 +291,10 @@ internal_int_prime_miller_rabin :: proc(a, b: ^Int, allocator := context.allocat
`a` is the big Int to test for primality.
`miller_rabin_trials` can be one of the following:
< 0: For `a` up to 3_317_044_064_679_887_385_961_981, set `miller_rabin_trials` to negative to run a predetermined
`< 0`: For `a` up to 3_317_044_064_679_887_385_961_981, set `miller_rabin_trials` to negative to run a predetermined
number of trials for a deterministic answer.
= 0: Run Miller-Rabin with bases 2, 3 and one random base < `a`. Non-deterministic.
> 0: Run Miller-Rabin with bases 2, 3 and `miller_rabin_trials` number of random bases. Non-deterministic.
`= 0`: Run Miller-Rabin with bases 2, 3 and one random base < `a`. Non-deterministic.
`> 0`: Run Miller-Rabin with bases 2, 3 and `miller_rabin_trials` number of random bases. Non-deterministic.
`miller_rabin_only`:
`false` Also use either Frobenius-Underwood or Lucas-Selfridge, depending on the compile-time `MATH_BIG_USE_FROBENIUS_TEST` choice.