hub / github.com/andeya/algorithm / ProbablyPrimeBigInt_32

Function ProbablyPrimeBigInt_32

mathutil/mathutil.go:557–582 · view source on GitHub ↗

ProbablyPrimeBigInt_32 returns true if n is prime or n is a pseudoprime to base a. It implements the Miller-Rabin primality test for one specific value of 'a' and k == 1. See also ProbablyPrimeUint32.

(n *big.Int, a uint32)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 2

TestProbablyPrimeBigInt_32Function · 0.85

BenchmarkProbablyPrimeBigInt_32Function · 0.85

Calls 6

ModPowBigIntFunction · 0.85

SubMethod · 0.80

CmpMethod · 0.80

SetMethod · 0.65

ModMethod · 0.45

MulMethod · 0.45

Tested by 2

TestProbablyPrimeBigInt_32Function · 0.68

BenchmarkProbablyPrimeBigInt_32Function · 0.68