Relish

05-31-2009, 08:33 PM

Not sure how useful this is, but interesting. It will output all the prime numbers between the inputted start and end numbers.

<form action="#" method="get">

<input name="start" type="text" />

<input name="end" type="text" />

<input name="submit" type="submit" value="Go!" />

</form>

<?php

for ($i = $_GET['start']; $i <= $_GET['end']; $i++)

{

if($i % 2 != 1) continue;

$d = 3;

$x = sqrt($i);

while ($i % $d != 0 && $d < $x) $d += 2;

if((($i % $d == 0 && $i != $d) * 1) == 0) echo $i.' ';

}

?>

abduraooft

06-01-2009, 08:59 AM

You might be interested in Sieve of Eratosthenes algorithm (http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)

never mind... it's my mistake :-(

oesxyl

06-01-2009, 10:12 AM

You might be interested in Sieve of Eratosthenes algorithm (http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)

if you look carefully you'll see that this is what op use, :)

best regards

mkrahmeh

06-30-2009, 11:30 AM

its useful indeed..thx :thumbsup:

but note that your algorithm considers 1 as a prime and discards 2..

actually 1 is not a prime, and 2 is the only even prime..

oesxyl

06-30-2009, 06:29 PM

its useful indeed..thx :thumbsup:

but note that your algorithm considers 1 as a prime and discards 2..

actually 1 is not a prime, and 2 is the only even prime..

wrong, :)

http://wordnetweb.princeton.edu/perl/webwn?s=prime+number

1 has no integral factors but itself and 1, therefor is prime, :)

best regards

mkrahmeh

07-01-2009, 09:31 AM

wrong, :)

http://wordnetweb.princeton.edu/perl/webwn?s=prime+number

1 has no integral factors but itself and 1, therefor is prime, :)

best regards

it used to be a prime :)

it has been a controversial issue, but recently its more accepted to consider 1 as a non prime..

http://mathworld.wolfram.com/PrimeNumber.html (http://mathworld.wolfram.com/PrimeNumber.html)

http://en.wikipedia.org/wiki/Prime_numbers#Primality_of_one (http://en.wikipedia.org/wiki/Prime_numbers#Primality_of_one)

DrDOS

09-15-2010, 05:16 PM

I've actually written a script to do this, but in javascript of all things. It builds the Ulam Square of prime numbers and presents it on a web page. Here it is on my testing site.

http://ronbeau.50webs.com/ulam.html

And there is also a page for a 201 x 201 square.

But there are several things you need to know about generating primes if you want to be efficient. How that page works is by declaring a array and populating it with primes and then using the data from the array to build the page. But building the array involves two steps. You only need to test with primes that are less than the square root of a given number, so you need to build a smaller array containing the numbers to check against.

You can't start your arrays with one, or every number will be considered divisible and none pushed into the array. You have to start your divisor array with two and the big array with three.

It would be very easy to translate that code into PHP but in this case that sort of defeats the purpose, since the page you download is only about 3kb but the page built is over 100kb, making more work for the server while the client machine is sitting there just wating.

tony_day

07-02-2012, 05:33 PM

<?php

$no=$_POST['num'];

for($i=2;$i<=$no-$i;$i+1){

if($no%$i==0){

echo "Not ";

break;

}

}

echo "Prime";

?>