array ( 0 => 'index.php', 1 => 'PHP Manual', ), 'head' => array ( 0 => 'UTF-8', 1 => 'pt_BR', ), 'this' => array ( 0 => 'function.gmp-prob-prime.php', 1 => 'gmp_prob_prime', ), 'up' => array ( 0 => 'ref.gmp.php', 1 => 'Funções GMP', ), 'prev' => array ( 0 => 'function.gmp-powm.php', 1 => 'gmp_powm', ), 'next' => array ( 0 => 'function.gmp-random-bits.php', 1 => 'gmp_random_bits', ), 'alternatives' => array ( ), 'source' => array ( 'lang' => 'en', 'path' => 'reference/gmp/functions/gmp-prob-prime.xml', ), ); $setup["toc"] = $TOC; $setup["toc_deprecated"] = $TOC_DEPRECATED; $setup["parents"] = $PARENTS; manual_setup($setup); ?>
(PHP 4 >= 4.0.4, PHP 5, PHP 7, PHP 8)
gmp_prob_prime — Check if number is "probably prime"
The function uses Miller-Rabin's probabilistic test to check if a number is a prime.
num
The number being checked as a prime.
repetitions
Reasonable values
of repetitions
vary from 5 to 10 (default being
10); a higher value lowers the probability for a non-prime to
pass as a "probable" prime.
If this function returns 0, num
is
definitely not prime. If it returns 1, then
num
is "probably" prime. If it returns 2,
then num
is surely prime.
Exemplo #1 gmp_prob_prime() example
<?php
// definitely not a prime
echo gmp_prob_prime("6") . "\n";
// probably a prime
echo gmp_prob_prime("1111111111111111111") . "\n";
// definitely a prime
echo gmp_prob_prime("11") . "\n";
?>
O exemplo acima produzirá:
0 1 2