Find the number of surjections from A to B.Pascal's relation theorem from the book Combinatorics, R. Merris; need some help in clarificationCombinatorics: How many solns to equation? (principle of inclusion / exclusion)Get the number of subset.Comparing probabilities of drawing balls of certain color, with and without replacementDifferent ways of picking sets producing different results?Number of possibilities of permutation with repetitions with additional equal elements addedStuck trying to understand N Choose K formulaUnderstanding difference between ordered sequences with repetition and unordered sequences with repetitionIs there a relation between the triangular numbers and the combinations with repetition?A subset of three distinct positive integers, each less than 20, is selected. How many subsets will contain exactly one even number?
Need help identifying/translating a plaque in Tangier, Morocco
Finding files for which a command fails
Denied boarding due to overcrowding, Sparpreis ticket. What are my rights?
Manga about a female worker who got dragged into another world together with this high school girl and she was just told she's not needed anymore
"My colleague's body is amazing"
Extreme, but not acceptable situation and I can't start the work tomorrow morning
How to move the player while also allowing forces to affect it
How to answer pointed "are you quitting" questioning when I don't want them to suspect
What is it called when one voice type sings a 'solo'?
Copycat chess is back
Landlord wants to switch my lease to a "Land contract" to "get back at the city"
Is it legal to have the "// (c) 2019 John Smith" header in all files when there are hundreds of contributors?
Is ipsum/ipsa/ipse a third person pronoun, or can it serve other functions?
"listening to me about as much as you're listening to this pole here"
Could a US political party gain complete control over the government by removing checks & balances?
Why is my log file so massive? 22gb. I am running log backups
Unbreakable Formation vs. Cry of the Carnarium
Why airport relocation isn't done gradually?
Where to refill my bottle in India?
How is it possible for user's password to be changed after storage was encrypted? (on OS X, Android)
New order #4: World
Map list to bin numbers
Find the number of surjections from A to B.
Is there any use for defining additional entity types in a SOQL FROM clause?
Find the number of surjections from A to B.
Pascal's relation theorem from the book Combinatorics, R. Merris; need some help in clarificationCombinatorics: How many solns to equation? (principle of inclusion / exclusion)Get the number of subset.Comparing probabilities of drawing balls of certain color, with and without replacementDifferent ways of picking sets producing different results?Number of possibilities of permutation with repetitions with additional equal elements addedStuck trying to understand N Choose K formulaUnderstanding difference between ordered sequences with repetition and unordered sequences with repetitionIs there a relation between the triangular numbers and the combinations with repetition?A subset of three distinct positive integers, each less than 20, is selected. How many subsets will contain exactly one even number?
$begingroup$
Where A = 1,2,3,4,5,6 and B = a,b,c,d,e.
My book says it's:
- Select a two-element subset of A.
- Assign images without repetition to the two-element subset and the four
remaining individual elements of A.
This shows that the total number of surjections from A to B is C(6, 2)5! = 1800.
I'm confused at why it's multiplied by 5! and not by 4!. Also in part 2, when we assign images, do they mean images in B?
combinatorics
asked 4 hours ago
ZakuZaku
1879
$endgroup$
add a comment |
$begingroup$
Where A = 1,2,3,4,5,6 and B = a,b,c,d,e.
My book says it's:
- Select a two-element subset of A.
- Assign images without repetition to the two-element subset and the four
remaining individual elements of A.
This shows that the total number of surjections from A to B is C(6, 2)5! = 1800.
I'm confused at why it's multiplied by 5! and not by 4!. Also in part 2, when we assign images, do they mean images in B?
combinatorics
asked 4 hours ago
ZakuZaku
1879
$endgroup$
$begingroup$
There are $5$ objects, not $4$. One object is the double, but that doesn't change anything,
$endgroup$
– lulu
4 hours ago
$begingroup$
I thought since we have a subset of 2, we multiply by 4! since there are 4 elements left in A.
$endgroup$
– Zaku
4 hours ago
1
$begingroup$
It's not a question of what's left in $A$. Having paired, say, $1,2$ we now need to count the surjections of $P,3,4,5,6$ onto $a,b,c,d,e$, where $P$ denotes the pair $(1,2)$. There are clearly $5!$ such surjections.
$endgroup$
– lulu
4 hours ago
$begingroup$
" I thought ..., we multiply by 4! since there are 4 elements left in A." But you haven't chosen which of the 5 elements that subset of 2 map to. Would it make more sense if we said the (number of ways to chose the two that aren't distinct)(choices for that pair)(choices for what is left) $=6choose 2*5*4! $? That's actually the same thing as (number of ways to chose the two that aren't distinct)(number of choices for the four distinct and the pair)$=6choose 2*5! $.
$endgroup$
– fleablood
3 hours ago
add a comment |
$begingroup$
Where A = 1,2,3,4,5,6 and B = a,b,c,d,e.
My book says it's:
- Select a two-element subset of A.
- Assign images without repetition to the two-element subset and the four
remaining individual elements of A.
This shows that the total number of surjections from A to B is C(6, 2)5! = 1800.
I'm confused at why it's multiplied by 5! and not by 4!. Also in part 2, when we assign images, do they mean images in B?
combinatorics
asked 4 hours ago
ZakuZaku
1879
$endgroup$
Where A = 1,2,3,4,5,6 and B = a,b,c,d,e.
My book says it's:
- Select a two-element subset of A.
- Assign images without repetition to the two-element subset and the four
remaining individual elements of A.
This shows that the total number of surjections from A to B is C(6, 2)5! = 1800.
I'm confused at why it's multiplied by 5! and not by 4!. Also in part 2, when we assign images, do they mean images in B?
combinatorics
combinatorics
asked 4 hours ago
ZakuZaku
1879
asked 4 hours ago
ZakuZaku
1879
asked 4 hours ago
ZakuZaku
1879
asked 4 hours ago
ZakuZaku
1879
asked 4 hours ago
ZakuZaku
1879
1879
$begingroup$
There are $5$ objects, not $4$. One object is the double, but that doesn't change anything,
$endgroup$
– lulu
4 hours ago
$begingroup$
I thought since we have a subset of 2, we multiply by 4! since there are 4 elements left in A.
$endgroup$
– Zaku
4 hours ago
1
$begingroup$
It's not a question of what's left in $A$. Having paired, say, $1,2$ we now need to count the surjections of $P,3,4,5,6$ onto $a,b,c,d,e$, where $P$ denotes the pair $(1,2)$. There are clearly $5!$ such surjections.
$endgroup$
– lulu
4 hours ago
$begingroup$
" I thought ..., we multiply by 4! since there are 4 elements left in A." But you haven't chosen which of the 5 elements that subset of 2 map to. Would it make more sense if we said the (number of ways to chose the two that aren't distinct)(choices for that pair)(choices for what is left) $=6choose 2*5*4! $? That's actually the same thing as (number of ways to chose the two that aren't distinct)(number of choices for the four distinct and the pair)$=6choose 2*5! $.
$endgroup$
– fleablood
3 hours ago
add a comment |
$begingroup$
There are $5$ objects, not $4$. One object is the double, but that doesn't change anything,
$endgroup$
– lulu
4 hours ago
$begingroup$
I thought since we have a subset of 2, we multiply by 4! since there are 4 elements left in A.
$endgroup$
– Zaku
4 hours ago
1
$begingroup$
It's not a question of what's left in $A$. Having paired, say, $1,2$ we now need to count the surjections of $P,3,4,5,6$ onto $a,b,c,d,e$, where $P$ denotes the pair $(1,2)$. There are clearly $5!$ such surjections.
$endgroup$
– lulu
4 hours ago
$begingroup$
" I thought ..., we multiply by 4! since there are 4 elements left in A." But you haven't chosen which of the 5 elements that subset of 2 map to. Would it make more sense if we said the (number of ways to chose the two that aren't distinct)(choices for that pair)(choices for what is left) $=6choose 2*5*4! $? That's actually the same thing as (number of ways to chose the two that aren't distinct)(number of choices for the four distinct and the pair)$=6choose 2*5! $.
$endgroup$
– fleablood
3 hours ago
$begingroup$
There are $5$ objects, not $4$. One object is the double, but that doesn't change anything,
$endgroup$
– lulu
4 hours ago
$begingroup$
There are $5$ objects, not $4$. One object is the double, but that doesn't change anything,
$endgroup$
– lulu
4 hours ago
$begingroup$
I thought since we have a subset of 2, we multiply by 4! since there are 4 elements left in A.
$endgroup$
– Zaku
4 hours ago
$begingroup$
I thought since we have a subset of 2, we multiply by 4! since there are 4 elements left in A.
$endgroup$
– Zaku
4 hours ago
1
1
$begingroup$
It's not a question of what's left in $A$. Having paired, say, $1,2$ we now need to count the surjections of $P,3,4,5,6$ onto $a,b,c,d,e$, where $P$ denotes the pair $(1,2)$. There are clearly $5!$ such surjections.
$endgroup$
– lulu
4 hours ago
$begingroup$
It's not a question of what's left in $A$. Having paired, say, $1,2$ we now need to count the surjections of $P,3,4,5,6$ onto $a,b,c,d,e$, where $P$ denotes the pair $(1,2)$. There are clearly $5!$ such surjections.
$endgroup$
– lulu
4 hours ago
$begingroup$
" I thought ..., we multiply by 4! since there are 4 elements left in A." But you haven't chosen which of the 5 elements that subset of 2 map to. Would it make more sense if we said the (number of ways to chose the two that aren't distinct)(choices for that pair)(choices for what is left) $=6choose 2*5*4! $? That's actually the same thing as (number of ways to chose the two that aren't distinct)(number of choices for the four distinct and the pair)$=6choose 2*5! $.
$endgroup$
– fleablood
3 hours ago
$begingroup$
" I thought ..., we multiply by 4! since there are 4 elements left in A." But you haven't chosen which of the 5 elements that subset of 2 map to. Would it make more sense if we said the (number of ways to chose the two that aren't distinct)(choices for that pair)(choices for what is left) $=6choose 2*5*4! $? That's actually the same thing as (number of ways to chose the two that aren't distinct)(number of choices for the four distinct and the pair)$=6choose 2*5! $.
$endgroup$
– fleablood
3 hours ago
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
How many ways can $A$ be partitioned into $5$ blocks?
Answer: $binom62 = 15$
Given any $5text-block$ partition of $A$, in how many ways can the blocks be bijectively
assigned to the $5$ element set $B$?
Answer: $5! =120$
How many surjective functions from $A$ onto $B$ are there?
Answer: $15 times 120 = 1800$
answered 3 hours ago
CopyPasteItCopyPasteIt
4,3271828
$endgroup$
add a comment |
$begingroup$
Think of it this way:
There is a pair of terms that get mapped to the same element. Call that pair $alpha $. There are four terms remaining. Call them $beta,gamma,delta$ and $epsilon $.
There are $6choose 2 $ possible pairs that can be $alpha $.
And we must map $alpha,beta,gamma,delta,epsilon $ to $a,b,c,d,e $. There is $5! $ ways to do that.
answered 3 hours ago
fleabloodfleablood
73.9k22891
$endgroup$
add a comment |
$begingroup$
(i). Select a $2$-member $A_1subset A.$ There are $binom 62$ ways to do this. Select a $1$-member $B_1subset B.$ There are $binom 51$ ways to do this. There are $binom 62binom 51$ such pairs $(A_1,B_1)$ and for each pair there is a set $F(A_1,B_1)$ of $4!$ surjections $f:Ato B$ such that $f(x):xin A_1=B_1.$
And if $(A_1, B_1)ne (A'_1, B'_1)$ then the sets $F(A_1,B_1), F(A'_1,B'_1)$ are disjoint.
So there are at least $binom 62binom 514!=(15)(5)(4!)=(15)(5!)=1800$ surjections.
(ii). Every surjection $f:Ato B$ belongs to some $F(A_1,B_1)$ so there are at most $1800$ surjections.
In other words: (i) we didn't count any $f$ more than once, and (ii) we didn't fail to count any $f$.
Remark. The "mysterious" $5!$ came from two sources: The product of the number $binom 51$ of $B_1$'s and the number $4$! of bijections from a $4$-member set to another.
answered 31 mins ago
DanielWainfleetDanielWainfleet
35.8k31648
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3180474%2ffind-the-number-of-surjections-from-a-to-b%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
How many ways can $A$ be partitioned into $5$ blocks?
Answer: $binom62 = 15$
Given any $5text-block$ partition of $A$, in how many ways can the blocks be bijectively
assigned to the $5$ element set $B$?
Answer: $5! =120$
How many surjective functions from $A$ onto $B$ are there?
Answer: $15 times 120 = 1800$
answered 3 hours ago
CopyPasteItCopyPasteIt
4,3271828
$endgroup$
add a comment |
$begingroup$
How many ways can $A$ be partitioned into $5$ blocks?
Answer: $binom62 = 15$
Given any $5text-block$ partition of $A$, in how many ways can the blocks be bijectively
assigned to the $5$ element set $B$?
Answer: $5! =120$
How many surjective functions from $A$ onto $B$ are there?
Answer: $15 times 120 = 1800$
answered 3 hours ago
CopyPasteItCopyPasteIt
4,3271828
$endgroup$
add a comment |
$begingroup$
How many ways can $A$ be partitioned into $5$ blocks?
Answer: $binom62 = 15$
Given any $5text-block$ partition of $A$, in how many ways can the blocks be bijectively
assigned to the $5$ element set $B$?
Answer: $5! =120$
How many surjective functions from $A$ onto $B$ are there?
Answer: $15 times 120 = 1800$
answered 3 hours ago
CopyPasteItCopyPasteIt
4,3271828
$endgroup$
How many ways can $A$ be partitioned into $5$ blocks?
Answer: $binom62 = 15$
Given any $5text-block$ partition of $A$, in how many ways can the blocks be bijectively
assigned to the $5$ element set $B$?
Answer: $5! =120$
How many surjective functions from $A$ onto $B$ are there?
Answer: $15 times 120 = 1800$
answered 3 hours ago
CopyPasteItCopyPasteIt
4,3271828
answered 3 hours ago
CopyPasteItCopyPasteIt
4,3271828
answered 3 hours ago
CopyPasteItCopyPasteIt
4,3271828
answered 3 hours ago
CopyPasteItCopyPasteIt
4,3271828
4,3271828
add a comment |
add a comment |
$begingroup$
Think of it this way:
There is a pair of terms that get mapped to the same element. Call that pair $alpha $. There are four terms remaining. Call them $beta,gamma,delta$ and $epsilon $.
There are $6choose 2 $ possible pairs that can be $alpha $.
And we must map $alpha,beta,gamma,delta,epsilon $ to $a,b,c,d,e $. There is $5! $ ways to do that.
answered 3 hours ago
fleabloodfleablood
73.9k22891
$endgroup$
add a comment |
$begingroup$
Think of it this way:
There is a pair of terms that get mapped to the same element. Call that pair $alpha $. There are four terms remaining. Call them $beta,gamma,delta$ and $epsilon $.
There are $6choose 2 $ possible pairs that can be $alpha $.
And we must map $alpha,beta,gamma,delta,epsilon $ to $a,b,c,d,e $. There is $5! $ ways to do that.
answered 3 hours ago
fleabloodfleablood
73.9k22891
$endgroup$
add a comment |
$begingroup$
Think of it this way:
There is a pair of terms that get mapped to the same element. Call that pair $alpha $. There are four terms remaining. Call them $beta,gamma,delta$ and $epsilon $.
There are $6choose 2 $ possible pairs that can be $alpha $.
And we must map $alpha,beta,gamma,delta,epsilon $ to $a,b,c,d,e $. There is $5! $ ways to do that.
answered 3 hours ago
fleabloodfleablood
73.9k22891
$endgroup$
Think of it this way:
There is a pair of terms that get mapped to the same element. Call that pair $alpha $. There are four terms remaining. Call them $beta,gamma,delta$ and $epsilon $.
There are $6choose 2 $ possible pairs that can be $alpha $.
And we must map $alpha,beta,gamma,delta,epsilon $ to $a,b,c,d,e $. There is $5! $ ways to do that.
answered 3 hours ago
fleabloodfleablood
73.9k22891
answered 3 hours ago
fleabloodfleablood
73.9k22891
answered 3 hours ago
fleabloodfleablood
73.9k22891
answered 3 hours ago
fleabloodfleablood
73.9k22891
73.9k22891
add a comment |
add a comment |
$begingroup$
(i). Select a $2$-member $A_1subset A.$ There are $binom 62$ ways to do this. Select a $1$-member $B_1subset B.$ There are $binom 51$ ways to do this. There are $binom 62binom 51$ such pairs $(A_1,B_1)$ and for each pair there is a set $F(A_1,B_1)$ of $4!$ surjections $f:Ato B$ such that $f(x):xin A_1=B_1.$
And if $(A_1, B_1)ne (A'_1, B'_1)$ then the sets $F(A_1,B_1), F(A'_1,B'_1)$ are disjoint.
So there are at least $binom 62binom 514!=(15)(5)(4!)=(15)(5!)=1800$ surjections.
(ii). Every surjection $f:Ato B$ belongs to some $F(A_1,B_1)$ so there are at most $1800$ surjections.
In other words: (i) we didn't count any $f$ more than once, and (ii) we didn't fail to count any $f$.
Remark. The "mysterious" $5!$ came from two sources: The product of the number $binom 51$ of $B_1$'s and the number $4$! of bijections from a $4$-member set to another.
answered 31 mins ago
DanielWainfleetDanielWainfleet
35.8k31648
$endgroup$
add a comment |
$begingroup$
(i). Select a $2$-member $A_1subset A.$ There are $binom 62$ ways to do this. Select a $1$-member $B_1subset B.$ There are $binom 51$ ways to do this. There are $binom 62binom 51$ such pairs $(A_1,B_1)$ and for each pair there is a set $F(A_1,B_1)$ of $4!$ surjections $f:Ato B$ such that $f(x):xin A_1=B_1.$
And if $(A_1, B_1)ne (A'_1, B'_1)$ then the sets $F(A_1,B_1), F(A'_1,B'_1)$ are disjoint.
So there are at least $binom 62binom 514!=(15)(5)(4!)=(15)(5!)=1800$ surjections.
(ii). Every surjection $f:Ato B$ belongs to some $F(A_1,B_1)$ so there are at most $1800$ surjections.
In other words: (i) we didn't count any $f$ more than once, and (ii) we didn't fail to count any $f$.
Remark. The "mysterious" $5!$ came from two sources: The product of the number $binom 51$ of $B_1$'s and the number $4$! of bijections from a $4$-member set to another.
answered 31 mins ago
DanielWainfleetDanielWainfleet
35.8k31648
$endgroup$
add a comment |
$begingroup$
(i). Select a $2$-member $A_1subset A.$ There are $binom 62$ ways to do this. Select a $1$-member $B_1subset B.$ There are $binom 51$ ways to do this. There are $binom 62binom 51$ such pairs $(A_1,B_1)$ and for each pair there is a set $F(A_1,B_1)$ of $4!$ surjections $f:Ato B$ such that $f(x):xin A_1=B_1.$
And if $(A_1, B_1)ne (A'_1, B'_1)$ then the sets $F(A_1,B_1), F(A'_1,B'_1)$ are disjoint.
So there are at least $binom 62binom 514!=(15)(5)(4!)=(15)(5!)=1800$ surjections.
(ii). Every surjection $f:Ato B$ belongs to some $F(A_1,B_1)$ so there are at most $1800$ surjections.
In other words: (i) we didn't count any $f$ more than once, and (ii) we didn't fail to count any $f$.
Remark. The "mysterious" $5!$ came from two sources: The product of the number $binom 51$ of $B_1$'s and the number $4$! of bijections from a $4$-member set to another.
answered 31 mins ago
DanielWainfleetDanielWainfleet
35.8k31648
$endgroup$
(i). Select a $2$-member $A_1subset A.$ There are $binom 62$ ways to do this. Select a $1$-member $B_1subset B.$ There are $binom 51$ ways to do this. There are $binom 62binom 51$ such pairs $(A_1,B_1)$ and for each pair there is a set $F(A_1,B_1)$ of $4!$ surjections $f:Ato B$ such that $f(x):xin A_1=B_1.$
And if $(A_1, B_1)ne (A'_1, B'_1)$ then the sets $F(A_1,B_1), F(A'_1,B'_1)$ are disjoint.
So there are at least $binom 62binom 514!=(15)(5)(4!)=(15)(5!)=1800$ surjections.
(ii). Every surjection $f:Ato B$ belongs to some $F(A_1,B_1)$ so there are at most $1800$ surjections.
In other words: (i) we didn't count any $f$ more than once, and (ii) we didn't fail to count any $f$.
Remark. The "mysterious" $5!$ came from two sources: The product of the number $binom 51$ of $B_1$'s and the number $4$! of bijections from a $4$-member set to another.
answered 31 mins ago
DanielWainfleetDanielWainfleet
35.8k31648
edited 6 mins ago
answered 31 mins ago
DanielWainfleetDanielWainfleet
35.8k31648
answered 31 mins ago
DanielWainfleetDanielWainfleet
35.8k31648
answered 31 mins ago
DanielWainfleetDanielWainfleet
35.8k31648
35.8k31648
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3180474%2ffind-the-number-of-surjections-from-a-to-b%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
There are $5$ objects, not $4$. One object is the double, but that doesn't change anything,
$endgroup$
– lulu
4 hours ago
$begingroup$
I thought since we have a subset of 2, we multiply by 4! since there are 4 elements left in A.
$endgroup$
– Zaku
4 hours ago
1
$begingroup$
It's not a question of what's left in $A$. Having paired, say, $1,2$ we now need to count the surjections of $P,3,4,5,6$ onto $a,b,c,d,e$, where $P$ denotes the pair $(1,2)$. There are clearly $5!$ such surjections.
$endgroup$
– lulu
4 hours ago
$begingroup$
" I thought ..., we multiply by 4! since there are 4 elements left in A." But you haven't chosen which of the 5 elements that subset of 2 map to. Would it make more sense if we said the (number of ways to chose the two that aren't distinct)(choices for that pair)(choices for what is left) $=6choose 2*5*4! $? That's actually the same thing as (number of ways to chose the two that aren't distinct)(number of choices for the four distinct and the pair)$=6choose 2*5! $.
$endgroup$
– fleablood
3 hours ago