Smarandache prime-digital sequence: Difference between revisions
Content added Content deleted
m (Forth - minor edits) |
m (Forth - simplified code) |
||
Line 552: | Line 552: | ||
10 / recurse 10 * 2 + ; |
10 / recurse 10 * 2 + ; |
||
: |
: spds_next ( n -- n ) |
||
>r 0 |
|||
begin |
begin |
||
⚫ | |||
while |
|||
next_prime_digit_number |
next_prime_digit_number |
||
dup is_prime? |
dup is_prime? |
||
until ; |
|||
⚫ | |||
: spds_print ( n -- ) |
|||
⚫ | |||
spds_next |
|||
⚫ | |||
loop |
|||
⚫ | |||
: spds_nth ( n -- n ) |
: spds_nth ( n -- n ) |
||
0 swap 0 do spds_next loop ; |
|||
>r 0 |
|||
begin |
|||
r@ 0 > |
|||
while |
|||
next_prime_digit_number |
|||
⚫ | |||
repeat |
|||
rdrop ; |
|||
." First 25 SPDS primes:" cr |
." First 25 SPDS primes:" cr |