note 78324 added to function.gmp-nextprime

"This function uses a probabilistic algorithm to
identify primes and chances to get a composite number are
extremely small."

But if you repeately make larger and larger primenumbers,
you WILL get a composite number, or what? And does anybody
know WHEN?

Regards
Tobias, Denmark
----
Server IP: 195.184.96.15
Probable Submitter: 87.60.161.235
----
Manual Page -- http://www.php.net/manual/en/function.gmp-nextprime.php
Edit        -- https://master
.php.net/note/edit/78324
Del: integrated  -- h
ttps://master.php.net/note/delete/78324/integrated
Del: useless     -- http
s://master.php.net/note/delete/78324/useless
Del: bad code    -- htt
ps://master.php.net/note/delete/78324/bad+code
Del: spam        -- https:/
/master.php.net/note/delete/78324/spam
Del: non-english -- 
https://master.php.net/note/delete/78324/non-english
Del: in docs     -- http
s://master.php.net/note/delete/78324/in+docs
Del: other reasons-- https://mast
er.php.net/note/delete/78324
Reject      -- https://mast
er.php.net/note/reject/78324
Search      -- https://
master.php.net/manage/user-notes.php

-- 
PHP Notes Mailing List (http://www.php.net/)
To unsubscribe, visit: http://www.php.net/unsub
.php

Note Submitter: me at example dot com 

----

"This function uses a probabilistic algorithm to
identify primes and chances to get a composite number are
extremely small."

But if you repeately make larger and larger primenumbers,
you WILL get a composite number, or what? And does anybody
know WHEN?

Regards
Tobias, Denmark

-- 
PHP Notes Mailing List (http://www.php.net/)
To unsubscribe, visit: http://www.php.net/unsub
.php