Primality by trial division: Difference between revisions

Content added Content deleted
No edit summary
Line 275: Line 275:
return true ;
return true ;
}</lang>
}</lang>

=={{header|Delphi}}==
<lang Delphi>
function IsPrime(aNumber: Integer): Boolean;
var
I: Integer;
begin
Result:= True;
if(aNumber = 2) then Exit;

Result:= not ((aNumber mod 2 = 0) or
(aNumber <= 1));
if not Result then Exit;

for I:=3 to Trunc(Sqrt(aNumber)) do
if(aNumber mod I = 0) then
begin
Result:= False;
Break;
end;
end;
</lang>


=={{header|E}}==
=={{header|E}}==