Purchase Solution

Combinations: Picking K out of N

Not what you're looking for?

Ask Custom Question

Baskin Robbins serves "31 Flavors" of ice cream. How many different two-scoop ice cream cones are possible if two different flavors are used on each cone and the order of the scoops doesn't matter?* (* Means chocolate on top and vanilla on the bottom is the same as chocolate on the bottom and vanilla on top.)

Purchase this Solution
Solution Summary

The solution shows how to reach the answer first by simple plug-n-chug and then explains how to do it using simple principles.

Solution Preview

Hello and thank you for posting your question to Brainmass.

This is a "pick k out of n" problem.

with no order, it is:

C(k,n)=n!/[k!*(n-k)!]

Where n! is n factorial:

n! = ...

Purchase this Solution
Free BrainMass Quizzes
Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Probability Quiz

Some questions on probability

View More Free Quizzes
Related BrainMass Solutions

  • permutation and combination

    In contrast, the number of combinations is the number of ways to pick k items from a list of n objects where the order is unimportant.

  • Vectors, graphs, and counting

    How many different 6-number combinations are there for the drawing? If you buy one ticket, what is your probability of winning (6 out of 6)? (Note: You are picking six different numbers.) 3b.

  • Indiana State Shipments

    We have the following formula: The combinations of choosing k parts out of n is Cn,k=n!/(k!*(n-k)! ), where n!=1*2*3*4*...(n-1)*n Thus the combinations of choosing 3 parts out of 14 is C14,3= 14!/(3!*(14-3)!)

  • Conditional probability, combinations, permutations

    /(n-m)! Find the number of possible combinations of picking 2 items out of 6.

  • Probability of Picking Groups of Cards

    Define C(n,k)=n!/[k!(n-k)!]. For example, C(3,2)=3!/2!=3 and C(5,2)=5!/(3!*2!)=10. If we choose a hand of 13 cards dealt from a well shuffled pack of 52, there are C(52,13) possible cases. (a) Exactly two kings and one ace.

  • Counting the number of 5 card poker hands

    "n choose k" = n!/[(n-k)!k!], represents the number of possible combinations of n objects taken r at a time. Now just plug what we know into this formula. "52 choose 5" = 52!/[(52-5)!5!].

  • How many outcomes for The Big Triple are possible at the racetrack with 12 horses?

    This question asks you for the total possible number of orderings (1st place, 2nd place, 3rd place) for 12 horses total. To figure out this question you must apply the appropriate formula: the "choose" formula: N "choose" k = N! / (k!(N-k)!)

  • Using Probability to solve a genetic problems

    If for the first place we have k choices, for the second place we have m choices, for the third n choices and for the fourth p choices the total number of combinations is simply: N = k x m x n x p In our case k = 2 (A or a) m = 1 (just b)

  • Combinations in Committees and Groups

    No of ways of choosing the chairperson = no of ways of choosing 1 out of n = n ways Remaining people= n - 1 Out of these people (k-1) non chair members are to be chosen no of ways of choosing k-1 out of n-1 = (n-1 choose k-1) or = n-1C k-1

View More Related Solutions