Is there a python module that includes functions for working with prime
numbers? I mainly need A function that returns the Nth prime number and
that returns how many prime numbers are less than N, but a prime number
tester would also be nice. I'm dealing with numbers in the 10^610^8 range
so it would have to fairly efficient
Dag 36 8363
Dag wrote: Is there a python module that includes functions for working with prime numbers? I mainly need A function that returns the Nth prime number and that returns how many prime numbers are less than N, but a prime number tester would also be nice. I'm dealing with numbers in the 10^610^8 range so it would have to fairly efficient
gmpy is pretty good for this sort of thing, but the primitives it gives
you are quite different  is_prime to check if a number is prime, and
next_prime to get the smallest prime number larger than a given number.
You'd have to build your own caching on top of this to avoid repeating
computation if you need, e.g., "how many primes are < N" for several
different values of N; and I'm not even sure that gmpy's primitives are
optimal for this (compared with, for example, some kind of sieving).
Anyway, with all of these caveats, here's an example function:
import gmpy
def primes_upto(N):
count = 0
prime = gmpy.mpz(1)
while prime < N:
prime = prime.next_prim e()
count += 1
return count
and having saved it in pri.py, here's what I measure in terms of time:
[alex@lancelot python2.3]$ python timeit.py s 'import pri' s 'M=1000*1000'
\ 'pri.primes_upt o(M)'
10 loops, best of 3: 2.76e+06 usec per loop
[alex@lancelot python2.3]$ python timeit.py s 'import pri' s
'M=2*1000*1000' 'pri.primes_upt o(M)'
10 loops, best of 3: 4.03e+06 usec per loop
i.e., 2.76 seconds for primes up to 1,000,000  about 4 seconds
for primes up to 2,000,000. (This is on my good old trusty Athlon
Linux machine, about 30 months old now and not topspeed even when
new  I'm sure one of today's typical PC's might take 2 or 3
times less than this, of course). If I was to use this kind of
computation "in production", I'd precompute the counts for some
typical N of interest and only generate and count primes in a
narrow band, I think; but it's hard to suggest anything without a
better idea of your application.
Alex
On Mon, 29 Sep 2003 14:53:34 GMT, Dag <da*@velvet.net > wrote: Is there a python module that includes functions for working with prime numbers? I mainly need A function that returns the Nth prime number and that returns how many prime numbers are less than N, but a prime number tester would also be nice. I'm dealing with numbers in the 10^610^8 range so it would have to fairly efficient
Dag
I just wrote a fairly simple sieve, which gave primes up to 1,000,000
in a few seconds (1.8GHz P4, Python code). There were 78498 primes in
that range (unless I screwed the code up, but it looked OK for smaller
ranges).
Going for 10^7 took too long for my patience, let alone 10^8, but at
least in theory there should be less than 100 times as many primes in
the range up to 10^8.
So here's the thought  a binary file containing a complete list of
primes up to 10^8 would require roughly 30MB (using 32 bit integers,
which should comfortably handle your requirement). Open in random
access and do a binary search to find a particular prime and the
position in the file should tell you how many primes are smaller than
that one.
30MB shouldn't be too prohibitive on todays machines, though if this
is to be distributed to other people there would of course be issues.

Steve Horne
steve at ninereeds dot fsnet dot co dot uk
Stephen Horne <$$$$$$$$$$$$$$ $$$@$$$$$$$$$$$ $$$$$$$$$.co.uk > wrote previously:
I just wrote a fairly simple sieve, which gave primes up to 1,000,000
in a few seconds (1.8GHz P4, Python code). There were 78498 primes in
that range...at least in theory there should be less than 100 times as
many primes in the range up to 10^8.
Quite a few less, actually. Under Gauss' Prime Number Theorem, an
approximation for the number of primes less than N is N/ln(N). I know
there have been some slight refinements in this estimate since 1792, but
in the ranges we're talking about, it's plenty good enough.
So I only expect around 5,428,681 primes less than 10^8 to occur. Well,
that's not SO much less than 7.8M.
So here's the thought  a binary file containing a complete list of
primes up to 10^8 would require roughly 30MB (using 32 bit integers,
which should comfortably handle your requirement).
I wonder if such a data structure is really necessary. Certainly it
produces a class of answers quite quickly. I.e. search for a prime, and
its offset immediately gives you the number of primes less than it.
Heck, searching for any number, even a composite occurring between
primes, works pretty much the same way. Of course, the above
approximation gives you a close answer even quicker.
But if you are worried about disk storage, one easy shortcut is to store
a collection of 16bit differences between successive primes. That's
half the size, and still lets you answer the desired question *pretty*
quickly (extra addition is required)... or at least generate a local
copy of Horne's data structure in one pass.
Moving farther, even this gap structure is quite compressible. Most
gaps are quite a bit smaller than 65536, so the highbits are zeros. In
fact, I am pretty sure that almost all the gaps are less than 256. So
an immediate compression strategy (saving disk space, costing time to
recreate the transparent structure) is to store gaps as 8bit values,
with a x00 byte escaping into a larger value (I guess in the next two
bytes).
Maybe I'll try it, and see how small I can make the data... unless I do
my real work :).
Yours, Lulu...

Keeping medicines from the bloodstreams of the sick; food from the bellies
of the hungry; books from the hands of the uneducated; technology from the
underdeveloped; and putting advocates of freedom in prisons. Intellectual
property is to the 21st century what the slave trade was to the 16th.
"Lulu of the LotusEaters" <me***@gnosis.c x> wrote in message Moving farther, even this gap structure is quite compressible. Most gaps are quite a bit smaller than 65536, so the highbits are zeros. In fact, I am pretty sure that almost all the gaps are less than 256. So an immediate compression strategy (saving disk space, costing time to recreate the transparent structure) is to store gaps as 8bit values, with a x00 byte escaping into a larger value (I guess in the next two bytes).
You can take this to 512 knowing that the gaps will always be an even
interval.
Emile
Lulu of the LotusEaters wrote: Stephen Horne <$$$$$$$$$$$$$$ $$$@$$$$$$$$$$$ $$$$$$$$$.co.uk > wrote previously: I just wrote a fairly simple sieve, which gave primes up to 1,000,000 in a few seconds (1.8GHz P4, Python code). There were 78498 primes in that range...at least in theory there should be less than 100 times as many primes in the range up to 10^8.
Quite a few less, actually. Under Gauss' Prime Number Theorem, an approximation for the number of primes less than N is N/ln(N). I know there have been some slight refinements in this estimate since 1792, but in the ranges we're talking about, it's plenty good enough.
So I only expect around 5,428,681 primes less than 10^8 to occur. Well, that's not SO much less than 7.8M.
So here's the thought  a binary file containing a complete list of primes up to 10^8 would require roughly 30MB (using 32 bit integers, which should comfortably handle your requirement).
I wonder if such a data structure is really necessary. Certainly it produces a class of answers quite quickly. I.e. search for a prime, and its offset immediately gives you the number of primes less than it. Heck, searching for any number, even a composite occurring between primes, works pretty much the same way. Of course, the above approximation gives you a close answer even quicker.
But if you are worried about disk storage, one easy shortcut is to store a collection of 16bit differences between successive primes. That's half the size, and still lets you answer the desired question *pretty* quickly (extra addition is required)... or at least generate a local copy of Horne's data structure in one pass.
Moving farther, even this gap structure is quite compressible. Most gaps are quite a bit smaller than 65536, so the highbits are zeros. In fact, I am pretty sure that almost all the gaps are less than 256. So an immediate compression strategy (saving disk space, costing time to recreate the transparent structure) is to store gaps as 8bit values, with a x00 byte escaping into a larger value (I guess in the next two bytes).
Maybe I'll try it, and see how small I can make the data... unless I do my real work :).
I believe you could implement a hybrid scheme that would be quite fast
and still maintain nearly the same level of compression that you
describe above. In addition to the above compressed data, also store,
uncompressed, every Nth prime. A binary search will get you within N
primes of your answer, to find the exact value, recreate those Nprimes.
For a N of, for instance, 64 the level of compression would be minimally
affected but should make finding the number of primes less than a given
number number much faster than the basic compressed scheme.
In fact I wouldn't be suprised if this was faster than the uncompressed
scheme since you're less likely to thrash your memory.
tim
Yours, Lulu...
 Keeping medicines from the bloodstreams of the sick; food from the bellies of the hungry; books from the hands of the uneducated; technology from the underdeveloped; and putting advocates of freedom in prisons. Intellectual property is to the 21st century what the slave trade was to the 16th.
Lulu of the LotusEaters wrote: So I only expect around 5,428,681 primes less than 10^8 to occur. Well, that's not SO much less than 7.8M.
I found 5,761,455 primes < 1E8.
// Klaus
<> unselfish actions pay back better
Hello Dag, Is there a python module that includes functions for working with prime numbers? I mainly need A function that returns the Nth prime number and that returns how many prime numbers are less than N, but a prime number tester would also be nice. I'm dealing with numbers in the 10^610^8 range so it would have to fairly efficient
Try gmpy ( http://gmpy.sourceforge.net/)
HTH.
Miki This thread has been closed and replies have been disabled. Please start a new discussion. Similar topics 
by: lostinpython 
last post by:
I'm having trouble writing a program that figures out a prime number.
Does anyone have an idea on how to write it? All I know is that n > 2
is prim if no number between 2 and sqrt of n (inclusivly) evenly
divides n.

by: don 
last post by:
Ok, this is a homework assignment, but can you help me out anyway...... I
need a routine for figuring out if a number inputted by the user is a prime
number or not...... all I'm asking for is Not the exact code ( well maybe a
little) but the logic or algorithm to tell whether or not a number is
prime....

by: Hystou 
last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can effortlessly switch the default language on Windows 10 without reinstalling. I'll walk you through it.
First, let's disable language...

by: Oralloy 
last post by:
Hello folks,
I am unable to find appropriate documentation on the type promotion of bitfields when using the generalised comparison operator "<=>".
The problem is that using the GNU compilers, it seems that the internal comparison operator "<=>" tries to promote arguments from unsigned to signed.
This is as boiled down as I can make it. ...

by: jinu1996 
last post by:
In today's digital age, having a compelling online presence is paramount for businesses aiming to thrive in a competitive landscape. At the heart of this digital strategy lies an intricately woven tapestry of website design and digital marketing. It's not merely about having a website; it's about crafting an immersive digital experience that...
 
by: Hystou 
last post by:
Overview:
Windows 11 and 10 have less user interface control over operating system update behaviour than previous versions of Windows. In Windows 11 and 10, there is no way to turn off the Windows Update option using the Control Panel or Settings app; it automatically checks for updates and installs any it finds, whether you like it or not. For...

by: isladogs 
last post by:
The next Access Europe User Group meeting will be on Wednesday 1 May 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM).
In this session, we are pleased to welcome a new presenter, Adolph Dupré who will be discussing some powerful techniques for using class modules.
He will explain when you may want to use classes...

by: conductexam 
last post by:
I have .net C# application in which I am extracting data from word file and save it in database particularly. To store word all data as it is I am converting the whole word file firstly in HTML and then checking html paragraph one by one.
At the time of converting from word file to html my equations which are in the word document file was convert...

by: adsilva 
last post by:
A Windows Forms form does not have the event Unload, like VB6. What one acts like?

by: muto222 
last post by:
How can i add a mobile payment intergratation into php mysql website.

by: bsmnconsultancy 
last post by:
In today's digital era, a welldesigned website is crucial for businesses looking to succeed. Whether you're a small business owner or a large corporation in Toronto, having a strong online presence can significantly impact your brand's success. BSMN Consultancy, a leader in Website Development in Toronto offers valuable insights into creating...
 