public static function upTo($max) { $result = array(2); $prime = new Prime(3); while ($prime->lessThan($max)) { $result[] = $prime->value; $prime = $prime->next(); } return $result; }
<?php require_once './../common/prime.php'; $primes = Prime::findsPrimesUpTo(1999999); $sum = 0; foreach ($primes as $prime) { $sum += $prime; } var_dump($sum);
<?php require_once './../common/prime.php'; $count = 0; $num = 1; while ($count < 10001) { if (Prime::isPrime($num)) { $count++; echo "Prime {$count}: {$num}\n"; } $num += 2; }
public function testNumberNotPrime() { $prime = new Prime(); $this->assertFalse($prime->isNumberPrime()); }
/** * Output whether a number is prime; and, if not, its unique factors. * * @param $n int Number to check for primeness */ function prime_check($n) { try { require 'api_classes/prime.php'; $primeObj = new \Prime(); $primeObj->isPrime($n); $primeObj->output(); } catch (\Exception $e) { } }