For inputs n and k (in that order), output the number of ways that k objects can be chosen from amongst n distinct objects. [The order of the selected objects is irrelevant.]
For example, suppose you have 4 blocks: red, green, blue, yellow. How many ways are there to select 2 of them? There are 6 ways: RG, RB, RY, GB, GY, BY. [Remember the ordering is irrelevant, so GR is equivalent to RG, and therefore does not count as a distinct choice.]
So, function(4,2) ---> 6.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers475
Suggested Problems
-
Maximum running product for a string of numbers
2257 Solvers
-
Back to basics 11 - Max Integer
811 Solvers
-
How long is the longest prime diagonal?
412 Solvers
-
Convert from Base 10 to base 5
282 Solvers
-
Find out sum of all elements of given Matrix
535 Solvers
More from this Author23
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Why in my pc showing correct but not in this
@Sumit, you are probably using a function from a toolbox (e.g. statistics toolbox) that is not available to Cody.
http://onlinestatbook.com/2/probability/permutations.html