Smarandache prime-digital sequence: Difference between revisions
added Quackery optimised version
(Added Quackery.) |
(added Quackery optimised version) |
||
Line 1,617:
<code>isprime</code> is defined at [[Primality by trial division#Quackery]].
===Naive===
<lang Quackery> [ true swap
Line 1,643 ⟶ 1,645:
33223</pre>
===Optimised===
Not the same as the Factor and Factor inspired solutions, which count in base 4 with leading zeros like a telescoping pedometer; this skips over base 5 numbers with zeros in them.
<lang Quackery> [ 0 over
[ 5 /mod 0 = while
dip [ 5 * 1+ ]
again ]
drop + ] is skipzeros ( n --> n )
[ [] swap
[ 5 /mod
[ table 0 2 3 5 7 ]
rot join swap
dup 0 = until ]
swap witheach
[ swap 10 * + ] ] is primedigits ( n --> n )
[ temp put [] 0
[ 1+ skipzeros
dup primedigits
dup isprime iff
[ swap dip join ]
else drop
over size
temp share = until ]
temp release drop ] is spds ( n --> [ )
100 spds
25 split swap echo
cr cr
-1 peek echo</lang>
{{out}}
<pre>[ 2 3 5 7 23 37 53 73 223 227 233 257 277 337 353 373 523 557 577 727 733 757 773 2237 2273 ]
33223</pre>
=={{header|Raku}}==
| |||