Scribd
Upload
24 views

Tutorial 7,8,9

Uploaded by

bandarusyam7732
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
24 views

Tutorial 7,8,9

Uploaded by

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

Department of Mathematics

24MT1002: Discrete Mathematics


I/IV-B. Tech-(ODD Sem), Academic Year: 2024-2025

TUTORIAL PROBLEMS-CO-3
TUTORIAL-7
1. How many different license plates can be made if each plate contains a sequence of three
uppercase English letters followed by three digits (and no sequences of letters are
prohibited, even if they are obscene)?

2. A password of 6 digits is made of digits 9,2,6,0,0,2. How many possible passwords are
there? How long would it take to try all the possible passwords if trying one password
takes 5 seconds?
3. Find the number of arrangements of the letters of the word INDEPENDENCE. In how
many of these arrangements,
a. do the words start with P
b. do all the vowels always occur together
c. do the vowels never occur together
d. do the words begin with I and end in P?

4. There are 3 elements a, b, c. Use them to make:


a. permutations (without repetition)
b. permutations with repetition, where, “a” occurs 2 times, “b” one time and “c” one
time.
5. A man has 4 red ties, 3 blue ties, and 2 green ties. If he wants to choose 3 ties, how many
different combinations can he select?
6. A school wants to form a committee of 5 students from a group of 10 boys and 8 girls.
How many ways can they form a committee that includes at least 2 girls?

TUTORIAL-8
1. Solve the recurrence relation a n=58−16 a n-2 for n ≥2, with a0 =16∧ a 1=80
2. Solve the recurrence relation a n=5 an−1 +6 a n-2 for n ≥ 2, with a 0=1∧ a 1=0

3. Obtain the solution to the recurrence relation a = 7a - 6a with the initial


n n−2 n−3
conditions
a. a = -1, a = 0, and a = 3.
0 1 2
4. Suppose that the roots of the characteristic equation of a linear homogeneous recurrence
relation are -2, -2, -2, 7, 7, and 8 (that is, there are three roots, the root -2 with
multiplicity three, the root 7 with multiplicity two, and the root 8 with multiplicity one).
What is the form of the general solution?
5. Determine the general solutions of the recurrence relation a = 5a -4a +2n. What is
n n−1 n-2
the solution with a = 3?
1

TUTORIAL-9
Solve the recurrence relations using generating functions.
1) Use generating functions to solve the recurrence relation
a n=3 an−1 +2 , with a0 =1 , for n=1, 2, 3----
2) Use generating functions to solve the recurrence relation
a n=3 an−1 +4 n−1 , with a 0 =1 , for n=1, 2, 3----
3) Use generating functions to solve the recurrence relation
a n=5 an−1 -6 a n-2 for n=2, 3, 4 ----with initial condition a 0=0∧ a 1=3

You might also like