Scribd
Upload
23 views9 pages

DMath

1. The document contains a question bank with multiple choice and true/false questions about discrete mathematics concepts like logic, proofs, quantifiers, and the pigeonhole principle. 2. Part A includes questions about tautologies, truth tables, quantifiers, and applying the pigeonhole principle to show that at least 8 bicycles must be the same color if 7 colors are used to paint 50 bicycles. 3. Part B contains questions requiring proofs of logical implications and showing whether a compound proposition is a tautology. It also includes a word problem about programming language courses taken by students.

Uploaded by

Arjun K S
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
23 views9 pages

DMath

1. The document contains a question bank with multiple choice and true/false questions about discrete mathematics concepts like logic, proofs, quantifiers, and the pigeonhole principle. 2. Part A includes questions about tautologies, truth tables, quantifiers, and applying the pigeonhole principle to show that at least 8 bicycles must be the same color if 7 colors are used to paint 50 bicycles. 3. Part B contains questions requiring proofs of logical implications and showing whether a compound proposition is a tautology. It also includes a word problem about programming language courses taken by students.

Uploaded by

Arjun K S
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/ 9

DEPARTMENT OF MATHEMATICS

Discrete Mathematics_MAA4219

Question Bank
Part A
1. Show that (P→ 𝑄) ↔ (¬𝑃 ∨ 𝑄) is a tautology.

2. Define Tautology with an example.


A compound proposition is called a tautology, if it is true for every truth assignment.

3. Write a truth table for biconditional proposition of two given propositions.


If p and q are propositions, the compound proposition “p if and only if q”, that is
denoted by p ↔ q, is called a biconditional proposition, which is true when p and q
have the same truth values and is false otherwise.

4. Define an existential quantifier.

5. State the generalized pigeonhole principle.


6. State pigeonhole principle.
If n pigeons are accommodated in m pigeon-holes and n > m then at least one
pigeonhole will contain two or more pigeons. Equivalently, if n objects are put in m
boxes and n > m, then at least one box will contain two or more objects.

7. Assuming that repetitions are not permitted, how many four-digit numbers can be
formed from the six digits 1, 2, 3, 5, 7, 8?

8. Show that if seven colours are used to paint 50 bicycles, at least 8 bicycles will be the
same colour.
Here, Number of Pigeon = Number of bicycle = 50
Number of holes = Number of colors = 7
Then by generalized pigeon hole principle,

Therefore atleast 8 bicycles will have the same color.

Part B
1. Prove that P⟶ (𝑃 ⟶ 𝑅) ⟹ (𝑃 ⟶ 𝑄) ⟶ (𝑃 ⟶ 𝑅).
2. Prove the following implication (𝑝 → (𝑞 → 𝑟)) → (𝑝 → 𝑞) → (𝑝 → 𝑟).

3. Check whether the compound proposition (~𝑞 ∧ (𝑝 → 𝑞)) → ~𝑝 is tautology or not?


(¬𝑞 ∧ (𝑝 → 𝑞)) → ¬𝑝 is tautology or not

P q ¬q p→q ¬q ∧ (p → q) ¬p (¬q ∧ (p → q)) → ¬p


T T F T F F T
T F T F F F T
F T F T F T T
F F T T T T T

4. Prove that implication ∀(𝑃(𝑥) ∧ 𝑄(𝑥)), ∀𝑥(𝑅(𝑥) → 𝑄(𝑥)) ⇒ ∀𝑥(𝑅(𝑥) ⟶ ¬𝑃(𝑥)).

5. Show that the following premises are inconsistent 𝑝 → 𝑞, 𝑞 → r , 𝑠 → ¬𝑞, 𝑝˄𝑠.


6. Show that R is a valid inference from the premises 𝑃 → 𝑄, 𝑄 → 𝑅 and P.

7. There are 250 students in an engineering college. Of these 188 have taken a course in
Fortran, 100 have taken a course in C and 35 have taken courses in Java. Further 88
have taken courses in both Fortran and C. 23 have taken course in both C and Java and
29 have taken courses in both Fortran and Java. If 19 of these students have taken all
the three courses, how many of these 250 students have not taken a course in any of
these three programming languages?
8. A club consisting of 6 men and 7 women, in how many ways can we select a committee
of 4 persons which has at least one women?

9. Use mathematical induction to prove that 𝑛3 + 2𝑛 is divisible by 3, for 𝑛 ≥ 1.

10. Show that 8n − 3n is a multiple of 5 for all 𝑛 ≥ 1.


Part C
1. Prove that: ¬((¬𝑃 ∧ 𝑄) ∧ (¬𝑃 ∧ ¬𝑄)) ∨ (𝑃 ∧ 𝑄) ≡ 𝑃

2. Prove the following implication (¬𝑝˅𝑞)˄(𝑝˄(𝑝˄𝑞)) ≡ 𝑝˄𝑞.


3. Using the truth table, prove the following implication 𝑝 → (𝑝 → 𝑟) ⟹ (𝑝 → 𝑞)
→ (𝑝 → 𝑟).

4. Show that the following set of premises is inconsistent:


If Rama gets his degree, he will go for a job,
If he goes for a job, he will get married soon,
If he goes for higher study, he will not get married,
Rama gets his degree and goes for higher study.
5. Show that the premises “one student in this class knows how to write programs in
JAVA” and “Everyone who knows how to write programs in JAVA can get a high-
paying job” imply the conclusion “Someone in this class can get a high-paying job”.

6. Prove that the following set of premises is inconsistent.


If Raj misses many classes through illness, then he fails high school.
If Raj fails high school, then he is uneducated.
If Raj reads a lot of books, then he is not uneducated.
Raj misses many classes through illness and reads a lot of books.

7. How many bit string of length 10 contains (a) exactly four 1’s, (b) atmost four 1’s,
(c) an equal number of 0’s and 1’s?
c)

You might also like