MTH202
Assignment No.1
ST:ID=bc190410895
Question No .1
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
Sol:-
Let p = the number is divisible by 12
q = the number is divisible by 3 and 4
in symbolically
The number is not divisible by 12
if and only ifit is not divisible by 3 and 4.
(i ) p q
The number is divisible by 12
Therefore it isdivisible by 3 and 4
(ii ) p q
Now we prove that by truth table
p q p q p q p q pq
T T F F T T T T
T F F T F T F F
F T T F F F T F
F F T T T F F T
Hence proved by truth table
Question No 2
x 1
Given function f (x)
x2 a) Find Domain and range of f b) Determine whether
1) fis injective 2) f is surjective 3) f is bijective
Solution:-
x 1
f (x)
x2
a) Find Domain and range of f
sol:-
x 1
f ( x)
x2
x20
so x -2
Domain all real number except -2
Or = R-{-2}
or Domain of f ( x) (, 2) (2, )
For finding range
let
f ( x) y
x 1
So y
x2
y ( x 2) x 1
yx 2 y x 1
yx-x =1-2y
x(y-1) = 1-2y
1 2 y
x =
y 1
y 1 0
y 1
hence
All real number except 1
Range R {1}
b) Determine whether
1) f is injective 2) f is surjective 3) f is bijective
Solution:-
let
f (x1 ) f ( x2 )
1.
x1 1 x2 1
x1 2 x2 2
( x1 1)( x2 2) ( x1 2)( x2 1)
x1 x2 2 x1 x2 2 x1 x2 x1 2 x2 2
2 x1 x2 x1 2 x2
2 x1 x1 2 x2 x2
x1 x2
So f(x) is injective or one to one.
2).
Let y , there exist x such that f (x) y
x 1
y
x2
x 1 xy 2 y
x xy 2 y 1
x(1 y ) 2 y 1
2 y 1
x
1 y
1 y 0
y 1
For every y , there exist x such that f (x) y
But here for y 1 , there exist no x
So f(x) is not surjective. As f(x) is injective only and not surjective so f(x) is not bijective.