
Discrete Math 11. Consider the function f : ZZ, given by f(n) = 5n - 2....
4. (10 points) Let f(x): R +2, f(1) = [2] – 2. (a) Determine if f is one-to-one (injective). Justify your answer. (b) Determine if f is onto (surjective). Justify your answer.
Answer the questions in the space provided below. 1. The definition of a function f: X + Y is as a certain subset of the product X x Y. Let f: N + N be the function defined by the equation f(n) = n2. For each pair (x, y) listed below, determine whether or not (x,y) ef. a) (2,4) b) (5, 23) c) (1,1) d) (-3,9) 2. For each function defined below, state whether it is injective (one-to-one) and whether...
Discrete math for Computer Science, Sets: Binary relations /
Functions
Please show work
2. Let S = {0, 2, 4, 6), and T-1, 3, 5, 7). Determine whether each of the following sets of ordered pairs is a function from S to T. If so, is it injective, surjective, and bijective?
Consider the function f : {0,1} » N → NU{0} defined as f(x,y) = (-1)22 y. Is f injective? Surjective? Explain your answer.
5. Let A = P(R). Define f : R → A by the formula f(x) = {y E RIy2 < x). (a) Find f(2). (b) Is f injective, surjective, both (bijective), or neither? Z given by f(u)n+l, ifn is even n - 3, if n is odd 6. Consider the function f : Z → Z given by f(n) = (a) Is f injective? Prove your answer. (b) Is f surjective? Prove your answer
A function f : A - B is said to be injective (or one-to-one) provided Va, a2 € A, f(a) = f(az) ► a1 = . A function g: A + B is said to be surjective (or onto) provided W6 € B, 3 some a € A such that g(a) = b. A function h: A → B is said to be bijective (or a bijection or a one-to-one correspondence) if it is both injective and surjective. The following...
2. Show that the function f:N→Q defined by f(n) = is injective but not surjective.
1. a) Let A = {2n|n ∈ ℤ} (ie, A is the set of even numbers) and define function f: ℝ → {0,1}, where f(x) = XA(x) That is, f is the characteristic function of set A; it maps elements of the domain that are in set A (ie, those that are even integers) to 1 and all other elements of the domain to 0. By demonstrating a counter-example, show that the function f is not injective (not one-to-one). b)...
Discrete Math
The following functions all have domain {1,2,3,4,5} and codomain 1,2,3. For each, determine whether it is jective, bijective, 3. (only) injective, (only) sur neither injective nor surjective. or 1 2 4 5 3 (a) f 1 2 1 2 1 2 3 45 1 (b) f 1 2 1 2 3 if x 3 (c) f(x) if x >3 x -3
Please detail all your answers 2. Consider the function f : {1, 2, 3, 4, 5} → {1, 2, 3, 4} given by the table below: (15 points) x 1 2 3 4 5 f (x) 3 2 4 1 2 (a) Is f injective? Explain. (b) Is f surjective? Explain. (c) Write the function using two-line notation. 5. In the game of Hearts, four players are each dealt 13 cards from a deck of 52. Is this a function?...