Hello, It seems there is no open source library providing support for integer factorization, what about implementing it in commons.math ?
At the moment I am just considering to contribute a rather naive implementation to factor int type only (with longs, we can feel that such approach is slow). The method would have the following signature: public static int[] getPrimeFactors(int n) (or something similar) Regards, Sebastien -------------------------------------------------------------------- mail2web - Check your email from the web at http://link.mail2web.com/mail2web --------------------------------------------------------------------- To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org For additional commands, e-mail: dev-h...@commons.apache.org
