return (n==3);
if (n % 5 == 0)
return (n==5);
for (i=7; i*i <= n; i+=2)
if (n % i == 0)
return 0;
return 1;
}
main()
{
int i, n;
n = 1000;
for (i=2; i<=n; i++)
if (prime(i))
printf(«%d\n», i);
}
{ Copyright (c) 1990, Borland International }
program Prime4PA;
Var
I,N: Integer;
Function Prime(N: Integer):Boolean;
Var
I: integer;
Begin
If (N MOD 2 = 0) then
Begin
Prime:= N = 2;
Exit;
End;
If (N MOD 3 = 0) then
Begin
Prime:= N = 3;
Exit;
End;
If (N MOD 5 = 0) then
Begin
Prime:= N = 5;
Exit;
End;
For I:= 7 to N-1 do
If (N MOD I = 0) then
Begin
Prime:= False;
Exit;