16.c Permutations Flashcards

(30 cards)

1
Q

In a permutation, the ___________ matters

A

In a permutation, the ORDER matters

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

How many permutations are there of ABC?

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

Explain how this is a permutation question

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

What is the “Basic Permutation Formula”?

A

n = number of objects from which a choice can be made
k = number of objects that are to be chosen

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

Solve this question using the formula

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

Solve this question using the “box-and-fill”

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

How do you solve a permutation problem using the box-and-fill method?

A

Let each box represent a specific choice that must be made.
Multiply the numbers in each box.

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

In permutation problems count only the number of _________________ permutations

A

In permutation problems count only the number of DISTINGUISHABLE permutations

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

How many permutations are there of: [S, S, S, S, S]?

A

None!
[S, S, S, S, S]
The entire list has the same letter, thus even if put in another order it would not be distinguishable.

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

How would you solve a permutation problem for the list: [A, A, B, B] ?

A

[ A, A, B, B ]

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

What is the equation used to solve permutation problems that contains identical/ indistinguishable items?

A

N = total number of objects
r = frequency of each indistinguishable object

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

How would you solve a permutation problem for the list: [G, S, P, P, T] ?

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

What are “pathway questions”?

A

Need us to determine the total number of different paths one can take to travel from starting point to some destination

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

What is a “checkpoint”

A

While traveling from a starting point to a destination, a point that travelers MUST pass through

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

How would you tackle this?
Explain the steps.

A

Look in-between the checkpoint how many ways there are.
= Multiply these!

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

Solve:

A

Calculate for the top and bottom, and then add them

17
Q

Conceptually, how would you solve this:

A

Understand that in whatever way you travel, you have to go South 4 times, and East 3 times.

So, the problem becomes: “In how many ways can we arrange 4 S’ and 3 E’s ?

18
Q

Solve this

A

[ S, S, S, S, E, E, E ]

19
Q

Conceptually, explain how you would solve this:

A

Find the number of ways you can travel from Y to C,
Find the number of ways you can travel from C to X,

Multiply the two values for TOTAL

20
Q

How would you solve this?

A

Exact same way as solving a two-dimensional problem,
Just add ANOTHER length

21
Q

What is the circle permutation formula?

22
Q

Solve:

24
Q

What should you do if some items have to be together in a permutation problem (eg. always stand next to each other)?

A

LINK the items together!

Example: If A, J, S, M and T have to be arranged in a line, how many ways can this be done if J and S always have to stand together?
= Just consider J and S, a single item! LINK them!

HOWEVER, also watch out as there are two ways of linking them,
either JS, or SJ.

You have to account for this

25
What is the formula for items that are linked together?
T = total # of items g = # of items that must be together
26
Solve:
27
How would you solve a question where it asks you that some items can NOT be together in a permutation problem?
Remember "Collectively Exhaustive Events of ways items not together = # of all arrangements - # of arrangements together
28
Explain how you would solve this
of ways items not together = # of all arrangements - # of arrangements together
29
Solve:
30