Revision as of 07:41, 12 December 2018 view source Alextretyak (talk \| contribs) 1,481 edits Added 11l ← Older edit		Revision as of 12:22, 19 December 2018 view source Nigel Galloway (talk \| contribs) 2,184 edits Well p318? why just mınje Newer edit →
Line 136: =={{header\|F_Sharp\|F#}}== {{incorrect\|F_SharpTask asks for a specific number of terms that would stop excessive output - check other solutions and task description if in doubt.}}▼ ;The Function: This task uses [http://www.rosettacode.org/wiki/Extensible_prime_generator#The_function Extensible Prime Generator (F#)] Line 478 ⟶ 477: =={{header\|Julia}}== ▲{{incorrect\|~~F_SharpTask~~JuliaTask asks for a specific number of terms that would stop excessive output - check other solutions and task description if in doubt.}} <lang julia>using Primes, Combinatorics Line 687: =={{header\|REXX}}== {{incorrect\|REXXTask asks for a specific number of terms that would stop excessive output - check other solutions and task description if in doubt.}} This REXX version is using a modified version of a highly optimized   ''proper divisors''   function.

Anti-primes: Difference between revisions