Prime Number Function - Pex11F99.pas

function Prime( i: integer ): boolean;

var OK: boolean;

Try: integer;

begin {Prime}

OK := true;

Try := 2;

while OK and ( Try < ( i div 2 ) ) do

begin

OK := (I mod Try) <> 0;

Try := Try + 1

end;

Prime := OK

end; {Prime}

Previous slide

Next slide

Back to first slide

View graphic version