Primality by trial division: Difference between revisions
Content added Content deleted
Line 35: | Line 35: | ||
prime = 1 |
prime = 1 |
||
END FUNCTION |
END FUNCTION |
||
=={{header|C}}== |
|||
#include <math.h> |
|||
#define FALSE 0 |
|||
#define TRUE 1 |
|||
int isPrime( unsigned int n ) |
|||
{ |
|||
unsigned int i; |
|||
if ( n == 2 ) |
|||
return TRUE; |
|||
if ( n <= 1 || ( n & 1 ) == 0 ) |
|||
return FALSE; |
|||
for ( i = 3 ; i <= sqrt( n ) ; i += 2 ) |
|||
if ( n % i == 0 ) |
|||
return FALSE; |
|||
return TRUE; |
|||
} |
|||
=={{header|Common Lisp}}== |
=={{header|Common Lisp}}== |