Question

Let A and B be two sets, with | A | = m, | B |...

Let A and B be two sets, with | A | = m, | B | = n, Then how many distinct surjection from A to B?

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

Solurtion:-

  • Let X and Y be finite non-empty sets, with m and n elements both not equal to zero, respectively.

    Then the number of functions can be defined from X to Y is

    If then the number of injective functions from X to Y is

    If then the number of surjective functions from X to Y is

    If then the number of surjective functions from X to Y is zero.

    If m=n then the number of bijective functions from X to Y is n!

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
· Let A and B be sets. If A and B are countable, then A ∪...
· Let A and B be sets. If A and B are countable, then A ∪ B is countable. · Let A and B be sets. If A and B are infinite, then A ∪ B is infinite. · Let A and B be sets. If A and B are countably infinite, then A ∪ B is countably infinite. Find nontrivial sets A and B such that A ∪ B = Z, then use these theorems to show Z is...
q1, Let A, B be sets such that A ∩ B = B. Show that B...
q1, Let A, B be sets such that A ∩ B = B. Show that B − A = ∅ q2, (∀x ∈ N)(∀y ∈ N). (xy = 0 ⇒ (x = 0 ∧ y = 0)) It is true or not Thanks
Let m ≥ 3. An urn contains m balls labeled 1, . . . , m....
Let m ≥ 3. An urn contains m balls labeled 1, . . . , m. Draw all the balls from the urn one by one without replacement and observe the labels in the order in which they are drawn. Let Xj be the label of the jth draw, 1 ≤ j ≤ m. Assume that all orderings of the m draws are equally likely. Fix two distinct labels a, b ∈ {1, . . . , m}. Let N...
Let A and B be sets and let X be a subset of A. Let f:...
Let A and B be sets and let X be a subset of A. Let f: A→B be a bijection. Prove that f(A-X)=B-f(X).
Let A and B be sets. Prove that A ⊆ B if and only if A...
Let A and B be sets. Prove that A ⊆ B if and only if A − B = ∅.
Let A and B be sets. Prove that (A∪B)\(A∩B) = (A\B)∪(B\A)
Let A and B be sets. Prove that (A∪B)\(A∩B) = (A\B)∪(B\A)
(a) Let A and B be countably infinite sets. Decide whether the following are true for...
(a) Let A and B be countably infinite sets. Decide whether the following are true for all, some (but not all), or no such sets, and give reasons for your answers.  A ∪B is countably infinite  A ∩B is countably infinite  A\B is countably infinite, where A ∖ B = { x | x ∈ A ∧ X ∉ B }. (b) Let F be the set of all total unary functions f : N → N...
Let A,BA,B, and CC be sets such that |A|=11|A|=11, |B|=7|B|=7 and |C|=10|C|=10. For each element (x,y)∈A×A(x,y)∈A×A,...
Let A,BA,B, and CC be sets such that |A|=11|A|=11, |B|=7|B|=7 and |C|=10|C|=10. For each element (x,y)∈A×A(x,y)∈A×A, we associate with it a one-to-one function f(x,y):B→Cf(x,y):B→C. Prove that there will be two distinct elements of A×AA×A whose associated functions have the same range.
Let A, B, C be sets. Prove that (A \ B) \ C = (A \...
Let A, B, C be sets. Prove that (A \ B) \ C = (A \ C) \ (B \ C).
Let A, B, C be sets and let f : A → B and g :...
Let A, B, C be sets and let f : A → B and g : f (A) → C be one-to-one functions. Prove that their composition g ◦ f , defined by g ◦ f (x) = g(f (x)), is also one-to-one.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT