PHP Prime Numbers Algorithm

prime_numbers_from_to.php

<?php
$from = 13;

$to = 300;

$primes = [2, 3, 5, 7, 11, 13];

// & due to no array copy, and only pass
function divides_by_prime(array &$primes, int $number) {
	// optionally if primes wouldn't be segregated from smallest so largest, or some missing
	// we could limit the script by adding this for optimization:
	// $numSqrt = sqrt($number); 
	foreach($primes as $prime){
		// and here we could then do
		// if($prime > $numSqrt) return false;
		if($number % $prime === 0) return true;
	}
	
	return false;
}

for($i = $from; $i < $to; $i++) {
	if(! divides_by_prime($primes, $i)) {
	  $primes[] = $i;
	}
	
}


print_r(implode(",", $primes));