- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for probablyPrimeLucas (0.32 sec)
-
src/math/big/prime_test.go
func(n nat) bool { return n.probablyPrimeMillerRabin(1, true) && !n.probablyPrimeLucas() }, // https://oeis.org/A001262 []int{2047, 3277, 4033, 4681, 8321, 15841, 29341, 42799, 49141, 52633, 65281, 74665, 80581, 85489, 88357, 90751}) } func TestLucasPseudoprimes(t *testing.T) { testPseudoprimes(t, "probablyPrimeLucas", func(n nat) bool { return n.probablyPrimeLucas() && !n.probablyPrimeMillerRabin(1, true) },
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 12:54:00 UTC 2019 - 7.1K bytes - Viewed (0) -
src/math/big/prime.go
rB%29 == 0 || rB%31 == 0 || rB%41 == 0 || rB%43 == 0 || rB%47 == 0 || rB%53 == 0 { return false } return x.abs.probablyPrimeMillerRabin(n+1, true) && x.abs.probablyPrimeLucas() } // probablyPrimeMillerRabin reports whether n passes reps rounds of the // Miller-Rabin primality test, using pseudo-randomly chosen bases. // If force2 is true, one of the rounds is forced to use base 2.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 02 14:43:52 UTC 2022 - 10.4K bytes - Viewed (0)