Smarandache prime-digital sequence: Difference between revisions

m
Forth - simplified code
m (Forth - minor edits)
m (Forth - simplified code)
Line 552:
10 / recurse 10 * 2 + ;
 
: spds_printspds_next ( n -- n )
>r 0
begin
r@ 0 >
while
next_prime_digit_number
dup is_prime? if dup . r> 1- >r then
repeatuntil ;
 
drop rdrop cr ;
: spds_print ( n -- )
0 r@swap 0 >do
spds_next
dup is_prime? if r>dup 1- >r. then
loop
drop rdrop cr ;
 
: spds_nth ( n -- n )
0 swap 0 do spds_next loop ;
>r 0
begin
r@ 0 >
while
next_prime_digit_number
dup is_prime? if r> 1- >r then
repeat
rdrop ;
 
." First 25 SPDS primes:" cr
1,777

edits