Prime Number Hunter

    function find_primes($number)
    {
        global $primes;
        
        $nlist = array();
        $sqrt = ceil(sqrt($number));

        $nlist[] = 2;
        $nlist[] = 3;
        for($i=5 ; $i < $number ; $i=$i+2)
        {
            if($i%3 != 0)
                $nlist[] = $i;
        }
        
        for($i=2,$divisor=5; $divisor < $sqrt ; $i++) {
           /*
            * Remove non primes numbers from an array ($nlist)
            * Non prime numbers are identified by dividing with a known
            * prime (the prime number in our array at $index)
            */
            $count = count($nlist);
            $j = $i*$i;
            $nlist2 = array_slice($nlist,0,$j);
            
            for( ; $j < $count ; $j++)
            {
                $num = $nlist[$j];
                if($num % $divisor != 0)
                {
                    $nlist2[] = $num;
                    //echo "$divisor says keeps {$nlist[$i]} \n";
                }
            }
            unset($nlist);
            $nlist = $nlist2;
            $divisor = $nlist[$i+1];
        }
        
        $primes = $nlist;
        file_put_contents("/dev/shm/primes.txt",join(",",$nlist));
    }