#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: |
-----------------------------+----------------------------------------------
Twin primes are pairs of primes that differ by 2. Currently the twin
prime counting function, which counts the number of twin primes less than
a given x, is not implemented in Sage, Mathematica, or other computer
algebra systems. Where it is calculated, the method used is mere sieving.
Use the approach of #7013 and #7539 to make a competitive (if not the only
available as general purpose software) implementation of the twin prime
counting function. It should be at least 1000-10000 times faster than
mere sieving.
(possible names are twin_prime_pi and prime_pi2).
Implement next_twin_prime, is_twin_prime, is_chen_prime, is_semi_prime
functions
Other types of primes such as cousin primes, prime triplets, and sexy
primes could also be considered.
Maybe could also try to compute partial sums of Brun's constant or prime
harmonics sums.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7613>
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.
