commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Paul Libbrecht <>
Subject Re: [math] Prime Numbers Library.
Date Sat, 11 Mar 2006 22:01:57 GMT
I would fear of a library providing such functionality be enormous... 
any modularity in commons-math planned ?


Sharon Lourduraj wrote:
> Prime Number Theory is a huge subject. To start of with we can focus 
> on implementing prime finding methods, such as divide by odd numbers 
> up to the square root of a number, divide by primes up to the square 
> root of a number and Sieve of Eratosthenes. As we move along, we can 
> implement prime finding of specific types, Mersenne Prime, Twin 
> Primes, Palindromic Primes etc. And as we move along with those 
> implementations, we can introduce Primality Proving algorithms.
> Some sites:
> Basic Prime Number finding - 
> Prime Numbers - (good 
> site to learn the ins/outs of prime numbers)
> Primality Proving -
> Also, we can work on implementing optimized algorithms...I think that 
> would be fun. The practical purpose of Prime Numbers can be extended 
> into encryption/decryption algorithms, but implementing those 
> algorithms might be beyond the scope of this project.
> Thanks,
> -Sharon
> Phil Steitz wrote:
>> This sounds interesting. Can you describe a little more what
>> algorithms you are thinking about implementing?  Online references to
>> point us to a common set of definitions for discussion purposes would
>> be great.
>> Also, if you have not aldeady read this, have a look at
>> for info on how
>> to get set up, etc.
>> Thanks!
>> Phil

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message