Lines Matching refs:PRIME
1588 \chapter{Prime Numbers}
1605 equal to $b$ or not. If the values are equal then $a$ is probably prime and $result$ is set to one. Otherwise $result$
1614 fool (besides with Carmichael numbers). If $a$ passes the test (therefore is probably prime) $result$ is set to one.
1621 Generally to ensure a number is very likely to be prime you have to perform the Miller-Rabin with at least a half-dozen
1642 $1 \le t < PRIME\_SIZE$ where $PRIME\_SIZE$ is the number of primes in the prime number table (by default this is $256$).
1644 \section{Next Prime}
1649 This finds the next prime after $a$ that passes mp\_prime\_is\_prime() with $t$ tests. Set $bbs\_style$ to one if you
1650 want only the next prime congruent to $3 \mbox{ mod } 4$, otherwise set it to zero to find any next prime.
1658 This will find a prime greater than $256^{size}$ which can be ``bbs\_style'' or not depending on $bbs$ and must pass
1680 This will generate a prime in $a$ using $t$ tests of the primality testing algorithms. The variable $size$
1681 specifies the bit length of the prime desired. The variable $flags$ specifies one of several options available
1690 \hline LTM\_PRIME\_BBS & Make the prime congruent to $3$ modulo $4$ \\
1691 \hline LTM\_PRIME\_SAFE & Make a prime $p$ such that $(p - 1)/2$ is also prime. \\
1804 This will compute the Jacobi symbol for $a$ with respect to $p$. If $p$ is prime this essentially computes the Legendre
1805 symbol. The result is stored in $c$ and can take on one of three values $\lbrace -1, 0, 1 \rbrace$. If $p$ is prime
