Algorithm 163: modified Hankel function

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... View More