0% found this document useful (0 votes)
12 views2 pages

Tutorial 4

Uploaded by

hetghetiya2526
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
0% found this document useful (0 votes)
12 views2 pages

Tutorial 4

Uploaded by

hetghetiya2526
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

SHREE SWAMI ATMANAND SARSWATI INSTITUTE OF TECHNOLOGY, SURAT

Branch: IT 21
Subject Name: DM Date: 17/1/2025
Tutorial-4
1 Show that the premises “Everyone in this discrete mathematics class has taken a course in computer
science” and “Marla is a student in this class” imply the conclusion “Marla has taken a course in
computer science.”
2 Define Functionally complete set of connectives, Principal Disjunctive Normal Form (PDNF). Obtain
PDNF for the expression ~((𝑝 ∧ 𝑞) ∨ (~𝑝 ∧ 𝑞)) ∨ (𝑞 ∧ 𝑟)).
3 Find the CNF of the form ¬(𝑝 ∨ 𝑞) ↔ (𝑝 ∧ 𝑞).

4 For the universe of integers, let p(x), q(x), r(x), s(x) and t(x) be the following open statements:
p(x): x > 0;
q(x): x is even;
r(x): x is a perfect square;
s(x): x is divisible by 4;
t(x): x is divisible by 5.
Write the following statements in symbolic form:
(i) At least one integer is even
(ii) There exists a positive integer that is even
(iii) If x is even then x is not divisible by 5
(iv) No even integer is divisible by 5
(v) There exists an even integer divisible by 5.
5 Rewrite the following statements using quantifier variables and predicate symbols:
1) All birds can fly.
2) Some women are genius.
3) There is a student who likes Discrete Mathematics but not Probability and Statistics.
4) Each integer is either even or odd.
6 If M(x): “x is man”, C(x):” x is cleaver”. Then translate the following statement into English
1. ∃ 𝑥 (𝑀(𝑥) → 𝐶(𝑥))
2. ∀ 𝑥 (𝑀(𝑥) ∧ C(x))
7 Identify the statement (¬𝑞⋀(𝑝 → 𝑞)) → ¬𝑝 is tautology or contradiction without constructing the
truth table.
8 Symbolize the following expressions
“𝑥 is the father of the mother of 𝑦”
1
where
P(𝑥): 𝑥 is a person.
F(𝑥,y): 𝑥 is the father of 𝑦.
M(𝑥,y): 𝑥 is the mother of 𝑦.
9 A function 𝑓: ℝ+ → ℝ is defined by𝑓(𝑥) = 𝑥 2 − 8. Check whether 𝑓 is one-one and onto.
ANS : One-one but not Onto.
10 Define even and odd functions. Determine whether the 𝑓: 𝕀 → ℝ+ defined by 𝑓(𝑥) = 2𝑥 + 7 is one-to-
one or onto or bijective.
11 Define one-one function. Show that the function 𝑓: ℝ → ℝ, 𝑓(𝑥) = 3𝑥 − 7 is one- one and onto
both. Also find its inverse.
12 Is function ∶ ℝ − {− 3} → ℝ − {3} , 𝑓(𝑥) = 3𝑥+2
one-one and onto? If yes then find its inverse.
2 2 2𝑥+3
3𝑥−2
ANS: 𝑓 −1 (𝑥) = 3−2𝑥

13 Let 𝑌 = {𝑛2 : 𝑛 ∈ ℕ} and 𝑓: ℕ → 𝑌 defined as𝑓(𝑛) = 𝑛2 . Show that 𝑓 is invertible and find the inverse
of 𝑓
ANS: 𝑓 −1 : 𝑌 → ℕ; 𝑓 −1 (𝑥) = √𝑥
14 Show that the functions 𝑓(𝑥) = 𝑥 4 and 𝑔(𝑥) = 𝑥 14 for 𝑥 ∈ ℝ are inverses of one another.

15 Let 𝑓: ℝ → ℝ be function defined by𝑓(𝑥) = 𝑎𝑥 + 𝑏. Find values of 𝑎 and 𝑏 for which 𝑓 ∘ 𝑓 = 𝐼𝑅 .


16 Find the composition of two functions 𝑓(𝑥) = 𝑒 𝑥 and 𝑔(𝑥) = 𝑥 3 , (𝑓 ∘ 𝑔)(𝑥) and (𝑔 ∘ 𝑓)(𝑥). Hence,
show that (𝑓 ∘ 𝑔)(𝑥) ≠ (𝑔 ∘ 𝑓)(𝑥).
17 Define Composite function. If 𝑓(𝑥) = 2𝑥, 𝑔(𝑥) = 𝑥 3 , ℎ(𝑥) = 𝑥 + 1, then find (𝑓 ∘ 𝑔) ∘ ℎ and
𝑓 ∘ (𝑔 ∘ ℎ).
18 Find the domain of the function 𝑓(𝑥) = √81 − 𝑥 2 .
ANS: [-9,9]
19 Show that the function 𝑓: ℝ → ℝ+ ∪ {0} defined by 𝑓(𝑥) = |𝑥| is not invertible. Modify the domain
or codomain of 𝑓 so that it becomes invertible.

You might also like