hub / github.com/andeya/algorithm / ProbablyPrimeUint64_32

Function ProbablyPrimeUint64_32

mathutil/mathutil.go:532–552 · view source on GitHub ↗

ProbablyPrimeUint64_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 uint64, a uint32)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 3

IsPrimeUint64Function · 0.85

TestProbablyPrimeUint64_32Function · 0.85

BenchmarkProbablyPrimeUint64_32Function · 0.85

Calls 3

ModPowUint64Function · 0.85

ModMethod · 0.45

MulMethod · 0.45

Tested by 2

TestProbablyPrimeUint64_32Function · 0.68

BenchmarkProbablyPrimeUint64_32Function · 0.68