Scribd
Upload
14 views2 pages

DVK2

Uploaded by

Bhargav Praveen Chintapalli
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
14 views2 pages

DVK2

Uploaded by

Bhargav Praveen Chintapalli
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

ASSIGNMENT-I

Discrete Mathematical Structures


(EURCS − 303A)

1. Prove that {[(p ∨ q) → r] ∧ (∼ p)} → (q → r) is a Tautology by appeal


to an abbreviated truth table.

2. Show that the propositional functions p → (q → r) and (p ∧ q) → r


are logically equivalent.

3. State and prove De Morgan laws:

4. Test whether the following inference is valid or faulty.


“If you send me a gift, then I will celebrate my birthday”. “If you do
not send me a gift, then I will go to home early” and “If I go home
early, then I will study” lead to the conclusion “If I do not celebrate
my birthday, then I will study.”

5. Show that s is a valid conclusion from the premises (p → q) , (p → r) ,


∼ (q ∧ r) and (s ∨ q) .

6. Prove or disprove the validity of the following arguments.


(i) Some females are not mothers
Some politicians are not females
Hence, Some politicians are not mothers.
(ii) All healthy people eat an apple a day
Ram does not eat a apple a day
Therefore, Ram is not a healthy person.

7. Use a Contradiction argument to verify the following valid inference:


(i) ∼ p → (q →∼ w)
∼s→q
∼t
∼p∨t

∴ w→s

1
(ii) p → q
r
q→r

∴p

8. If a sum of 10 non-negative integers is 74, prove that some set of 5 of


these inters is at least 37.

9. Among 13 different integral powers of integer 5, there must be at least


2 of them that have the same remainder when divided by 12.

10. Prove the following by Strong Induction Method :


(i) Prove that if Fn is the nth Fibonacci number then
√ !n+1 √ !n+1
 
1 1+ 5 1− 5
Fn = √  − 
5 2 2

for all n ≥ 0.
th
(ii) Show that
 for each integer n ≥ 1, the n Fibonacci number Fn is
13 n
less than 8 .
(iii) Show that for each integer n ≥ 1, the nth Fibonacci number Fn is
n
less than 47 .


11. Prove by by the Principle of Mathematical Induction


h i
(a) 12 + 22 + . . . + n2 = n(n+1)(2n+1)
6
.
(b) 6n+1 + 72n+1 is divisible by 43.
(d) 4n ≥ n4 for all n ≥ 5.
(f) For each integer n ≥ 2, show that
1 1 1 √
√ + √ + . . . √ > n.
1 2 n

You might also like