Scribd
Upload
20 views2 pages

Assignment

This document provides the questions and instructions for a discrete mathematics assignment. It includes 7 questions covering topics like symbolic logic, counting paths, proofs using mathematical induction, solving equations using inclusion-exclusion principle and generating functions, recurrence relations, digraphs and graph isomorphism, and solving a recurrence relation using a generating function. Students are instructed to show all steps and details in their work.

Uploaded by

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

Assignment

This document provides the questions and instructions for a discrete mathematics assignment. It includes 7 questions covering topics like symbolic logic, counting paths, proofs using mathematical induction, solving equations using inclusion-exclusion principle and generating functions, recurrence relations, digraphs and graph isomorphism, and solving a recurrence relation using a generating function. Students are instructed to show all steps and details in their work.

Uploaded by

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

Birla Institute of Technology and Science–Pilani, Hyderabad Campus

First Semester, 2023-2024


Assignment
Course No.: MATH F213 Course Title: Discrete Mathematics
Submission Date and Time:17-11-2023, 4.45 to 5.30 PM at my chamber H-028

Notes: There are seven questions. Answer all the questions. Symbols carry the usual meaning as given
in the text book. Your answer must adhere to the approach, formula contained in the scope of the course.
Your answers must contain all the details. For example,
In Q1, if the implication is true you must give formal proof. If it is false, you must mention the reason.
In Q2, you answer must contain the details of how you count such paths.

Q1. Write the following open propositions into symbolic languages [You can use your own symbols].
Prove or disprove the validity of the arguments. [4*.5 = 2M]

a) All students in this class understand logic. Xavier is a student in this class. Therefore, Xavier
understands logic.
b) Every computer science major student takes discrete mathematics. Natasha takes discrete
mathematics. Therefore, Natasha is a computer science major student.
c) All parrots like fruit. My pet bird is not a parrot. Therefore, my pet bird does not like fruit.
d) Everyone who eats granola every day is healthy. Linda is not healthy. Therefore, Linda does not
eat granola every day.

Q2. In this problem we will count the number of paths in the xy plane between the origin (0, 0) and
point (m, n), where m and n are nonnegative integers, such that each path is made up of a series of
steps, where each step is a move one unit to the right or a move one unit upward. (No moves to
the left or downward are allowed.) Two such paths from (0, 0) to (5, 3) are illustrated here.

Using appropriate method, find the number of such paths between the origin (0, 0) and point (m, n).
[1M]

Q3. Use mathematical induction to prove the following generalization of one of De Morgan’s laws:
̅̅̅̅̅̅̅̅̅
⋂𝑛𝑖=1 𝐴𝑖 = ⋃𝑛𝑖=1 𝐴̅𝑖 [1M]

Q4. Find the number of solutions of the equation 𝑒1 + 𝑒2 + 𝑒3 + 𝑒4 = 20, where 1≤ e1 ≤ 5,


2 ≤ e2 ≤ 7, 3 ≤ e3 ≤ 9, 4 ≤ e4 ≤ 10 using

(a) The principle of inclusion and exclusion [1M]

(s) The generating functions [1M]


Q5. A computer system considers a string of decimal digits a valid code if it contains an odd number
of 0 digit. For example, 1230407801 is a valid code but 123040612 is not a valid code. Let an denote
the number of valid n-digit code words. Find a recurrence relation for an with appropriate initial
condition. Using the recurrence relation find the number of 20 digits’ valid code. [.5 + .5 = 1M]

Q6. Consider the following relations on the set {1, 2, 3, 4}. Draw digraphs representing each of the
digraphs. Determine

(a) Which of them are isomorphic to each other? [1/2M]

(b) Which of them are non-isomorphic to each other?[1/2M]

(c) Which of them are antisymmetric? [1/2M]

(d) Which of them are transitive? [1/2M]

(i) {(1,1), (1,2), (4,3), (2,1), (2,3)}

(ii) {(2,2), (1,2), (1,4), (3,1), (4,3)}

(iii) {(3,1), (3,2), (3,3), (2,1), (2,4)}

Q7. Find all solutions of the recurrence relation 𝑎𝑛 = 7𝑎𝑛−1 − 16𝑎𝑛−2 + 12𝑎𝑛−3 + 𝑛2𝑛 𝑤𝑖𝑡ℎ 𝑎0 =
−2, 𝑎1 = 0 𝑎𝑛𝑑 𝑎2 = 5. Do not use the formulae table for the particular solution given in the text
book. Instead you must write the generating function and show how you obtain the general
solution. [1M]

------------------------------------------------------------------------------------------------------------

You might also like