## The Mathematical-Function Computation Handbook

- Nelson H. F. Beebe
- Springer International Publishing
- 2017

integer procedure combination (m, n) ; value n; integer m, n; eommeut calculates the number of combinations of m things taken n at a tinm. If n is less than half of m, then the program calculates the combinations of m things taken m-n at a time which is the exact equivalent of m things taken n at a time; fort := 2step 1 untilp do r := (r X (n+i))/i; comment… (More)

Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=366537.