Revision as of 17:05, 4 November 2023 (view source) Chkas (talk \| contribs) (Added Easylang) ← Older edit		Revision as of 17:31, 4 November 2023 (view source) Chkas (talk \| contribs) (→‎{{header\|EasyLang}}) Newer edit →
Line 573: =={{header\|EasyLang}}== <syntaxhighlight> fastfunc ~~isprim~~nextprim num . ~~i = 2~~repeat ~~while~~ i <= ~~sqrt num~~2 ifwhile i <= sqrt num and num mod i =<> 0 ~~return~~i 0+= 1 . until num mod i +=<> 10 inum += 21▼ . return 1num . ~~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 Line 603 ⟶ 591: return sum . ▲proc ~~mkprimes~~show . . ~~i = 1~~ ▲ i = 31 ~~while count < 50~~ ipri += 12▼ ~~if digsum i = digsum prims[i]~~ ▲ while ~~len prims[]~~count < ~~10000~~50 write "(" & i & " " & prims[i] & ") "▼ ~~count~~if digsum i += 1digsum pri ▲ write "(" & i & " " & ~~prims[i]~~pri & ") " ▲ ~~prims[]~~count &+= i1 ▲ . ▲ ~~if isprim~~ i += 1 pri = nextprim (pri + 1) . ▲ i += 1 . show </syntaxhighlight>

Honaker primes: Difference between revisions

Honaker primes (view source)