Smarandache prime-digital sequence: Difference between revisions
Smarandache prime-digital sequence (view source)
Revision as of 15:39, 25 February 2024
, 2 months agoAdded Easylang
(Added Easylang) |
|||
| (2 intermediate revisions by 2 users not shown) | |||
Line 624:
</pre>
=={{header|EasyLang}}==
<syntaxhighlight>
fastfunc isprim num .
i = 2
while i <= sqrt num
if num mod i = 0
return 0
.
i += 1
.
return 1
.
n = 2
repeat
if isprim n = 1
h = n
while h > 0
d = h mod 10
if d < 2 or d = 4 or d = 6 or d > 7
break 1
.
h = h div 10
.
if h = 0
cnt += 1
if cnt <= 25
write n & " "
.
.
.
until cnt = 100
n += 1
.
print ""
print n
</syntaxhighlight>
{{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|F_Sharp|F#}}==
Line 929 ⟶ 972:
{{FormulaeEntry|page=https://formulae.org/?script=examples/Smarandache_prime-digital_sequence}}
'''Solution'''
[[File:Fōrmulæ - Smarandache prime-digital sequence 01.png]]
'''Case 1. Show the first 25 SPDS primes'''
[[File:Fōrmulæ - Smarandache prime-digital sequence 02.png]]
[[File:Fōrmulæ - Smarandache prime-digital sequence 03.png]]
'''Case 2. Show the hundredth SPDS prime'''
[[File:Fōrmulæ - Smarandache prime-digital sequence 04.png]]
[[File:Fōrmulæ - Smarandache prime-digital sequence 05.png]]
'''Additional cases. Show the 1000-th, 10,000-th and 100,000th SPDS primes'''
[[File:Fōrmulæ - Smarandache prime-digital sequence 06.png]]
[[File:Fōrmulæ - Smarandache prime-digital sequence 07.png]]
[[File:Fōrmulæ - Smarandache prime-digital sequence 08.png]]
[[File:Fōrmulæ - Smarandache prime-digital sequence 09.png]]
[[File:Fōrmulæ - Smarandache prime-digital sequence 10.png]]
[[File:Fōrmulæ - Smarandache prime-digital sequence 11.png]]
=={{header|Go}}==
Line 2,231 ⟶ 2,304:
{{libheader|Wren-math}}
Simple brute-force approach.
<syntaxhighlight lang="
var limit = 1000
| |||