note 104392 added to function.gmp-prob-prime

modified version of roland's code, can go much further than 61 <?php for ($idx = 0; $idx <= 10000; $idx++) { // this 10000 takes about 3.5 min on 3GHz machine $pow = gmp_sub(gmp_strval(gmp_pow('2', $idx)), 1); // here is the difference $prop = gmp_prob_prime($pow); if ($prop > 0) { echo 'idx=' . $idx . "\n--------\n"; echo 'pow=' . $pow . "\n"; echo 'prop=' . $prop . "\n------\n"; } } ?> ---- Server IP: 147.32.160.17 Probable Submitter: 147.32.122.190 ---- Manual Page -- http://www.php.net/manual/en/function.gmp-prob-prime.php Edit -- https://master.php.net/note/edit/104392 Del: integrated -- https://master.php.net/note/delete/104392/integrated Del: useless -- https://master.php.net/note/delete/104392/useless Del: bad code -- https://master.php.net/note/delete/104392/bad+code Del: spam -- https://master.php.net/note/delete/104392/spam Del: non-english -- https://master.php.net/note/delete/104392/non-english Del: in docs -- https://master.php.net/note/delete/104392/in+docs Del: other reasons-- https://master.php.net/note/delete/104392 Reject -- https://master.php.net/note/reject/104392 Search -- https://master.php.net/manage/user-notes.php