Roll No.

:   BC190401228

Name : ARSLAN MEHMOOD 

Subject: mth202

Assignment No. : 01

---------------------------------------------------------------------------------------------------------------

Question No 1:

Marks=10 Formulate the argument symbolically and test its validity using the truth table.

The number is not divisible by 12 if and only if it is not divisible by 3 and 4.

The number is divisible by 12 Therefore it is divisible by 3 and 4

Solution:

let p= The number is divisible by 12

q= it is divisible by 3 and 4

symbolically:  p  q

Premises Conclusion

  

P q p q  p  q
T T F F T
 critical _ Row
T F F T F
F T T F F
F F T T T

As premises are true and conclusion is also true so argument is Valid.

Question No 2:

x 1
f ( x) 
Given function x2

(a) Find Domain and range of f

b) Determine whether

1) f is injective

2) f is surjective

3) f is bijective

Solution:

(a) Find Domain and range of f(x)

Domain:

x 1
f ( x)  ,x  0
x2

x20

x  2
Domain= ( , 2)  (2, )

Range:

(,1)  (1, )

b) Determine whether

1) f is injective

2) f is surjective

3) f is bijective

f is injective where x1  x2 such that f ( x1 )  f ( x2 )

f ( x1 )  f ( x2 )
x 1
f ( x) 
x2
x1  1 x2  1

x1  2 x2  2
( x1  1)( x2  2)  ( x2  1)( x1  2)
x1 x2  2 x1  x2  2  x2 x1  2 x2  x1  2
x1 x2  2 x1  x2  2  x2 x1  2 x2  x1  2  0
2 x1  x2  2 x2  x1  0
2 x1  x2  x1  2 x2  0
x1  x2  0
x1  x2

x1  x2 & f is injective.
Here,

Now check f for serjective

f ( x)  y
x 1
f ( x) 
x2
x 1
y
x2
( x  1)  y ( x  2)
( x  1)  xy  2 y
x  xy  2 y  1
x(1  y )  2 y  1
(2 y  1)
x , y  1  0, y  1
(1  y )

f is not surjective


As Bijective is a combination of injective and surjective So here f is not surjective so it cannot
bijective.