Problem 160. So many choices

Created by the cyclist

Solve Later

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.

Solve

Solution Stats

Last solution submitted on Oct 10, 2019

Last 200 Solutions

Problem Comments

3 Comments

3 Comments

Sumit Agrawal on 10 Sep 2013

Why in my pc showing correct but not in this

the cyclist on 11 Sep 2013

@Sumit, you are probably using a function from a toolbox (e.g. statistics toolbox) that is not available to Cody.

Riccardo Dessì on 25 Feb 2018

http://onlinestatbook.com/2/probability/permutations.html

Solution Comments

Solution 1135935

1 Comment

1 Comment

alexander on 8 Mar 2017

The test suite throws errors where but I get correct answers when I run.

function y = fcn(n,k)
y = size(combntns(1:n,k),1);
end

Solution 14460

1 Comment

1 Comment

Franck Dernoncourt on 30 Jan 2012

Let me import my Statistics Toolbox!
;)

Problem Recent Solvers336

Problem Tags

Problem 160. So many choices

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers336

Suggested Problems

More from this Author23

Problem Tags

Problem 160. So many choices

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers336

Suggested Problems

More from this Author23

Problem Tags

Players