Talk:Evaluate binomial coefficients: Difference between revisions
Content added Content deleted
(→Task Needs Refinement: Cool!) |
|||
| Line 2: | Line 2: | ||
The task needs more work. I've made the math look nicer, but it would help if we had some particular values to try to calculate too; I've done binom(60,30), but that requires a non-trivial component somewhere — even the result won't fit in 32-bit ints, let alone any intermediate values — so I don't know if it is really suitable as an actual task. –[[User:Dkf|Donal Fellows]] 00:39, 12 April 2010 (UTC) |
The task needs more work. I've made the math look nicer, but it would help if we had some particular values to try to calculate too; I've done binom(60,30), but that requires a non-trivial component somewhere — even the result won't fit in 32-bit ints, let alone any intermediate values — so I don't know if it is really suitable as an actual task. –[[User:Dkf|Donal Fellows]] 00:39, 12 April 2010 (UTC) |
||
I've refined this task a bit, and made it binom(5,3), okay? --[[User:Alegend|Alegend]] 01:03, 12 April 2010 (UTC) |
: I've refined this task a bit, and made it binom(5,3), okay? --[[User:Alegend|Alegend]] 01:03, 12 April 2010 (UTC) |
||
:: That's great. Thanks! –[[User:Dkf|Donal Fellows]] 12:52, 12 April 2010 (UTC) |
|||
Revision as of 12:52, 12 April 2010
Task Needs Refinement
The task needs more work. I've made the math look nicer, but it would help if we had some particular values to try to calculate too; I've done binom(60,30), but that requires a non-trivial component somewhere — even the result won't fit in 32-bit ints, let alone any intermediate values — so I don't know if it is really suitable as an actual task. –Donal Fellows 00:39, 12 April 2010 (UTC)
- I've refined this task a bit, and made it binom(5,3), okay? --Alegend 01:03, 12 April 2010 (UTC)
- That's great. Thanks! –Donal Fellows 12:52, 12 April 2010 (UTC)