Counting Flashcards

1
Q

What are two counting techniques?

A

1.) Sum rule
2.) Product rule

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

Mutual exclusive means

A

Events that can’t be done simultaneoulsy

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

Sum Rule

A

If task T₁ and task T₂ can happen in n₁ and n₂ ways respectively and T₁, T₂ are mutually exclusive then any of the task can happen in n₁+n₂ ways.

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

Product Rule

A

If task T₁ and task T₂ can happen in n₁ and n₂ ways respectively and T₁, T₂ are mutually exclusive then both or all the tasks can be happened in n₁n₂ ways

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

remember for sum rule

A

either

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

remember for product rule

A

all tasks or together

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

Necessary condition for T₁, T₂ in sum rule or product rule

A

T₁ and T₂ are mutually exclusive

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

A or B (in terms of counting techniques)

A

Generally A or B means AUB but if A and B are mutually exclusive then A∩B = Φ, then AUB becomes sum rule

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

Word for permutation

A

Arrangement

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

Permutation

A

Arrangement of r objects from n distinct objects linearly

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

Types of permutation and also their formulas

A

1.) Without repetition
no. of ways = ⁿPᵣ = n! / (n-r)!
2.) With repetition
no. of ways = nʳ

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

Special case for permutation

A

In without repetition,
When r = n
then no. of ways = n!

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

value of 0!

A

1

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

value of 1!

A

1

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

Permutation with repetitions

A
17
Q

Circular Arrangements

A

Arrangement of n distinct objects at a round table can be done in (n-1)! ways.

18
Q

Necklace

A

No. of necklace with n distinct colour beads = (n-1)! / 2

19
Q

Clockwise / Anticlockwise arrangements

A

No distinction be made in the clockwise and anti-clockwise arrangements, then person can be seated a round table in (n-1)! / 2 ways

20
Q

Word for combinations

A

Selections (unordered selections)

21
Q

Combinations

A
22
Q

Permutation in terms of selection

A

Ordered selection

23
Q

ⁿcᵣ (proper formula)

A

ⁿcᵣ = n! / r! (n-r)!

24
Q

ⁿcᵣ (short)

A

ⁿcₙ₋ᵣ

25
Q

Combinations with repetitions

A
26
Q

Another statements used for combinations with repetitions

A
27
Q

Shortcut for non-empty (Repetitive combination)

A
28
Q

Derangement formula

A
29
Q
A
30
Q
A
31
Q

Formula 1 of combination

A
32
Q

Formula 2 combination

A
33
Q

Formula 3 of combination

A
34
Q

Number of diagonals in polygon
Explain whole concept

A
35
Q

Total number of different lines from n points where p points are collinear

A
36
Q

Total number of different lines from n points where p points are collinear

A