Question
For each of the following functions determine whether they are injective. Given a setA, we denote the set of all finite subsets o fAbyP fin
For each of the following functions determine whether they are injective. Given a setA, we denote the set of all finite subsets o fAbyPfin(A). Also we denote the set of all positive prime numbers byP.
(a)f1:NPfin(P) is defined by
f1(n)=the set of all pPsuch that p | n (p divides n).
(b)f2:NNQ+is defined byf2(k, l) =k / l
(c)f3: [0,][0,1] is defined byf3(x) = cosx.
(d)f4: (0,1)(0,1) is defined byf4(x) =x2,x3.
(e)f5:P(N)P(N) is defined byf5(X) =Xc.
(f) f6: P(N)P(N)P(N)is defined by f6(X,Y)=X \ Y.
(g)Given a setXN, define
Xe={ n X | n is even}
and
Xo ={ n X | n is odd}
Also denote byEthe set of all even numbers inNand byOthe set of all
odd numbers inN. Functionf7:P(N)P(E)P(O) is defined by
f7(X) =Xe, Xo.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started