#7613: twin prime class
-----------------------------+----------------------------------------------
Reporter: kevin.stueve | Owner: was
Type: task | Status: new
Priority: major | Milestone: sage-4.3
Component: number theory | Keywords: twin primes counting, sieving
Work_issues: | Author:
Upstream: N/A | Reviewer: kevin.stueve,was,rohana
Merged: |
-----------------------------+----------------------------------------------
Comment(by kevin.stueve):
After thinking about this some more, this problem seems easier than I had
first realized. You do not need to sieve out all non twin primes to
calculate the twin prime counting function.
As sieving is likely much more computationally demanding than iterating
over a bit array, it would be a better to sieve out primes, then iterate
through your bit array, noting each twin prime, prime triplet, etc as the
case may be.
Kevin Stueve
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7613#comment:3>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
