Primality by Wilson's theorem: Difference between revisions

m
Line 223:
% allow numbers whose factorial won't fit in 32 bits %
logical procedure isWilsonPrime ( integer value n ) ;
begin
if n < 2 then false
elseinteger beginfactorialModN;
factorialModN := integer factorialModN1;
for i := 2 until n - 1 do factorialModN := 1( factorialModN * i ) rem n;
factorialModN = n - 1
for i := 2 until n - 1 do factorialModN := ( factorialModN * i ) rem n;
end isWilsonPrime ;
factorialModN = n - 1
end isWilsonPrime ;
 
for i := 1 until 100 do if isWilsonPrime( i ) then writeon( i_w := 1, s_w := 0, " ", i );
3,038

edits