B.Sc.

Engineering
Semester 1 - 2018 batch
MA 1013 Mathematics

Tutorial 01-Answers
Section A (Logic and Set Theory)
(1) (i) q ≡ (q ∧ p) ∨ (q∧ ∼ p)

q p q∧p q∧ ∼ p (q ∧ p) ∨ (q∧ ∼ p)
T T T F T
T F F T T
F T F T F
F F F F F
∴ q ≡ (q ∧ p) ∨ (q∧ ∼ p)
(ii) q ≡ (q∨ ∼ p) ∧ (q ∨ p)
|{z} | {z }
L.H.S. R.H.S
R.H.S ≡ (q∨ ∼ p) ∧ (q ∨ p)
≡ q ∨ (∼ p ∧ p) (Distributive Law)
≡ q ∨ f (Complement Law)
R.H.S. ≡ q ≡ L.H.S. (Identity Law)

(2) (i) p =⇒ (q ∧ r) ≡∼ p ∨ (q ∧ r)
≡ (∼ p ∨ q) ∧ (∼ p ∨ r) (Distributive Law)
≡ (∼ p ∨ q ∨ (r∧ ∼ r)) ∧ (∼ p ∨ r ∨ (q∧ ∼ q)) (Identity Law and Complement Law)
≡ (∼ p ∨ q ∨ r) ∧ (∼ p ∨ q∨ ∼ r) ∧ (∼ p ∨ q ∨ r) ∧ (∼ p∨ ∼ q ∨ r) (Distributive Law)
≡ (∼ p ∨ q ∨ r) ∧ (∼ p ∨ q∨ ∼ r) ∧ (∼ p∨ ∼ q ∨ r)

(ii) (p ∨ q) =⇒ r ≡ r ∼∼ (p ∨ q) (Commutative Law)

≡ r ∨ (∼ p∧ ∼ q) (De Moran’s Law)
≡ (r ∨ (∼ p)) ∧ (r ∨ (∼ q)) (Distributive Law)
≡ (r∨ ∼ p ∨ (r∧ ∼ r)) ∧ (r∨ ∼ q ∨ (p∧ ∼ p)) (Identity Law and Complement Law)
≡ (∼ p ∨ q ∨ r) ∧ (∼ p∨ ∼ q ∨ r) ∧ (p∨ ∼ q ∨ r) ∧ (∼ p∨ ∼ q ∨ r) (Distributive Law)
≡ (∼ p ∨ q ∨ r) ∧ (∼ p∨ ∼ q ∨ r) ∧ (p∨ ∼ q ∨ r)

(iii) ∼ (∼ p ∨ q) ∨ (r =⇒ ∼ s) ≡ (p∧ ∼ q) ∨ (∼ r∨ ∼ s)
≡ (p∨ ∼ r∨ ∼ s) ∧ (∼ q∨ ∼ r∨ ∼ s) (De Morgan’s Law)
≡ (p∨ ∼ r∨ ∼ s ∨ (q∧ ∼ q)) ∧ (∼ q∨ ∼ r∨ ∼ s ∨ (p∧ ∼ p))(Identity Law and
Complement Law)
≡ (p ∨ q∨ ∼ r∨ ∼ s) ∧ (p∨ ∼ q∨ ∼ r∨ ∼ s) ∧ (p∨ ∼ q∨ ∼ r∨ ∼ s) ∧ (∼ p∨ ∼ q∨ ∼
r∨ ∼ s) (Distributive Law)
≡ (p ∨ q∨ ∼ r∨ ∼ s) ∧ (p∨ ∼ q∨ ∼ r∨ ∼ s) ∧ (p∨ ∼ q∨ ∼ r∨ ∼ s)

1
 (iv) p ∨ (∼ q ∧ (∼ r ∨ p)) ≡ (p∨ ∼ q) ∧ (p ∨ (∼ r ∨ p)) (Distributive Law)
≡ (p∨ ∼ q) ∧ (p ∨ (∼ p∨ ∼ r)) (Commutative Law)
≡ (p∨ ∼ q) ∧ ((p∨ ∼ p) ∼ r) (Associative Law)
≡ (p∨ ∼ q) ∧ (T∨ ∼ r) (Complement Law)
≡ (p∨ ∼ q) ∧ T (Identity Law)
(p∨ ∼ q) ≡ (p∨ ∼ q) ∨ (∼ r ∧ r) (Identity Law and Complement Law)
(p∨ ∼ q ∨ r) ∧ (p∨ ∼ q∨ ∼ r) (Distributive Law)

(v) ∼ (p ∧ (r =⇒ q)) ≡∼ (p ∧ (∼ r ∨ q))

≡∼ p∨ ∼ (∼ r ∨ q) (De Morgan’s Law)
≡∼ p ∨ (r∧ ∼ q) (De Morgan’s Law)
≡ (∼ p ∨ r) ∧ (∼ p∨ ∼ q) (Distributive Law)
≡ (∼ p ∨ r ∨ (q∧ ∼ q)) ∧ (∼ p∨ ∼ q ∨ (r∧ ∼ r)) (Identity Law and Complement
Law)
≡ (∼ p ∨ q ∨ r) ∧ (∼ p∨ ∼ q ∨ r) ∧ (∼ p∨ ∼ q ∨ r) ∧ (∼ p∨ ∼ q∨ ∼ r) (Distributive
Law)
≡ (∼ p ∨ q ∨ r) ∧ (∼ p∨ ∼ q ∨ r) ∧ (∼ p∨ ∼ q∨ ∼ r)

(3) S =⇒ R; Premises: P ⇐⇒ Q, (S ∨ T ) =⇒ Q, ∼ P ∨ (∼ T ∧ R)

(1) P ⇐⇒ Q (Premise)
(2) (P =⇒ Q) ∧ (Q =⇒ P )(From (1))
(3) Q =⇒ P (From (2),Simplification)
(4) (S ∨ T ) =⇒ Q (Premise)
(5) (S ∨ T ) =⇒ P (From (3) and (4), Hypothetical Syllogism)
(6) ∼ P ∨ (∼ T ∧ R) (Premise)
(7) P =⇒ (∼ T ∧ R) (From (6))
(8) (S ∨ T ) =⇒ (∼ T ∧ R) (From (5) and (7), Hypothetical Syllogism)
(9) ∼ (S ∨ T ) ∨ (∼ T ∧ R) (From (8))
(10) (∼ S∧ ∼ T ) ∨ (∼ T ∧ R) (From (9))
(11) (∼ T ∧ ∼ S) ∨ (∼ T ∧ R) (Commutative Law)
(12) ∼ T ∧ (∼ S ∨ R) (Distributive Law)
(13) ∼ S ∨ R (From (12),Simplification)
(14) S =⇒ R (From (13))

Section B (Real Analysis)

(1) (1) a, b ∈ R
(ab)n = a n n
b
| {z } |{z}
L.H.S. R.H.S.

2
 L.H.S. = (ab)n
= (ab)(ab)(ab)(ab)..........(ab) (By the definition of exponentiation)
| {z }
n times
= a(ba)b.(ab)(ab)(ab).......(ab) (Associative Law)
= (aa)(bb) (ab)(ab)(ab)......(ab) (Commutative Law and Associative Law)
| {z }
(n−2) times
2 2
= a b (ab)(ab)(ab)......(ab) (By the definition of exponentiation)
| {z }
(n−2) times
2 2
= a (b a)b(ab)(ab)(ab)........(ab)
= (a2 a)(b2 b).........(ab) = a3 b3 ........(ab)

Likewise L.H.S = R.H.S

an
(2) (ab−1 )n = n
| {z } |{z}b
L.H.S.
R.H.S.

L.H.S = (ab−1 )n
−1 n
= an (b ) (Proved in (1)(i))
  n
1
= an (Since b−1 is the multiplicative inverse of b)
 b 
1 1 1 1
= an ......
bbb b
| {z }
 n times 
n 1.1.1.1........1
=a
b.b.b.b........b
| {z }
n times
an 1n (a.1)n
= n = (Proved in (1)(i))
bn bn
a
= n (Multiplicative Identity)
b
L.H.S = R.H.S.

(2) (a1 a2 a3 ...........an )−1 = a−1 −1 −1 −1

1 a2 a3 .........an

(a1 a2 a3 ...........an )(a1 a2 a3 ...........an )−1 = 1 (Multiplicative Inverse)

−1 −1 −1 −1
 1 −1a2 −1a3 −1.........an−1) [(a1 a2 a3 ...........an )(a
(a −1
 1 a2 a3 ...........an ) −1] = a−1 −1 −1 −1
1 a2 a3 .........an
−1 −1 −1
(a1 a2 a3 .........an )(a1 a2 a3 ...........an ) (a1 a2 a3 ...........an ) = a1 a2 a3 .........a−1 n
(Associative Law)

(a1 a2 a3 ...........an )(a−1 −1 −1 −1 −1

= a−1 −1 −1 −1
 
1 a2 a3 .........an ) (a1 a2 a3 ...........an ) 1 a2 a3 .........an
(Commutative Law)

a1 a2 a3 ...........(an a−1 −1 −1 −1
(a1 a2 a3 ...........an )−1 = a−1 −1 −1 −1
 
1 )a2 a3 .........an 1 a2 a3 .........an
(Associative Law)

3
 a1 a2 a3 ...........(a−1 −1 −1 −1
(a1 a2 a3 ...........an )−1 = a−1 −1 −1 −1
 
1 an )a2 a3 .........an 1 a2 a3 .........an
(Commutative Law)

Likewise
(a1 a−1 −1 −1 −1 −1
= a−1 −1 −1 −1
 
1 )a2 a3 a4 ........an (a2 a3 .........an ) (a1 a2 a3 ...........an ) 1 a2 a3 .........an
Likewise
(a1 a−1 −1 −1 −1 −1
= a−1 −1 −1 −1
 
1 )(a2 a2 )(a3 a3 )...........(an an ) (a1 a2 a3 ...........an ) 1 a2 a3 .........an By Mul-
tiplicative Inverse
1.(a1 a2 a3 ...........an )−1 = a−1 −1 −1 −1
1 a2 a3 .........an
By Multiplicative Identity
(a1 a2 a3 ...........an )−1 = a−1 −1 −1 −1
1 a2 a3 .........an

(3) (i) Let a ∈ R and suppose that a1 and a2 are additive inverses of a
a1 , a2 ∈ R(a1 6= a2 )

a + a1 = 0 → (1)(∵ a1 is an additive inverse of a)

a + a2 = 0 → (2)(∵ a2 is an additive inverse of a)
From (1)=(2),
a + a1 = a + a2
(−a) + (a + a1 ) = (−a) + (a + a2 )
(−a + a) + a1 = (−a + a) + a2 (Associative Law)
(a + (−a)) + a1 = (a + (−a)) + a2 ( Commutative Law)
0 + a1 = 0 + a2 (Additive inverse)
a1 = a2 (Additive Identity) (#Contradiction)

∴ Additive Inverse of a is unique.

(ii) Assume ∃b, c ∈ R s.t.ab = ba = 1 and ac = ca = 1(b 6= c)

b and c are multiplicative inverses of a
ac = 1(∵ c is a multiplicative inverse of a)
b(ac) = b.1
b(ac) = b (Multiplicative Identity)
(ba)c = b (Associative Law)
1.c = b(∵ b is a multiplicative inverse of a)
c = b (Multiplicative Identity) (#Contradiction)

∴ Multiplicative Identity of a is unique.

Section C (Vectors and Matrices)

 
6 −9 12
(1) (a) (i) 3A = 9 6 6 
3 −3 9

4
    
−2 1 4 −2
(ii) −2B = −2  3 4 = −6 −8 
−1 5 2 −10

(iii) A + B can not be existed because of orders aren’t the same.

     
−2 1 −3 2 −5 3
(iv) B + C =  3 4 +  1 −4 =  4 0
−1 5 6 2 −5 7

(v) A + 3I can not be existed because of orders aren’t the same when I is an unit
matrix(A square matrix)

   
2 −3 4   5 −3 4
1 0 00 1 0
(vi) A + 3I = 3 2 2 + 3 = 3 5 2 
0 0 1
1 −1 3 1 −1 6
     
2 −3 4 −2 1 −17 10
(vii) AB = 3 2 2 ×  3 4 =  −2 21
1 −1 3 −1 5 −8 12

(viii) BA can not be existed because of no. of columns in B is not equal to the no.of
rows in A.

(ix) BC can not be existed because of no. of columns in B is not equal to the no.
of rows in C.

   
−3 2   −4 −13 −9
2 3 1
(x) CD =  1 −4 = −2 11 13 
1 −2 −3
6 2 14 14 0
    
2 −3 4 2 −3 4 −1 −16 14
(xi) A2 = 3 2 2 3 2 2 =  14 −7 22
1 −1 3 1 −1 3 2 −8 11

(xii) B 2 can not be existed because of B isn’t a square matrix.

   
−2 1   −3 −8 −5
2 3 1
(xiii) BD =  3 4 × =  10 1 −9 
1 −2 −3
−1 5 3 −13 −16

5
      
−3 −8 −5 −3 −8 −5 −86 81 167
(BD)2 =  10 1 −9  ×  10 1 −9  =  −47 38 85 
3 −13 −16 3 −13 −16 −187 171 358

(b) Suppose that ;

RA : No.of rows in A
CA : No.of columns in A
RB : No.of rows in B
RB : No.of columns in B

If AB can be defined; CA = RB → (1)

If BA can be defined; CB = RA → (2)

Order of AB = RA × CB , from (2) =⇒ CB × CB =⇒ AB is a square ma-

trix.
Order of BA = RB × CA , from(1) =⇒ CA × CA =⇒ BA is a square matrix

(i) (A − B)(A + B) = A.(A + B) − B(A + B) = A × A + A × B − B × A − B × B

∵ AB − BA = 0; A × A − B × B = A2 − B 2

   
1 2 1 0
(ii) A = and B =
1 3 0 0

(iii) (A + B)2 = (A + B)(A + B)

= A × (A + B) + B × (A + B)
=A×A+A×B+B×A+B×B
= A2 + AB + BA + B 2
AB = BA ⇐⇒ AB + BA = 2AB ⇐⇒ A2 + 2AB + B 2 = (A + B)2

   
0 6 0 6
(2) (i) AB = 1 2 and 1 2
1 8 1 8
∴ AB = AC

 
2 1
(ii) A =
3 −1
    
2 2 1 2 1 7 1
A = = → (1)
3 −1 3 −1 3 4
     
2 1 1 0 7 1
A + 5I = +5 = → (2)
3 −1 0 1 3 4
From (1) and (2), A2 = A + 5I

A6 = (A2 )3 A6 = (A + 5I)3

6
 A6 = A3 + 3A.25I 2 + 3A2 .5I + 125I 3
A6 = A3 + 75I 2 A + 15IA2 + 125I 3
A6 = A3 + 75A + 15A2 + 125I
A6 = A(A + 5I) + 75A + 15A2 + 125I
A6 = A2 + 5A + 75A + 15A2 + 125I
A6 = 16(A + 5I) + 80A + 125I
A6 = 16A + 80I + 80A + 125I
A6 = 96A + 205I

 
T 1 −3 4
(i) A =
−2 0 5

 
2 −4 5
−5 6 0
(ii) B T = 
4

5 8
3 5 6

 
1 4 2
(iii) C T = 4 −3 6
2 6 7

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

#teamLaTex #B18