public function testProblemSolution() { $c = new Euler_Prob41_Problem(); $c->solution(); }
return false; $right = $this->rightRemove($number); $left = $this->leftRemove($number); $nums = array_merge($right, $left); $notTruncatable = array(2, 3, 5, 7); foreach ($nums as $numbers) { if (!$this->prob41->isPrime(intval($numbers)) && !in_array($numbers, $notTruncatable)) return false; } return true; } } $c = new Euler_Prob37_Problem(); $number = 23; $primes = array(); while (count($primes) < 11) { if ($c->isTruncatable($number)) { $primes[] = $number; } $number++; } print_r($primes); echo array_sum($primes); $prob = new Euler_Prob41_Problem; var_dump($prob->isPrime(35)); var_dump($prob->isPrime(13));