16.a Combinations Flashcards

(22 cards)

1
Q

What is the difference between combinations and permutations?

A

In combination questions it does not matter in which order a task is completed.

In permutation questions the order in which a task is completed matters.

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

What do combination questions ask?

A

To count the number of possible ways in which a task can be performed when the order in which the task is accomplished does NOT matter.

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

What problem is this, permutation or combination?

“There are 4 different types of coffee to choose from, if we must choose two different coffees to drink, how many different coffee selections are possible that morning?”

A

Combination,

Order does NOT matter

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

What problem is this, permutation or combination?

“There are 4 different types of coffee to choose from, if we must choose two different coffees to drink and the order in which you drink them, how many different coffee selections are possible that morning?”

A

Permutation

Order MATTERS

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

What problem is this, permutation or combination?

“A tycoon has 10 different sports cars in his garage. How many possible ways are there for him to arrange three of the cars in a line?”

A

PERMUTATION

In this case we are lining up the cars, so order does matter.

Imagine, Mustang-Corvette-Ferrari,

that differs from:
Corvette-Ferrari-Mustang

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

What problem is this, permutation or combination?

“At an airport gate, how many different groups of three people could be chosen from a standby list of eight people?”

A

Combination problem

Order does NOT matter

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

What problem is this, permutation or combination?

“A club has 12 members, the officers in the club are President, Secretary and Treasurer. In how many ways could these three positions be filled from the membership?”

A

PERMUTATION

Order does matter.
eg. choosing Karl as president, Laura as secretary and Rory as treasurer, is different to: Laura as president, Rory as secretary and Karl as treasurer

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

What is the basic Combination Formula?

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

Explain this

A

n = number of objects from which we will choose
k = the number of objects we will actually choose

this formula applies to situations known as “n choose k”

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

Fill in this formula if you have to select 5 items from a pool of 10 items?

A

5 items from a pool of 10
“10, choose 5” (“n choose k”)

n = 10
k = 5

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

What is the shortcut “box and fill” method?

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

What is a “handshake” question?

A

Any counting question that asks us to determine the number of ways to connect any two members of a group while also meeting any restrictions that may exist

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

Solve this:

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

What is the handshake formula?

A

where:

n = number of entities
k = number of entities each entity is connected to

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

Solve:

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

If each entity is only connected to a portion of the total entities, what method must you use?

A

The handshake formula

19
Q

What can you do when dealing with very large numbers?

A

Use the combination equivalent formula

20
Q

What is the Combination Equivalent Formula?