[jira] [Resolved] (MATH-845) Basic number theory features such as primality testing, factorization and prime number generation

["Luc Maisonobe (JIRA)" <ji...@apache.org>]

     [ https://issues.apache.org/jira/browse/MATH-845?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Luc Maisonobe resolved MATH-845.
--------------------------------

    Resolution: Fixed

Fixed in subversion repository as of r1454920.

Patch applied with a few changes:
* replaced assert by comments
* formatting (spaces, braces, control statements on one line...)
* very long performance tests not committed
* updated tests to Junit 4

As the latest comments suggested it would not be easy to extend this package to long or BigIntegers, I have left the Primes class as first proposed, without an upper parameterized interface.

Thanks for the suggestion and for the patch!
                
> Basic number theory features such as primality testing, factorization and prime number generation
> -------------------------------------------------------------------------------------------------
>
>                 Key: MATH-845
>                 URL: https://issues.apache.org/jira/browse/MATH-845
>             Project: Commons Math
>          Issue Type: New Feature
>    Affects Versions: 3.1
>         Environment: ubuntu/java6/intel-i5
>            Reporter: Sebastien Riou
>            Priority: Minor
>              Labels: features
>             Fix For: 3.2
>
>         Attachments: primes-src.zip
>
>   Original Estimate: 24h
>  Remaining Estimate: 24h
>
> A set of static methods to perform primality test, factorization and prime number generation. Currently it is limited to the int data type, extension to long/BigInteger will follow.

--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira

[math] was Re: [jira] [Resolved] (MATH-845) Basic number theory features such as primality testing, factorization and prime number generation

[Thomas Neidhart <th...@gmail.com>]

Hi,

I looked at the code, and I have seen that there are some calculations
with BigInteger.

Even if this is a stupid question, but would Dfp be faster for this?
I did not do any performance tests yet, but wanted to ask if somebody
has more experience.

Thomas

---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
For additional commands, e-mail: dev-help@commons.apache.org