Hello and welcome to our community! Is this your first visit?
Register
Enjoy an ad free experience by logging in. Not a member yet? Register.
Results 1 to 8 of 8
  1. #1
    New Coder
    Join Date
    May 2009
    Location
    Cincinnati
    Posts
    45
    Thanks
    0
    Thanked 4 Times in 4 Posts

    PHP Prime Number Generator

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

    PHP Code:
    <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 != 1) continue;
        
    $d 3;
        
    $x sqrt($i);
        while (
    $i $d != && $d $x$d += 2;
        if(((
    $i $d == && $i != $d) * 1) == 0) echo $i.' ';
      }
    ?>

  • #2
    Supreme Master coder! abduraooft's Avatar
    Join Date
    Mar 2007
    Location
    N/A
    Posts
    14,866
    Thanks
    160
    Thanked 2,224 Times in 2,211 Posts
    You might be interested in Sieve of Eratosthenes algorithm
    Edit: never mind... it's my mistake :-(
    Last edited by abduraooft; 06-02-2009 at 10:34 AM.
    The Dream is not what you see in sleep; Dream is the thing which doesn't let you sleep. --(Dr. APJ. Abdul Kalam)

  • #3
    Master Coder
    Join Date
    Dec 2007
    Posts
    6,682
    Thanks
    436
    Thanked 890 Times in 879 Posts
    Quote Originally Posted by abduraooft View Post
    You might be interested in Sieve of Eratosthenes algorithm
    if you look carefully you'll see that this is what op use,

    best regards

  • #4
    New to the CF scene
    Join Date
    Jun 2009
    Location
    /home
    Posts
    2
    Thanks
    0
    Thanked 0 Times in 0 Posts
    its useful indeed..thx

    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..

  • #5
    Master Coder
    Join Date
    Dec 2007
    Posts
    6,682
    Thanks
    436
    Thanked 890 Times in 879 Posts
    Quote Originally Posted by mkrahmeh View Post
    its useful indeed..thx

    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...s=prime+number

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

    best regards

  • #6
    New to the CF scene
    Join Date
    Jun 2009
    Location
    /home
    Posts
    2
    Thanks
    0
    Thanked 0 Times in 0 Posts
    Quote Originally Posted by oesxyl View Post
    wrong,

    http://wordnetweb.princeton.edu/perl...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://en.wikipedia.org/wiki/Prime_numbers#Primality_of_one
    Last edited by mkrahmeh; 07-01-2009 at 09:43 AM.

  • #7
    Senior Coder
    Join Date
    Sep 2010
    Posts
    2,451
    Thanks
    17
    Thanked 275 Times in 275 Posts
    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.

  • #8
    New to the CF scene
    Join Date
    Jul 2012
    Posts
    1
    Thanks
    0
    Thanked 0 Times in 0 Posts
    <?php
    $no=$_POST['num'];
    for($i=2;$i<=$no-$i;$i+1){
    if($no%$i==0){
    echo "Not ";
    break;

    }
    }
    echo "Prime";
    ?>


  •  

    Posting Permissions

    • You may not post new threads
    • You may not post replies
    • You may not post attachments
    • You may not edit your posts
    •