Prime Number Functions

Functions for working with prime numbers. More...

Functions
bool	di_is_prime (di_int n, int certainty)
	Test if integer is prime (Miller-Rabin test)
di_int	di_next_prime (di_int n)
	Find next prime number >= n.

Detailed Description

Functions for working with prime numbers.

Function Documentation

di_is_prime()

bool di_is_prime	(	di_int	n,
		int	certainty
	)

Test if integer is prime (Miller-Rabin test)

Parameters

n	Integer to test (may be NULL)
certainty	Number of rounds for probabilistic test

Returns

true if n is probably prime, false if composite or NULL

Since

1.0.0

Note

Higher certainty values increase accuracy but take longer

Definition at line 2437 of file dynamic_int.h.

di_next_prime()

di_int di_next_prime

(

di_int

n

)

Find next prime number >= n.

Parameters

n	Starting integer (may be NULL)

Returns

New di_int with next prime >= n, or NULL on failure

Since

1.0.0

Definition at line 2501 of file dynamic_int.h.