Show that the relation (R) defined by (a,b)R(c,d) -> a+d=b+c on the set N X N is an equivalence relation
pls someone solve these problems
1. show that f:R-R defined by f(x) = 2x3 -7 for all x belonging to R is bijective
2. f(x) = x+7 g(x) = x-7 x belonging to R find (fog)(7)
3.f(x) = x3 g(x)= cos3x find fog(x)
4.f:R-R f(x) = x/x2 +1 find f (f (x))
5. f:R-R f(x) = x2 - 3x + 2 find f (f (x))
6.f(x) = mode x g(x) = [x] f:R-R find fog(5/ 2) gof ( - square root 2) where [ greatest integer function]
let f:n-n defined by f(x)= n+1/2, if n is odd
n/2, if n i even
state whether f is bijective ?
i know how to prove that f is 1-1 . i need help for if f is onto or not ..
Show that the relation (R) defined by (a,b)R(c,d) -> a+d=b+c on the set N X N is an equivalence relation
pls someone solve these problems
1. show that f:R-R defined by f(x) = 2x3 -7 for all x belonging to R is bijective
2. f(x) = x+7 g(x) = x-7 x belonging to R find (fog)(7)
3.f(x) = x3 g(x)= cos3x find fog(x)
4.f:R-R f(x) = x/x2 +1 find f (f (x))
5. f:R-R f(x) = x2 - 3x + 2 find f (f (x))
6.f(x) = mode x g(x) = [x] f:R-R find fog(5/ 2) gof ( - square root 2) where [ greatest integer function]
let f:n-n defined by f(x)= n+1/2, if n is odd
n/2, if n i even
state whether f is bijective ?
i know how to prove that f is 1-1 . i need help for if f is onto or not ..