Re: [PEPr] +1 for Math::Math_Combinatorics
| From: | Jesus M. Castagnetto | Date: | Fri, 11 May 2007 19:40:29 +0000 |
| Subject: | Re: [PEPr] +1 for Math::Math_Combinatorics | ||
| References: | 1 | Groups: | php.pear.dev |
| Request: | Send a blank email to pear-dev+get-46735@lists.php.net to get a copy of this message | ||
Hi David
--- David Sanders <dsanders@baselinesolutions.com.au> wrote:
>
> > It would be cool to have also a separate method to calculate the number of
> > elements resulting of a given combinatoric, with no need to generate the
> > whole set of elements.
>
> Yes, I've thought of this possibility. Thanks for your input :)
This will be extremelly useful, and the factorial rules are not that
problematic. Only thing is that if you are going to deal with big numbers, then
you might want to look at bcmath and/or gmp, which is what I use for
Math_Integer and Math_Fibonacci.
Will look at your code over the weekend.
Cheers.
--
Jesus M. Castagnetto (jcastagnetto@yahoo.com)
Web site: http://www.castagnetto.org/
Research: http://metallo.scripps.edu/
PEAR stuff: http://pear.php.net/user/jmcastagnetto
____________________________________________________________________________________
Sucker-punch spam with award-winning protection.
Try the free Yahoo! Mail Beta.
http://advision.webevents.yahoo.com/mailbeta/features_spam.html