RosettaCodeData/Task/Primality-by-trial-division/Delphi/primality-by-trial-division-2.delphi
2023-07-01 13:44:08 -04:00

15 lines
222 B
Text

function IsPrime(const x: integer): Boolean;
var
i: integer;
begin
i := 2;
repeat
if X mod i = 0 then
begin
Result := False;
Exit;
end;
Inc(i);
until i > Sqrt(x);
Result := True;
end;