Combinations And Permutations Flashcards

1
Q

When the data points of a particular set are not all the same, what will the standard deviation not be equal to?

A

0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

When is it a combination?

A

The order in which a task is completed does not matter

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

When is it a permutation?

A

The order in which a task is completed does matter.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the basic combination formula?

A

nCk = n! / (n-k)!k!

“N choose k”

Box & Fill Method:
Put a box for each decision. In each box put the # of players available for selection (should be lower with each decision). Then divide by the factorial of the total # of decisions.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

If there are m ways to perform task 1 and n ways to perform task 2 and the tasks are independent, how many ways are there to perform both tasks together?

A

m * n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What are mutually exclusive events?

A

Events that cannot occur together

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

If there are x ways to accomplish event a and y ways to accomplish event b and if a and b are mutually exclusive, then how many ways are there to accomplish a OR b

A

x+y

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

“At least” means what?

And when you see “at least”, what does this usually mean?

A

= greater than or equal to

Typically involve addition of outcomes (or)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

In combination problems, how do you solve when certain items MUST be selected.

A

Visualize as if the items that must be selected have already been selected. So your n (from n chose k) would be n-# that must be selected and your k would be k-# that must be selected

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

In combination problems, how do you solve when certain items MUST NOT be selected.

A

Visualize as if the items that must not be selected are excluded from the pool. So your n (from n chose k) would be n-# that must not be selected and your k would be unchanged.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What does it mean when two events are collectively exhaustive?

When two events are collectively exhaustive , the total # of ways in which the scenario can occur =

A

When the events represent all of the potential outcomes of the situation.

of ways in which a can occur + number of ways in which b can occur

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What must you remember when calculating the number of ways in which at least one of x items must be chosen from y items?

A

Total # of ways to choose x items from y items - the number of way to choose none of the x items from y items = the number of ways to chose at least one of the x items from y

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

How do you solve dependent combinations?

A

The act of choosing the first combination limits the pool when choosing the subsequent combination

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is the easiest way to calculate an unknown number of items in a group?

A

Set up a box and fill diagram

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is the sum of all the numbers which can be formed by using n digits without repetition??

A

(n-1)!(sum of the digits)(111…n times)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is the sum of all the numbers that can be formed by using n digits (with repetition of digits being allowed)?

A

n^(n-1)(sum of digits)(111… n times)