Scribd
Upload
45 views1 page

Digital Assignment - I Applied Discrete Mathematical Structures (MAT1016)

This document contains 9 questions regarding logic and discrete mathematics. Question 1 asks about the validity of an argument involving studying and exams. Question 2 asks to express sentences using logical expressions. Question 3 asks to prove the validity of a logical statement using rules of inference. Question 4 asks to show logical statements are inconsistent. The remaining questions ask to prove mathematical statements or calculate answers to discrete problems.

Uploaded by

lalithkumaran L
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
45 views1 page

Digital Assignment - I Applied Discrete Mathematical Structures (MAT1016)

This document contains 9 questions regarding logic and discrete mathematics. Question 1 asks about the validity of an argument involving studying and exams. Question 2 asks to express sentences using logical expressions. Question 3 asks to prove the validity of a logical statement using rules of inference. Question 4 asks to show logical statements are inconsistent. The remaining questions ask to prove mathematical statements or calculate answers to discrete problems.

Uploaded by

lalithkumaran L
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/ 1

Digital Assignment - I

Applied Discrete Mathematical Structures (MAT1016)


1. Check the validity of the following argument: If you play and you study you will pass the exams,
while if you play and don’t study you won’t pass. Thus, if you play, either you study and you
will pass the exams, or you don’t study and you won’t pass.

2. Express the following sentences using logical expression:

(a) Every student likes some student


(b) No students like Ram
(c) Every student who takes Analysis also takes Geometry

3. Prove the validity of the following using rules of inference:


(¬p ∨ q) → r, r → (s ∨ t), ¬s ∧ ¬u, ¬u → ¬t leads to the conclusion p.

4. Show that the following are inconsistent:


a → (b → c), d → (b ∧ ¬c), a ∧ d

5. Prove that n3 − n is divisible by 3 for any integer n ≥ 0

6. A perfect number is a positive integer n such that the sum of its factors equals 2n. For instance,
6 is a perfect number since 1 + 2 + 3 + 6 = 12 = 2 × 6. Prove that a prime number can’t be a
perfect number.

7. (i) How many functions are there from a set with m elements to a set of n elements?
(ii) How many 1 − 1 functions are there from a set with m elements to a set of n elements?

8. Each user on a computer system has a password, which is six to eight characters long, where each
character is an uppercase letter or a digit. Each password must contain at least one digit. How
many possible passwords are there?

9. There are 38 different time periods during which classes at a university can be scheduled. If there
are 677 different classes, what is the minimum number of different rooms that will be needed?

You might also like