Question

How many different onto functions f:S→Tf:S→T can be defined that map the domain S={1,2,3,…,10}S={1,2,3,…,10} to the...

How many different onto functions f:S→Tf:S→T can be defined that map the domain S={1,2,3,…,10}S={1,2,3,…,10} to the range T={11,12,13,…,20}T={11,12,13,…,20}? Enter your answer in the box below.

Homework Answers

Answer #1

Hence the total number of onto function from S to T is 3,628,800.

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
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?
Consider the functions  f (t)  =  e t and  g(t)  =  e−3t  defined on  0  ≤ ...
Consider the functions  f (t)  =  e t and  g(t)  =  e−3t  defined on  0  ≤  t  <  ∞. (a) ( f ∗ g)(t) can be calculated as t ∫ 0 h(w, t) dw Enter the function h(w, t) into the answer box below. (b) ( f ∗ g)(t) can also be calculated as ℒ  −1{H(s)}. Enter the function H(s) into the answer box below. (c) Evaluate ( f ∗ g)(t)
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?
how many different lists of length five can you make consisting of (1,2,3) when each number...
how many different lists of length five can you make consisting of (1,2,3) when each number appears at least once?
1. Consider sets AA and BB with |A|=9|| and |B|=19.. How many functions f:A→B are there?...
1. Consider sets AA and BB with |A|=9|| and |B|=19.. How many functions f:A→B are there? Note: Leave your answer in exponential form. (Ex: 5^7) 2. Consider functions f:{1,2,3}→{1,2,3,4,5,6}. How many functions between this domain and codomain are injective? 3. A combination lock consists of a dial with 39 numbers on it. To open the lock, you turn the dial to the right until you reach the first number, then to the left until you get to the second number,...
In how many ways can you distribute 10 different balls into 4 different boxes, so there's...
In how many ways can you distribute 10 different balls into 4 different boxes, so there's no box with exactly 3 balls?
Question 41 How many different seven-person committees can be formed each containing 3 women from an...
Question 41 How many different seven-person committees can be formed each containing 3 women from an available set of 20 women and 4 men from an available set of 30 men? Question 29 Use two of the following sets for each part below. Let X = {a, b, c}, Y = {1, 2, 3, 4} and Z = {s, t}. a) Using ordered pairs defines a function that is one-to-one but not onto. b) Using ordered pairs defines a function...
Using seven different Scrabble blocks with the letters: a,e,o,n,r,s,t written on them: a) How many different...
Using seven different Scrabble blocks with the letters: a,e,o,n,r,s,t written on them: a) How many different seven letter arrangements are possible? b) How many three letter arrangements are possible? c) If I choose three letters, then in how many ways can I do this d) If I select six letters then in how many ways can I do this
Consider the following initial value problem. y′ + 5y  = { 0 t  ≤  2 10...
Consider the following initial value problem. y′ + 5y  = { 0 t  ≤  2 10 2  ≤  t  <  7 0 7  ≤  t  <  ∞ y(0)  =  5 (a) Find the Laplace transform of the right hand side of the above differential equation. (b) Let y(t) denote the solution to the above differential equation, and let Y((s) denote the Laplace transform of y(t). Find Y(s). (c) By taking the inverse Laplace transform of your answer to (b), the...
How many ways can be distributed to the box of (n+1) different balls provided that "no...
How many ways can be distributed to the box of (n+1) different balls provided that "no box remains empty".