Primality by Wilson's theorem: Difference between revisions

# allow numbers whose factorial won't fit in 32 bits #

PROC is wilson prime = ( INT p )BOOL:

INT factorial mod p := 1;

FOR i FROM 2 TO p - 1 DO factorial mod p *:= i MODAB p OD;

factorial mod p = p - 1

FOR i TO 100 DO IF is wilson prime( i ) THEN print( ( " ", whole( i, 0 ) ) ) FI OD