Pascal function that tests if a number is prime

The function tests if a number is prime by looking for possible divisors between 2 and the square root of the number. There is no need to look for divisors bigger than the square root of the number, since if they exist, then there should also exist another divisor, which is smaller than the square root, and with which if multiplied it would give the original number.
function is_prime(number:longint):boolean;
var i:longint;
    return_value: boolean;
 return_value := true;

 for i:=2 to trunc(sqrt(number)) do
   if (number mod i = 0) then
     return_value := false;

 if (return_value = true) then
  if (number = 0) or (number = 1) then return_value := false;

 is_prime := return_value;

Leave a Reply

Your email address will not be published. Required fields are marked *

sixteen + 18 =

This site uses Akismet to reduce spam. Learn how your comment data is processed.

By continuing to use the site, you agree to the use of cookies. more information

The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this.