Anonymous user
Smarandache prime-digital sequence: Difference between revisions
m
→{{header|Haskell}}
No edit summary |
|||
Line 685:
main = do
printf "The first 25 SPDS:\n%s\n\n" $ f smarandache
mapM_ (uncurry (printf "The %
nextSPDSTerms [100, 1_000, 10_000, 100_000]
where
Line 694:
[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]
The
The 1,
The 10,
The 100,
./smarandache_optimized 1.
</pre>
=={{header|J}}==
Prime numbers have a built-in verb p: . It's easy and quick to get a list of prime numbers and determine which are composed entirely of the appropriate digits.
| |||