Rosetta Code

Pernicious numbers: Difference between revisions

Page Discussion

Pernicious numbers (view source)

Revision as of 17:35, 21 March 2021

175 bytes removed ,  3 years ago
m
Forth - simpler primality test
(Added Forth solution)
m (Forth - simpler primality test)
Line 864:
0
begin
n 0 <>
while
n n 1- and to n
Line 870:
repeat ;
 
\ primality test for 0 <= n <= 63
: prime? {( n -- ? })
n 2 < if false exit then
1 swap lshift 0x28208a20a08a28ac and 0<> ;
n 2 mod 0= if n 2 = exit then
n 3 mod 0= if n 3 = exit then
5
begin
dup dup * n <=
while
n over mod 0= if drop false exit then
2 +
n over mod 0= if drop false exit then
4 +
repeat
drop true ;
 
: pernicious? ( n -- ? )
Simonjsaunders
1,777

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/242086"