Scribd
Upload
30 views22 pages

Discrete Structures - Lecture 30, 31

The document discusses counting formulas in discrete mathematics, focusing on k-samples and k-permutations with different criteria regarding repetitions and order. It outlines four combinations based on whether repetitions are allowed and whether order matters, leading to distinct counting methods. Examples and tasks are provided to illustrate the application of these concepts in forming numbers from a set of digits.

Uploaded by

abuzart379
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
30 views22 pages

Discrete Structures - Lecture 30, 31

The document discusses counting formulas in discrete mathematics, focusing on k-samples and k-permutations with different criteria regarding repetitions and order. It outlines four combinations based on whether repetitions are allowed and whether order matters, leading to distinct counting methods. Examples and tasks are provided to illustrate the application of these concepts in forming numbers from a set of digits.

Uploaded by

abuzart379
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 22

Discrete Mathematics

LECTURE 30, 31
k-SAMPLE,
k-PERMUTATION
1
Counting Formulas

For a given set of n distinct elements, one can


choose k elements in different ways:

The number of selections of elements varies


according to:
1. Elements may or may not be repeated.
2. The order of elements is considered or not.

2
Counting Formulas

We have total four combinations:

1. Repetitions allowed, order matters


2. Repetitions not allowed, order matters
3. Repetitions allowed, order doesn’t matter
4. Repetitions not allowed, order doesn’t matter

These combinations lead us to four different


counting methods.

3
Counting Formulas

Order Doesn’t
Criteria Order Matters
Matter

Repetitions Allowed k-sample k-selection

Repetitions Not
k-permutation k-combination
Allowed

4
k-SAMPLE

 A k-sample of a set of n-elements is a choice of k-


elements taken from the set of n-elements such
that the order of elements matters and elements
can be repeated.

 NOTE: As repetition of elements is allowed,


therefore, k is independent of n.

 FORMULA:
nk

5
Example

 How many possible outcomes are there when a


fair coin is tossed three times.

 Solution:
Head / Tail Head / Tail Head / Tail

Here n=2 outcomes (Head/Tail)


k=3 as the coin is tossed three times.
nk=23=8
8-Samples: HHH,HHT,HTH,THH,HTT,THT,TTH,TTT
6
k-PERMUTATION

 A k-permutation of a set of n elements taken from


the set of n elements such that the order of
elements matters but repetition of elements is not
allowed.

 NOTE: As repetition of elements is not allowed,


therefore, k <= n.

 FORMULA:
P(n,k) ==

7
Example

 How many 2-permutations are there of


{W,X,Y,Z}? Write them all.

 Solution: 4 choices 3 choices

Here n=4 maximum outcomes & k=2


P(4,2)====4.3=12
2-permutations:
WX,WY,WZ,XW,XY,XZ,YW,YX,YZ,ZW,ZX,ZY
8
Task 1

 Suppose repetition of digits is permitted. How


many three-digit numbers can be formed from six
digits 2,3,4,5,7 and 9?

9
Task 2

 Suppose repetition of digits is permitted. How


many three-digit numbers less than 400 can be
formed from six digits 2,3,4,5,7 and 9?

10
Task 3

 Suppose repetition of digits is permitted. How


many even three-digit numbers can be formed
from six digits 2,3,4,5,7 and 9?

11
Task 4

 Suppose repetition of digits is permitted. How


many odd three-digit numbers can be formed
from six digits 2,3,4,5,7 and 9?

12
Task 5

 Suppose repetition of digits is permitted. How


many three-digit numbers divisible by 5 can be
formed from six digits 2,3,4,5,7 and 9?

13
Task 6

14
Task 7

15
Task 7

16
17
Task 8

18
Task 9

19
Task 10

20
Practice Questions
1.

2.

3.

4.

21
Thanks

 End of Lecture
 Q/As

22

You might also like