Test Prime

Program TestPrime;
var num, count, remainder:integer;

begin

  writeln('Input a number to check whether it is a prime? ');
  readln(num);
  count:= 2;
  remainder:= 1;
  
  while (count <= num) and (remainder = 1) do
     begin
        remainder := num mod count ;
        count := count + 1;
     end;
     
  if remainder = 0 then
     writeln('The number ', num, ' is not a prime number')
  else
     writeln('The number ', num, ' is a prime number')

end.