Counting Flashcards

1
Q

Define Permutations and how to work them out.

A

A permutation of n distinct items is any arrangement of them in a specific order. The number of ways to arrange n distinct items is: n! (For permutations of a whole set… Like permutations of {1,2,3,4})

If we are permuting r items out of n distinct items (where r ≤ n), the number of permutations is given by: n!/(n-r)! (For permutations of a subsetset… Like selecting permutations of 3 from 10. n=10 and r=3)

(Ordered selections without repeats)

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

How many Permutations of {1,2,3,4}?

A

4!

4x3x2x1=24

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

Select 3 Items from 10 items:
Ordered selections without repeats.

A

10 x 9 x 8 = 720

or

10!/(10-3)! = 720

Ordered selections without repeats. So Permutation

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

Select 3 Items from 10 items:
Ordered selections with repeats.

A

10³ = 10 x 10 x 10 = 1000

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

Select 3 Items from 10 items:
Unordered selections without repeats.

A

n choose r

(10 x 9 x 8) / (3 x 2 x 1)

n!/r!(n-r)!

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

How many distict arrangements of the word BARBARA are there?

A

B = 2, A = 3, R = 2, Length = 7

7!/(2!3!2!)

Or, 7C2 x 5C3 (7C2 choices for B’s, 5C3 choices for A’s, R’s go in whats left)

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

How many ordered selections of 4 elements from {1,2,…,10} have a 5 immediately followed by a 6.

What is the process, what do you use?

A

Treat 56 as a block. 56 can be arranged in a group of 4, 3 ways.
5 6 _ _ , _ 5 6 _ , _ _ 5 6 (This counts as 3x)

Now there are 2 numbers left to choose and 8 numbers to choose from. (8x)

Finally 1 number left to choose and 7 to choose from. (7x)

Hence, 3x7x8

Can also be done as 8C2 x 3!

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

If a committee of 5 is chosen at random from a group of 25 mathematicians and 25 physicists, what is the probability that at least one mathematician will be chosen?

A
  • The total number of 5-element subsets of the group is 50C5.
  • The number of 5-element subsets that contain zero mathematicians is 25C5
  • So the number of 5-element subsets that contain at least one mathematician is 50C5 − 25C5
  • So the probability is …

(50C5 − 25C5)/50C5

The probability is equal to the number of 5-element subsets of the group that contain at least one mathematician, divided by the total number of 5-element subsets.

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

How to work out probability

A

P(E) = |E|/|S|

E = No. of success, S = Total attempt

E = No. of success, S = Total attempt
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is the coefficient of 𝑥³ in the expansion of (𝑥 + 9)⁷

A

9^4 x 7C4

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

What is the coefficient of 𝑥² in the expansion of (3𝑥 − 2)⁵

A

5C3 x 3² x (-2)³

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

State the Inclusion/Exclusion General Rule?

What’s it do?

A

|𝐴₁ ∪ 𝐴₂| = |𝐴₁| + |𝐴₂| − |𝐴₁ ∩ 𝐴₂|

Stops the intersection of the union being counted twice.

Always helps to draw a Venn diagram

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

In a list of 100 words, there are 47 that contain an “a” and 18 that contain a “b”. If there are 51 that contain neither an “a” nor a “b”, then how many contain both an “a” and a “b”?

Set it up!
A

|A| = 47, |B| = 18, |A ∪ B| =100 - 51= 49

49 = 47 +18 - |A ∩ B|
=> |A ∩ B| = 47 + 18 - 49
=> |A ∩ B| = 16

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

What is the Pigeonhole Principle.

Also, what is it’s general form?

A

Pigeonhole Principle

If n items are placed into m pigeonholes and n > m, then at least one pigeonhole must contain more than one item.

In a more general form: If n items are distributed among m pigeonholes, and n > km), then at least one pigeonhole contains more than k items.

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

How many functions are there from Z₅ to Z₃?

A

Mapping to Z₃, so there is 3 spaces, each with 5 choices:

3^5 = 243

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