Question

Let S = {a,b,c,d,e,f,g} and let T = {1,2,3,4,5,6,7,8}. a.  How many different functions are there from...

Let S = {a,b,c,d,e,f,g} and let T = {1,2,3,4,5,6,7,8}.

a.  How many different functions are there from S to T?
b. How many different one-to-one functions are there from S to T?
c. How many different one-to-one functions are there from T to S?
d. How many different onto functions are there from T to S?

Homework Answers

Answer #1

and

a) Number of different functions are there from S to T are

b) Number of different one-to-one functions are there from S to T are

c) Number of different one-to-one functions are there from T to S are

because ,

d) Number of different onto functions are there from T to S are

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Let Let A = {a, e, g} and B = {c, d, e, f, g}. Let...
Let Let A = {a, e, g} and B = {c, d, e, f, g}. Let f : A → B and g : B → A be defined as follows: f = {(a, c), (e, e), (g, d)} g = {(c, a), (d, e), (e, e), (f, a), (g, g)} (a) Consider the composed function g ◦ f. (i) What is the domain of g ◦ f? What is its codomain? (ii) Find the function g ◦ f. (Find...
We have 1,2,3,4,5,6,7,8,a,b,c,d,e,f the numbers and letters are in order. How many permutations (arrangements) are there...
We have 1,2,3,4,5,6,7,8,a,b,c,d,e,f the numbers and letters are in order. How many permutations (arrangements) are there in a way that the order is maintained for numbers and the order is maintained for letters? Explain.
Let z=f(a,b,c) where a=g(s,t), b=h(l(s+t),t), c=tsin(s). f,g,h,l are all differentiable functions. Compute the partial derivatives of...
Let z=f(a,b,c) where a=g(s,t), b=h(l(s+t),t), c=tsin(s). f,g,h,l are all differentiable functions. Compute the partial derivatives of z with respect to s and the partial of z with respect to t.
Let f and g be continuous functions from C to C and let D be a...
Let f and g be continuous functions from C to C and let D be a dense subset of C, i.e., the closure of D equals to C. Prove that if f(z) = g(z) for all x element of D, then f = g on C.
Let f : A → B and g : B → C. For each of the...
Let f : A → B and g : B → C. For each of the statements in this problem determine if the statement is true or false. No explanation is required. Just put a T or F to the left of each statement. a. g ◦ f : A → C b. If g ◦ f is onto C, then g is onto C. c. If g ◦ f is 1-1, then g is 1-1. d. Every subset of...
9. Let S = {a,b,c,d,e,f,g,h,i,j}. a. is {{a}, {b, c}, {e, g}, {h, i, j}} a...
9. Let S = {a,b,c,d,e,f,g,h,i,j}. a. is {{a}, {b, c}, {e, g}, {h, i, j}} a partition of S? Explain. b. is {{a, b}, {c, d}, {e, f}, {g, h}, {h, i, j}} a partition of S? Explain. c. is {{a, b}, {c, d}, {e, f}, {g, h}, {i, j}} a partition of S? Explain.
let A = { a, b, c, d , e, f, g} B = { d,...
let A = { a, b, c, d , e, f, g} B = { d, e , f , g} and C ={ a, b, c, d} find : (B n C)’ B’ B n C (B U C) ‘
1. Let A = {1,2,3,4} and let F be the set of all functions f from...
1. Let A = {1,2,3,4} and let F be the set of all functions f from A to A. Prove or disprove each of the following statements. (a)For all functions f, g, h∈F, if f◦g=f◦h then g=h. (b)For all functions f, g, h∈F, iff◦g=f◦h and f is one-to-one then g=h. (c) For all functions f, g, h ∈ F , if g ◦ f = h ◦ f then g = h. (d) For all functions f, g, h ∈...
There are two sets S and T. |S|=4 and |T|=10, how many one to one functions...
There are two sets S and T. |S|=4 and |T|=10, how many one to one functions and onto functions can be made from these sets?
Let letters A,B,C,D,E,F,G be used to form strings of length 4. How many strings of length...
Let letters A,B,C,D,E,F,G be used to form strings of length 4. How many strings of length 4 with repetitions contain A and B. How about without repetitions?