Honaker primes: Difference between revisions
Added Easylang
m (Minor code improvement.) |
(Added Easylang) |
||
Line 570:
</pre>
=={{header|EasyLang}}==
<syntaxhighlight>
fastfunc isprim num .
i = 2
while i <= sqrt num
if num mod i = 0
return 0
.
i += 1
.
return 1
.
global prims[] .
proc mkprimes . .
prims[] = [ 2 ]
i = 3
while len prims[] < 10000
if isprim i = 1
prims[] &= i
.
i += 2
.
.
mkprimes
#
func digsum n .
while n > 0
sum += n mod 10
n = n div 10
.
return sum
.
i = 1
while count < 50
if digsum i = digsum prims[i]
write "(" & i & " " & prims[i] & ") "
count += 1
.
i += 1
.
</syntaxhighlight>
=={{header|F_Sharp|F#}}==
Line 590 ⟶ 632:
(286069, 4043749)
</pre>
=={{header|Factor}}==
{{works with|Factor|0.99 2022-04-03}}
| |||