Well really a vague statement (to me)
What is the basic expression to calculate:
- “The number of combinations of n things taken k at a time as an integer”
Edit:
A little more clarification:
“For example, the combinations of four items a,b,c,d taken three at a time are abc, abd, acd, and bcd. In other words, there are a total of four different combinations of four things “taken three at a time”.”
I’m taking a non introductory C class while attempt to complete my math requirements to transfer for a CS degree. I am getting very high scores on all of my work thus far, but when higher level math comes up I really get stuck. But I digress..
The range of numbers would be 1-10 for n
and k‘s range would be 1-4.
Below is the only reference I have received and it is way over my head.
http://www.themathpage.com/aPreCalc/permutations-combinations-2.htm
The basic expression is n!/(k!(n-k)!). An efficient way to calculate this is to use a 2D DP table of pascal’s triangle.