Sequence of primes by trial division: Difference between revisions

Sequence of primes by trial division (view source)

2 bytes removed , 3 months ago

m

9,476

edits

Revision as of 19:04, 8 September 2023 (view source) Chkas (talk \| contribs) m (→‎{{header\|EasyLang}}) ← Older edit		Latest revision as of 11:28, 4 February 2024 (view source) PureFox (talk \| contribs) m (→‎{{header\|Wren}}: Minor tidy)
(One intermediate revision by one other user not shown)
Line 1,319: =={{header\|Elena}}== ELENA 46.x : <syntaxhighlight lang="elena">import extensions; import system'routines; Line 1,325: isPrime = (n => new Range(2,(n.sqrt() - 1).RoundedInt).allMatchedBy::(i => n.mod:(i) != 0)); Primes = (n => new Range(2, n - 2).filterBy:(isPrime)); public program() Line 3,410: {{libheader\|Wren-fmt}} Using a simple generator. <syntaxhighlight lang="~~ecmascript~~wren">import "./fmt" for Fmt var primeSeq = Fiber.new {