I would fear of a library providing such functionality be enormous...
any modularity in commonsmath planned ?
paul
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 
> http://www.troubleshooters.com/codecorn/primenumbers/primenumbers.htm
> Prime Numbers  http://mathworld.wolfram.com/PrimeNumber.html (good
> site to learn the ins/outs of prime numbers)
> Primality Proving  http://primes.utm.edu/
>
> 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
>> http://jakarta.apache.org/commons/math/developers.html for info on how
>> to get set up, etc.
>>
>> Thanks!
>>
>> Phil
>>

To unsubscribe, email: commonsdevunsubscribe@jakarta.apache.org
For additional commands, email: commonsdevhelp@jakarta.apache.org
