Talk:Primality by trial division: Difference between revisions
Talk:Primality by trial division (view source)
Revision as of 16:36, 11 September 2014
, 9 years ago→Extending the task to producing ranges of primes, optionally.: new section
m (→"simplest"?: corrected an indention as per convention. -- ~~~~) |
|||
Line 18:
This task can also be handled by the [http://tnt.math.se.tmu.ac.jp/nzmath/ NZMATH] modules prime and arith1 to enable its trialDivision function.----[[User:Billymac00|Billymac00]] 02:42, 3 January 2011 (UTC)
: As I noted in [[Talk:Sieve of Eratosthenes]], feel free to add a code example, as long as there's already an example that satisfies the task description as-written. --[[User:Short Circuit|Michael Mol]] 04:19, 3 January 2011 (UTC)
== Extending the task to producing ranges of primes, optionally. ==
I propose the task description is amended (what is the correct procedure for this?).
The following to be added:
"Optionally, use trial division to produce sequences of prime numbers."
-- [[User:WillNess|WillNess]] ([[User talk:WillNess|talk]]) 16:36, 11 September 2014 (UTC)
| |||