Anonymous user
Talk:Emirp primes: Difference between revisions
→reason for 3 invokes: --- possible solution to spec.
m (→Candidates) |
(→reason for 3 invokes: --- possible solution to spec.) |
||
Line 45:
-----
Naive suggestion: This task requires that the same program, in separate runs, should output the first ''i'' emirps in numerical order, all the emirps between ''j'' and ''k'' inclusive in numerical order and the ''n''th emirp, where ''i, j, k'' and ''n'' should be taken from the command line, from user input, from a dialog box or from some other mechanism appropriate to the conventional usage of the language of implementation. Suggested values for ''i, j, k'' and ''n'' are 20, 7000, 8000 and 10000 respectively.
--[[User:Brnikat|Brnikat]] ([[User talk:Brnikat|talk]]) 20:32, 11 July 2015 (UTC)
===New task: [[Extensible prime generator]]===
| |||