B.Sc.

Engineering
Semester 1 - 2018 batch
MA 1013 Mathematics

Tutorial 02-Answers
Section A (Logic and Set Theory)
(1) (i) p; A = {0, 2, 4, 6, 8}
(ii) q; B = {0, 1, 2, 3, 4, 5, 6}
(iii) r; C = {0, 1, 8, 9}
(iv) ∼ p; A−1 = {1, 3, 5, 7, 9}
∼ p ∧ r; D = {1, 9}
(v) p ∨ q; E = {0, 1, 2, 3, 4, 5, 6, 8}
(vi) ∼ (q ∨ r) ≡∼ q∧ ∼ r
∼ q; B −1 = {7, 8, 9}
∼ r; C −1 = {2, 3, 4, 5, 6, 7}
∼ (q ∨ r); F = {7}
(vii) p =⇒ q ≡∼ p ∨ q
∼ p; A−1 = {1, 3, 5, 7, 9}
q; B = {0, 1, 2, 3, 4, 5, 6}
p =⇒ q; G = {0, 1, 2, 3, 4, 5, 6, 7, 9}
(viii) p ⇐⇒ q; H = {0, 2, 4, 6}

(2) m =⇒ (p ∨ q)
p =⇒ r
∼r
m
———————
q

(1) ∼ r (Premise)
(2) p =⇒ r (Premise)
(3) ∼ p (From (1) and (2),Modus Tollens)
(4) m (Premise)
(5) m =⇒ (p ∨ q) (Premise)
(6) p ∨ q (From (4) and (5),Modus Ponens)
(7) q (Disjunctive Syllogism)

1
(3) (∼ P ∨ Q) =⇒ R
P =⇒ T
(∼ P ∧ R) =⇒ ∼ S
S∨ ∼ Q
∼T
———————————————
∼Q

(1) ∼ T (Premise)
(2) P =⇒ T (Premise)
(3) ∼ P (From (1) and (2),Modus Tollens)
(4) ∼ P ∨ Q (From (3),Addition)
(5) (∼ P ∨ Q) =⇒ R (Premise)
(6) R (From (4) and (5), Modus Ponens)
(7) ∼ P ∧ R (From (3) and (6),Conjunction)
(8) (∼ P ∧ R) =⇒ ∼ S (Premise)
(9) ∼ S (From (7) and (8), Modus Ponens)
(10) S∨ ∼ Q (Premise)
(11) ∼ Q (Disjunctive Syllogism)

(4) (i) ∼ p ∧ (p ∨ q) =⇒ q
≡∼ (∼ p ∧ (p ∨ q)) ∨ q
≡∼ ((∼ p ∧ p) ∨ (∼ p ∧ q)) ∨ q (Distributive Law)
≡∼ (F∨(∼ p ∧ q)) ∨ q (Complement Law)
≡∼ (∼ p ∧ q) ∨ q (Identity Law)
≡ (p∨ ∼ q) ∨ q (De Morgan’s Law)
≡ p ∨ (∼ q ∨ q) (Associative Law)
≡ p ∨ (q ∨ simq) (Commutative Law)
≡ p∨T (Complement Law)
≡T (Identity Law)

(ii) (p ∨ q) ∧ (∼ p ∨ r) =⇒ (q ∨ r)
∼ ((p ∨ q) ∧ (∼ p ∨ r)) ∨ (q ∨ r)
(∼ (p ∨ q)∨ ∼ (∼ p ∨ r)) ∨ (q ∨ r) (De Morgan’s Law)
(∼ p∧ ∼ q) ∨ (p∧ ∼ r) ∨ (q ∨ r) (De Morgan’s Law)
(∼ p∧ ∼ q) ∨ [(p ∨ q ∨ r) ∧ (∼ r ∨ (q ∨ r))] (Distributive Law)
(∼ p∧ ∼ q) ∨ [(p ∨ q ∨ r) ∧ (∼ r ∨ (r ∨ q))] (Commutative Law)
(∼ p∧ ∼ q) ∨ [(p ∨ q ∨ r) ∧ ((∼ r ∨ r) ∨ q)] (Associative Law)
(∼ p∧ ∼ q) ∨ [(p ∨ q ∨ r) ∧ (T∨q)] (Complement Law)
(∼ p∧ ∼ q) ∨ [(p ∨ q ∨ r)∧T] (Identity Law)
(∼ p∧ ∼ q) ∨ [(p ∨ q ∨ r)] (Identity Law)
[∼ p ∨ (p ∨ q ∨ r)] ∧ [∼ q ∨ (p ∨ q ∨ r)] (Distributive Law)
[(∼ p ∨ p) ∨ q ∨ r] ∧ [(∼ q ∨ q) ∨ p ∨ r)] (Associative Law and Commutative Law)
[T∨(q ∨ r)] ∧ [T∨(p ∨ r))] (Complement Law)

2
 [T∧T] (Identity Law)
T

(iii) ((p =⇒ q) ∧ (q =⇒ r)) =⇒ (p =⇒ r)

((∼ p ∨ q) ∧ (∼ q ∨ r)) =⇒ (∼ p ∨ r)
∼ [((∼ p ∨ q) ∧ (∼ q ∨ r))] ∨ (∼ p ∨ r)
∼ [(∼ p ∨ q)]∨ ∼ [(∼ q ∨ r)] ∨ (∼ p ∨ r) (De Morgan’s Law)
((p∧ ∼ q) ∨ (q∧ ∼ r)) ∨ (∼ p ∨ r) (De Morgan’s Law)
[∼ p ∨ (p∧ ∼ q)] ∨ [r ∨ (q∧ ∼ r)] (Associative Law)
[(∼ p ∨ p) ∧ (∼ p∨ ∼ q)] ∨ [(r ∨ q) ∧ (r∨ ∼ r)] (Distributive Law)
[T∧(∼ p∨ ∼ q)] ∨ [(r ∨ q)∧T] (Complement Law)
[(∼ p∨ ∼ q) ∨ (r ∨ q)] (Identity Law)
[(∼ p∨ ∼ q) ∨ (q ∨ r)] (Complement Law)
[∼ p ∨ (∼ q ∨ q) ∨ r] (Associative Law)
[∼ p∨T∨r] (Complement Law)
T (Identity Law)

(5) p ∨ [∼ p =⇒ (q ∨ (q =⇒ ∼ r))]
≡ p ∨ [∼ p =⇒ (q ∨ (∼ q∨ ∼ r))]
≡ p ∨ [∼ p =⇒ ((q∨ ∼ q)∨ ∼ r)] (Associative Law)
≡ p ∨ [∼ p =⇒ (T∨ ∼ r)] (Complement Law)
≡ p ∨ [∼ p =⇒ T ] (Identity Law)
≡ p ∨ [p∨T]
≡ (p ∨ p)∨T (Associative Law)
≡ T (Identity Law)

(6) p =⇒ {(p =⇒ q) ∧ [∼ (∼ q∨ ∼ p)]}

≡ p =⇒ {(∼ p ∨ q) ∧ (q ∧ p)} (De Morgan’s Law )
≡∼ p ∨ {(∼ p ∨ q) ∧ (q ∧ p)}
≡ (∼ p ∨ q) ∨ (p ∧ q)
≡ q ∨ [∼ p ∨ (p ∧ q)] (Commutative Law and Associative Law)
≡ q ∨ [(∼ p ∨ p) ∧ (∼ p ∨ q)] (Distributive Law)
≡ q ∨ (T∧(∼ p ∨ q)) (Complement Law)
≡ q ∨ (∼ p ∨ q) (Identity Law)
≡∼ p ∨ q

Section B (Real Analysis)

(1) Let (−a) ∈ R
∵ (−a) ∈ R,
(−a) + [−(−a)] = 0 (Additive Inverse)
a + {(−a) + [−(−a)]} = a + 0
a + {(−a) + [−(−a)]} = a (Additive Identity)

3
 {a + (−a)} + [−(−a)] = a (Associative Law)
0 + [−(−a)] = a (Additive Inverse)
[−(−a)] = a (Additive Identity)

√ √
(2) Assumption:∃a, b ∈ Q such that a 2 + b 3 = 0 and a 6= 0 and b 6= 0
∵ a, b ∈ Q suppose,
m p
a= and b = where (m, n, p, q ∈ Z)
n q
√ m √ p
2 + 3 =0
n q
√ m √ p
2 =− 3
n q
2m2 3p2
= 2
n2 q
3p2 n2
m2 q 2 =
2
m2 q 2 ∈ Z+ ∪ {0}
Suppose m2 q 2 ∈ Z+
∴ 2|p2 =⇒ 2|p or 2|n2 =⇒ 2|n Not possible Only possible is when m2 q 2 = 0(∵ Signs in
2 sides are not matched.) (#Contradiction)
∴ Assumption is False.
∴The only values for a and b is a = b = 0

327185
(3) (i)
100000
(ii) Let x = 1.64138
100x = 164.138 → (1)
100000x = 164138.138 → (2)

(2) − (1) : 99900x = 163974

163974
x=
99900

(iii) Let x = 5.7146527

10000x = 57146.527 → (1)
10000000x = 57146527.527 → (2)
(2) − (1) : 9999000x = 57089831
57089831
x=
9999000

(4) ||x| − |y|| ≤ |x − y|

|x + y| ≤ |x| + |y|
Let x = x − y
|x − y + y| ≤ |x − y| + |y|
|x| ≤ |x − y| + |y|
|x| − |y| ≤ |x − y| → (1)

4
 Let y = y − x
|y| ≤ |x| + |y − x|
− |y − x| ≤ |x| − |y|
− |x − y| ≤ |x| − |y| → (2)

From (1) and (2),

−|x − y| ≤ |x| − |y| ≤ |x − y|
||x| − |y|| ≤ |x − y|

(5) By the triangular inequality

|x + y| ≤ |x| + |y|
1 + |x + y| ≤ 1 + |x| + |y|
1 1
≥ (1 + |x + y|, 1 + |x| + |y| > 0)
1 + |x + y| 1 + |x| + |y|
1 1
−1+ ≥ −1 +
1 + |x + y| 1 + |x| + |y|
−|x + y| −(|x| + |y|)
≥
1 + |x + y| 1 + |x| + |y|
|x + y| (|x| + |y|)
≤
1 + |x + y| 1 + |x| + |y|
|x + y| |x| |y|
≤ + → (1)
1 + |x + y| 1 + |x| + |y| 1 + |x| + |y|
Also 1 + |x| + |y| ≥ 1 + |x|
1 1
≤
1 + |x| + |y| 1 + |x|
|x| |x|
≤ → (2)
1 + |x| + |y| 1 + |x|
Also 1 + |x| + |y| ≥ 1 + |y|
1 1
≤
1 + |x| + |y| 1 + |y|
|y| |y|
≤ → (3)
1 + |x| + |y| 1 + |y|
From (2)+(3),

|x| |y| |x| |y|

+ ≤ + → (4)
1 + |x| + |y| 1 + |x| + |y| 1 + |x| + |y| 1 + |x| + |y|
From (1) and (4),

|x + y| |x| |y| |x| |y|

≤ + ≤ +
1 + |x + y| 1 + |x| + |y| 1 + |x| + |y| 1 + |x| + |y| 1 + |x| + |y|
|x + y| |x| |y|
≤ +
1 + |x + y| 1 + |x| + |y| 1 + |x| + |y|

5
Section C (Vectors and Matrices)
(1) (i) ab: Not defined.
 

0

T
a b: 1 3 −2 1×3 × 4
 = 8 1×1
2 3×1
     
1 0 0 4 2
abT :  3  × 4 = 0 12 6 
−2 3×1 2 3×1 0 −8 −4 3×3
aT bT : Not defined. 


1

bT a: 0 4 2 1×3 ×  3  = 8 1×1
−2 3×1
   
0
0 0 0
baT : 4 × 1 3 −2 1×3 = 4 12 −8
2 3×1 2 6−4 3×3
Equals:aT b = bT a

(ii) (a) B = A + AT
Suppose that order of A is m × m
A = (ai,j )m×m
AT = (a0i,j )m×m (aj,i = a0i,j )

B = (ai,j )m×m + (a0i,j )m×m

B = (ai,j + a0i,j )m×m
B = (ai,j + aj,i )m×m
| {z }
ci,j

ci,j = ai,j + aj,i → (1)

cj,i = aj,i + ai,j → (2)
∵ (1) = (2),
ci,j = cj,i
∴ B is a symmetric matrix.

(b) Suppose that order of A is m × m

A = (ai,j )m × m
AT = (bi,j )m 
×m   
a11 a12 ..... a1m b11 b12 ..... b1m
 a21 a22 .... a2m  ×  b21 b22 .... b2m 
 
C = AAT =   . . . .   . . . . 
am1 am2 ..... amm bm1 bm2 ..... bmm

6
  
r1 c1 r1 c2 ..... r1 cm
 r2 c1 r2 c2 .... r2 cm 
=
 .

. . . 
rm c1 rm c2 ..... rm cm
 
b1j

 b2j 
C = (ri cj )m×m = ai1 ai2 ....... aim × 
 .. 


bmj

C = (a i1 b1j + ai2 b2j + ai3 b3j + ........ + aim bmj )m×m

C=( m
P
k=1 aik bkj )m×m
bkj = ajk (Transpose)

C=( m aik ajk )m×m =⇒ cij = m

P P
k=1P k=1 aik ajk
m
=⇒ cij = k=1 ajk aik = cji
=⇒ ∴ C is a symmetric matrix.

(c) D = A − AT → (1)
DT = (A − AT )T
DT = AT − (AT )T
DT = AT − A
DT = −(A − AT )

From (1);DT = −D
∴ D is a skew symmetric matrix.

1
(d) A = × 2A
2
1
A= × (A + A)
2
1
A= × (A + A + AT − AT )
2
1
A= × [(A + AT ) + (A − AT )]
2
1 1
A= (A + AT ) + (A − AT )
2 | {z } 2 | {z }
Symmetric Skew Symmetric

 
a b
(2) (i) Suppose G =
c d 2×2
G must be 2 × 2 in order because G and GT have same no.of rows columns as 2.
    2 
T a b a c a + b2 ac + bd
GG = =
c d b d ca + bd c2 + d2
a2 + b2 > 0 and c2 + d2 > 0
∴ λ > 0 and µ > 0
a2 + b2 = 45
c2 + d2 = 20

7
 ac + bd = 0

When a = 3, b = 6, c = 4, d = −2

 
2 7
(ii) (a) A =
1 4
|A| = 1 and |A| =
6 0
∴ A has an inverse.
 
−1 1 4 7
A = adj(A) =
|A| −1 −2

 
−4 7
(b) A =
3 −5
|A| = −1 and |A| =
6 0
∴ A has an inverse.
   
−1 1 −5 −7 5 7
A = adj(A) = (−1) =
|A| −3 −4 3 4

 
6 12
(c) A =
3 6
|A| = 0
∴ A hasn’t an inverse.

 
8 9
(d) A =
3 4
|A| = 5 and |A| =
6 0
∴ A has an inverse.

−9
 
4
5 5 
  
1 1 4 −9
A−1 = adj(A) = =

|A| 5 −3 8

3 4 
5 5
 
0 1
(e) A =
1 7
|A| = −1 and |A| =
6 0
∴ A has an inverse.
   
−1 1 7 −1 −7 1
A = adj(A) = (−1) =
|A| −1 0 1 0

8
  
1 3 −2
(3) A = 0 −1 2 
0 0 1
|A| = −1 and |A| =6 0
∴ A has an inverse.
 
−1 0 0
cof (A) = −3 1 0
4 −2 −1
   
−1 −3 4 1 3 −4
1
A−1 = adj(A) = (−1)  0 1 −2 = 0 −1 2 
|A|
0 0 −1 0 0 1

 
0 2 0
B= 1 2 3 
−1 4 −2
|B| = −2 and |A| =6 0
∴ A has an inverse.
 
−16 −1 6
cof (B) =  4 0 −2
6 0 −2
   
−16 4 6 8 −2 −3
1 −1 
B −1 = adj(B) = −1 0 0  = 1/2 0 0
|B| 2
6 −2 −2 −3 1 1

 
1 2 3
C = 2 3 4
4 5 6
|C| = 0
∴ A hasn’t an inverse.

 
1 4 1
D = 2 3 1
1 −7 −2
|D| = 4 and |D| =
6 0
∴ D has an inverse.
 
1 5 −17
cof (D) = 1 −3 11 
1 1 −5

9
 1 1 1
 
 4 4 4 
   
1 1 1  
1 1  5 −3 1 
D−1 = adj(D) = 5 −3 1  = 
|D| 4  4 4 4 
−17 11 −5 



 −17 11 −5 
4 4 4
2 1 −2
 
3 3 3 
 
 
2 −2 1 
(4) Q = 
3

 3 3 
 
1 2 −2 
3 3 3
|Q| = −1 and |Q| =6 0
∴ Q has an inverse.
−2 −1 2
 
 3 3 3 
 
 
 −2 2 −1 
cof (Q) = 
 3

 3 3 

 
 −1 −2 −2 
3 3 3
−2 −2 −1 2 2 1
  
 3 3 3   3 3 3

 
   
−1 1  −1 2 −2 
= 1
 −2 2 = QT
Q = adj(Q) = (−1) 
|Q|  3
 3 3   3
 3 3
   
 2 −1 −2   −2 1 2
3 3 3 3 3 3
∴ Q−1 = QT =⇒ Q is an orthogonal matrix.

(5) (i) A(CB 2 A)−1 C

= (AA−1 )(CB 2 )−1 C
= I.(B 2 )−1 C −1 C
= I.(B 2 )−1 (CC −1 )
= I.(B 2 )−1 .I
= I.(B 2 )−1 = (B 2 )−1

(ii) (ABA−1 )6
= (ABA−1 )(ABA−1 )(ABA−1 )4
= AB(A−1 A)BA−1 (ABA−1 )4
= AB 2 A−1 (ABA−1 )(ABA−1 )3
= AB 2 (A−1 A)BA−1 (ABA−1 )3

10
 = AB 3 A−1 (ABA−1 )(ABA−1 )2
= AB 3 (A−1 A)BA−1 (ABA−1 )2
= AB 4 A−1 (ABA−1 )(ABA−1 )
= AB 4 (A−1 A)BA−1 (ABA−1 )
= AB 5 (A−1 A)BA−1
= AB 6 A−1

(iii) A−1 (BAT )T B

= A−1 (AB T )B
= (A−1 A)(B T B)
= I.(B T B) = B T B

(iv) AT (CAT )−1 C T

= [AT (AT )−1 ]C −1 C T
= I.C −1 C T
= C −1 C T

*****This PDF made with LaTex*****

#teamLaTex #B18

11