Platinum Partner
php

Step-by-step Logic Finding Prime numbers with PHP

A Prime numbers are all integers(number) that can be divided evenly only by 1 AND itself.
And it must be a whole number greater than 1. 

  2           3      
 /   \        /  \     ...................
1   2      1  3

Logic in Program

Prime Logic




Take a look above, the green numbers indicate that each prime number has exactly 2 (two) divisors. 1 and itself. From this simple logic, we can easily code it . Take a look again in Snippet above

Notes: This example is just for those who are new to this
function prime($n){

      //all numbers that will be evaluated as prime       
     for($i=1;$i";
             }
      }
} 


prime(20);  //find the Prime for 1-20 range
{{ tag }}, {{tag}},

{{ parent.title || parent.header.title}}

{{ parent.tldr }}

{{ parent.urlSource.name }}
{{ parent.authors[0].realName || parent.author}}

{{ parent.authors[0].tagline || parent.tagline }}

{{ parent.views }} ViewsClicks
Tweet

{{parent.nComments}}