Let n be the set of natural numbers and let f be the set of total functions from set n to set {0,1}.

a) construct a total injective function: g1: n > f. if such a function does not exist, explain why.

b) construct a total surjective function: g2: n > p(n). if such a function does not exist, explain why.

c) construct a total bijective function: g3: p(n) > f. if such a function does not exist, explain why.

his chances of getting a coin of higher value is 4/19

step-by-step explanation:

3. (5x + 1) - (-10x + 6)

simplify the answer choice. combine like terms. remember to distribute the negative to the terms inside the second parenthesis. also remember that two negatives = one positive, and one of each sign = negative.

- (-10x + 6) = + 10x - 6

simplify. combine like terms:

5x + 1 + 10x - 6

5x + 10x + 1 - 6

15x - 5

∴ it is your answer

~

the domain of a function is the set of input values, x , for which a function is defined. the domain is shown in the left oval in the picture below. the function provides an output value, f(x) , for each member of the domain.

nope lol

step-by-step explanation: