i hope it will help you...
please.show work and answer full.question. this js discrete math. 1. Determine whether each of the functions...
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
ONLY THE LAST ONE (4) . DISCRETE MATH Problem 1: Show that f(n) = (n + 2) log2(n+ 1) + log2 (n3 + 1) is O(n log2 n). Problem 2: Prove that x? + 7x + 2 is 12(x°). Problem 3: Prove that 5x4 + 2x} – 1 is ©(x4). Problem 4: Find all pairs of functions in the following list that are of the same order: n2 + logn, 21 + 31, 100n3 +n2, n2 + 21, n? +...
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?
For each of the following functions, determine whether or not they are (i) one-to-one and i) onto. Justify your answers (a) f : R-{0} → R and f(x) = 3r-1/x (b) g : R _ {1} → R and g(x) = x + 1/(x-1) (c) l : S → Znon-reg and l(s) = number of 1's in s, for all strings s E S, where s is the set of all strings of O's and 1's. (d) 1 : S...
(a) Determine whether each of the following functions is uniformly continu- ous on the given domain. Justify your answer in each case. (i) f(x) = log (2 + cos(e«)) on R. (ii) g(x) = Väsin ( sin on (0,1).
7. Determine whether each of these functions is one-to-one or onto. (a) f:Z + Z, f(n) 3n +1.
k Determine whether the rule describe a function with the given domain and target. You must provide a specific counterexample if you determine it is not a function. (Note that the symbol squareroot refers to the principal or positive square squreroot .) f:R rightarrow R where f(x) = sqaurerootx f:Z rightarrow where f(n) = squaretrootn^2 + 1 For c, d and e below, consider the function: f: {0,1}^n rightarrowZ (i.e., f maps elements from the set of all bit strings...
Discrete Math 11. Consider the function f : ZZ, given by f(n) = 5n - 2. (a). Show that f is injective (namely, one-to-one). (b). Determine if f is surjective (namely, onto). Justify your answer.
For each of the following functions, state whether or not the function is one-to-one, onto, both, or neither: 1) f : Z → Z defined by f(x)=2x + 1; 2) f : R → R defined by f(x)=2x + 1;
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...