Letters in Mailboxes so that none are in the right one












1












$begingroup$


In how many ways can 5 letters be put in 5 mailboxes such that none are placed in the right one ? I creatively thought labeling the letters & mailboxes 1-5 , it would be saying letter 1 can be placed in any of the other four . So a total of 4^5 ways .this was not one of the answers . Then i thought hmm lets write as an example 13254 as a sequence above 12345 ..this sequence is a ' throw-out ' case because the 1 cant go with the 1. This would generate _ _ a two digit number ..one for the letter and one for the mailbox .as an example 12 is legit . ( letter 1 in mailbox 2 ) while the pairs 11,22, ect are not .
This would give 5 possabilities for the first number and 5 for the second , or 5x5 =25. But then we must subtract out the posabilities of the 11, 22, 33, ect
This gives 25- 5 =20 but that is STILL not one of the answers






combinatorics discrete-mathematics







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Permutations in which no object is left in its proper place are called derangements.
    $endgroup$
    – N. F. Taussig
    Dec 25 '18 at 22:02










  • $begingroup$
    This is called $D_5,$ the number of derangements of $5$ things.
    $endgroup$
    – coffeemath
    Dec 25 '18 at 22:03
















1












$begingroup$


In how many ways can 5 letters be put in 5 mailboxes such that none are placed in the right one ? I creatively thought labeling the letters & mailboxes 1-5 , it would be saying letter 1 can be placed in any of the other four . So a total of 4^5 ways .this was not one of the answers . Then i thought hmm lets write as an example 13254 as a sequence above 12345 ..this sequence is a ' throw-out ' case because the 1 cant go with the 1. This would generate _ _ a two digit number ..one for the letter and one for the mailbox .as an example 12 is legit . ( letter 1 in mailbox 2 ) while the pairs 11,22, ect are not .
This would give 5 possabilities for the first number and 5 for the second , or 5x5 =25. But then we must subtract out the posabilities of the 11, 22, 33, ect
This gives 25- 5 =20 but that is STILL not one of the answers






combinatorics discrete-mathematics







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Permutations in which no object is left in its proper place are called derangements.
    $endgroup$
    – N. F. Taussig
    Dec 25 '18 at 22:02










  • $begingroup$
    This is called $D_5,$ the number of derangements of $5$ things.
    $endgroup$
    – coffeemath
    Dec 25 '18 at 22:03














1












1








1





$begingroup$


In how many ways can 5 letters be put in 5 mailboxes such that none are placed in the right one ? I creatively thought labeling the letters & mailboxes 1-5 , it would be saying letter 1 can be placed in any of the other four . So a total of 4^5 ways .this was not one of the answers . Then i thought hmm lets write as an example 13254 as a sequence above 12345 ..this sequence is a ' throw-out ' case because the 1 cant go with the 1. This would generate _ _ a two digit number ..one for the letter and one for the mailbox .as an example 12 is legit . ( letter 1 in mailbox 2 ) while the pairs 11,22, ect are not .
This would give 5 possabilities for the first number and 5 for the second , or 5x5 =25. But then we must subtract out the posabilities of the 11, 22, 33, ect
This gives 25- 5 =20 but that is STILL not one of the answers






combinatorics discrete-mathematics







share|cite|improve this question











$endgroup$




In how many ways can 5 letters be put in 5 mailboxes such that none are placed in the right one ? I creatively thought labeling the letters & mailboxes 1-5 , it would be saying letter 1 can be placed in any of the other four . So a total of 4^5 ways .this was not one of the answers . Then i thought hmm lets write as an example 13254 as a sequence above 12345 ..this sequence is a ' throw-out ' case because the 1 cant go with the 1. This would generate _ _ a two digit number ..one for the letter and one for the mailbox .as an example 12 is legit . ( letter 1 in mailbox 2 ) while the pairs 11,22, ect are not .
This would give 5 possabilities for the first number and 5 for the second , or 5x5 =25. But then we must subtract out the posabilities of the 11, 22, 33, ect
This gives 25- 5 =20 but that is STILL not one of the answers






combinatorics discrete-mathematics




combinatorics discrete-mathematics






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Feb 11 at 11:43









Maria Mazur

50k1361125




50k1361125










asked Dec 25 '18 at 21:59









RandinRandin

347116




347116








  • 1




    $begingroup$
    Permutations in which no object is left in its proper place are called derangements.
    $endgroup$
    – N. F. Taussig
    Dec 25 '18 at 22:02










  • $begingroup$
    This is called $D_5,$ the number of derangements of $5$ things.
    $endgroup$
    – coffeemath
    Dec 25 '18 at 22:03














  • 1




    $begingroup$
    Permutations in which no object is left in its proper place are called derangements.
    $endgroup$
    – N. F. Taussig
    Dec 25 '18 at 22:02










  • $begingroup$
    This is called $D_5,$ the number of derangements of $5$ things.
    $endgroup$
    – coffeemath
    Dec 25 '18 at 22:03








1




1




$begingroup$
Permutations in which no object is left in its proper place are called derangements.
$endgroup$
– N. F. Taussig
Dec 25 '18 at 22:02




$begingroup$
Permutations in which no object is left in its proper place are called derangements.
$endgroup$
– N. F. Taussig
Dec 25 '18 at 22:02












$begingroup$
This is called $D_5,$ the number of derangements of $5$ things.
$endgroup$
– coffeemath
Dec 25 '18 at 22:03




$begingroup$
This is called $D_5,$ the number of derangements of $5$ things.
$endgroup$
– coffeemath
Dec 25 '18 at 22:03










2 Answers
2






active

oldest

votes


















1












$begingroup$

These are known as derangements.



Look here:
https://en.wikipedia.org/wiki/Derangement






share|cite|improve this answer









$endgroup$













  • $begingroup$
    You all are derranged .😆😂🤣
    $endgroup$
    – Randin
    Dec 26 '18 at 6:16










  • $begingroup$
    I dont see why my way that seemed so intuitively true was errored ? 😣 btw merry x^3 mas fellow math nerds 🤓🎄🎄🎄👽📯🎶🎁🎎
    $endgroup$
    – Randin
    Dec 26 '18 at 6:17



















2












$begingroup$

So you count bijective functions from $left{1,2,3,4,5right}$ to $left{1,2,3,4,5right}$ such that $f(i) ne i$



I would do like this: Let $A_i$ be a set of functions with $f(i)=i$. Then



$|A_i|= 4!$ and



$|A_icap A_j|=3!$ and



$|A_icap A_jcap A_k|=2!$ and



$|A_icap A_jcap A_kcap A_n|=1$



You are interested in $|A_1'cup A_2'...cup A_5'|$. Let's use PIE



$$|A_1'cup A_2'...cup A_5'| = 5!-5cdot 4!+{5choose 2}3!-{5choose 3}2!+ {5choose 4}1!- {5choose 5}cdot 1=...$$






share|cite|improve this answer









$endgroup$









  • 1




    $begingroup$
    NB using the definition of factorial, we can rewrite the sum as $5! (frac{1}{0!} - frac{1}{1!} + frac{1}{2!} - frac{1}{3!} + frac{1}{4!} - frac{1}{5!})$. Then using the power series for $exp$ and a straightforward estimate shows that we can write this as $left[frac{5!}{e}right]$ (here $[a]$ denotes the integer closest to $a$) and that this formula generalizes to when we replace $5$ with any positive integer.
    $endgroup$
    – Travis
    Dec 25 '18 at 22:38














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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3052457%2fletters-in-mailboxes-so-that-none-are-in-the-right-one%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes









1












$begingroup$

These are known as derangements.



Look here:
https://en.wikipedia.org/wiki/Derangement






share|cite|improve this answer









$endgroup$













  • $begingroup$
    You all are derranged .😆😂🤣
    $endgroup$
    – Randin
    Dec 26 '18 at 6:16










  • $begingroup$
    I dont see why my way that seemed so intuitively true was errored ? 😣 btw merry x^3 mas fellow math nerds 🤓🎄🎄🎄👽📯🎶🎁🎎
    $endgroup$
    – Randin
    Dec 26 '18 at 6:17
















1












$begingroup$

These are known as derangements.



Look here:
https://en.wikipedia.org/wiki/Derangement






share|cite|improve this answer









$endgroup$













  • $begingroup$
    You all are derranged .😆😂🤣
    $endgroup$
    – Randin
    Dec 26 '18 at 6:16










  • $begingroup$
    I dont see why my way that seemed so intuitively true was errored ? 😣 btw merry x^3 mas fellow math nerds 🤓🎄🎄🎄👽📯🎶🎁🎎
    $endgroup$
    – Randin
    Dec 26 '18 at 6:17














1












1








1





$begingroup$

These are known as derangements.



Look here:
https://en.wikipedia.org/wiki/Derangement






share|cite|improve this answer









$endgroup$



These are known as derangements.



Look here:
https://en.wikipedia.org/wiki/Derangement







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Dec 25 '18 at 22:02









marty cohenmarty cohen

75.1k549130




75.1k549130












  • $begingroup$
    You all are derranged .😆😂🤣
    $endgroup$
    – Randin
    Dec 26 '18 at 6:16










  • $begingroup$
    I dont see why my way that seemed so intuitively true was errored ? 😣 btw merry x^3 mas fellow math nerds 🤓🎄🎄🎄👽📯🎶🎁🎎
    $endgroup$
    – Randin
    Dec 26 '18 at 6:17


















  • $begingroup$
    You all are derranged .😆😂🤣
    $endgroup$
    – Randin
    Dec 26 '18 at 6:16










  • $begingroup$
    I dont see why my way that seemed so intuitively true was errored ? 😣 btw merry x^3 mas fellow math nerds 🤓🎄🎄🎄👽📯🎶🎁🎎
    $endgroup$
    – Randin
    Dec 26 '18 at 6:17
















$begingroup$
You all are derranged .😆😂🤣
$endgroup$
– Randin
Dec 26 '18 at 6:16




$begingroup$
You all are derranged .😆😂🤣
$endgroup$
– Randin
Dec 26 '18 at 6:16












$begingroup$
I dont see why my way that seemed so intuitively true was errored ? 😣 btw merry x^3 mas fellow math nerds 🤓🎄🎄🎄👽📯🎶🎁🎎
$endgroup$
– Randin
Dec 26 '18 at 6:17




$begingroup$
I dont see why my way that seemed so intuitively true was errored ? 😣 btw merry x^3 mas fellow math nerds 🤓🎄🎄🎄👽📯🎶🎁🎎
$endgroup$
– Randin
Dec 26 '18 at 6:17











2












$begingroup$

So you count bijective functions from $left{1,2,3,4,5right}$ to $left{1,2,3,4,5right}$ such that $f(i) ne i$



I would do like this: Let $A_i$ be a set of functions with $f(i)=i$. Then



$|A_i|= 4!$ and



$|A_icap A_j|=3!$ and



$|A_icap A_jcap A_k|=2!$ and



$|A_icap A_jcap A_kcap A_n|=1$



You are interested in $|A_1'cup A_2'...cup A_5'|$. Let's use PIE



$$|A_1'cup A_2'...cup A_5'| = 5!-5cdot 4!+{5choose 2}3!-{5choose 3}2!+ {5choose 4}1!- {5choose 5}cdot 1=...$$






share|cite|improve this answer









$endgroup$









  • 1




    $begingroup$
    NB using the definition of factorial, we can rewrite the sum as $5! (frac{1}{0!} - frac{1}{1!} + frac{1}{2!} - frac{1}{3!} + frac{1}{4!} - frac{1}{5!})$. Then using the power series for $exp$ and a straightforward estimate shows that we can write this as $left[frac{5!}{e}right]$ (here $[a]$ denotes the integer closest to $a$) and that this formula generalizes to when we replace $5$ with any positive integer.
    $endgroup$
    – Travis
    Dec 25 '18 at 22:38


















2












$begingroup$

So you count bijective functions from $left{1,2,3,4,5right}$ to $left{1,2,3,4,5right}$ such that $f(i) ne i$



I would do like this: Let $A_i$ be a set of functions with $f(i)=i$. Then



$|A_i|= 4!$ and



$|A_icap A_j|=3!$ and



$|A_icap A_jcap A_k|=2!$ and



$|A_icap A_jcap A_kcap A_n|=1$



You are interested in $|A_1'cup A_2'...cup A_5'|$. Let's use PIE



$$|A_1'cup A_2'...cup A_5'| = 5!-5cdot 4!+{5choose 2}3!-{5choose 3}2!+ {5choose 4}1!- {5choose 5}cdot 1=...$$






share|cite|improve this answer









$endgroup$









  • 1




    $begingroup$
    NB using the definition of factorial, we can rewrite the sum as $5! (frac{1}{0!} - frac{1}{1!} + frac{1}{2!} - frac{1}{3!} + frac{1}{4!} - frac{1}{5!})$. Then using the power series for $exp$ and a straightforward estimate shows that we can write this as $left[frac{5!}{e}right]$ (here $[a]$ denotes the integer closest to $a$) and that this formula generalizes to when we replace $5$ with any positive integer.
    $endgroup$
    – Travis
    Dec 25 '18 at 22:38
















2












2








2





$begingroup$

So you count bijective functions from $left{1,2,3,4,5right}$ to $left{1,2,3,4,5right}$ such that $f(i) ne i$



I would do like this: Let $A_i$ be a set of functions with $f(i)=i$. Then



$|A_i|= 4!$ and



$|A_icap A_j|=3!$ and



$|A_icap A_jcap A_k|=2!$ and



$|A_icap A_jcap A_kcap A_n|=1$



You are interested in $|A_1'cup A_2'...cup A_5'|$. Let's use PIE



$$|A_1'cup A_2'...cup A_5'| = 5!-5cdot 4!+{5choose 2}3!-{5choose 3}2!+ {5choose 4}1!- {5choose 5}cdot 1=...$$






share|cite|improve this answer









$endgroup$



So you count bijective functions from $left{1,2,3,4,5right}$ to $left{1,2,3,4,5right}$ such that $f(i) ne i$



I would do like this: Let $A_i$ be a set of functions with $f(i)=i$. Then



$|A_i|= 4!$ and



$|A_icap A_j|=3!$ and



$|A_icap A_jcap A_k|=2!$ and



$|A_icap A_jcap A_kcap A_n|=1$



You are interested in $|A_1'cup A_2'...cup A_5'|$. Let's use PIE



$$|A_1'cup A_2'...cup A_5'| = 5!-5cdot 4!+{5choose 2}3!-{5choose 3}2!+ {5choose 4}1!- {5choose 5}cdot 1=...$$







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Dec 25 '18 at 22:18









Maria MazurMaria Mazur

50k1361125




50k1361125








  • 1




    $begingroup$
    NB using the definition of factorial, we can rewrite the sum as $5! (frac{1}{0!} - frac{1}{1!} + frac{1}{2!} - frac{1}{3!} + frac{1}{4!} - frac{1}{5!})$. Then using the power series for $exp$ and a straightforward estimate shows that we can write this as $left[frac{5!}{e}right]$ (here $[a]$ denotes the integer closest to $a$) and that this formula generalizes to when we replace $5$ with any positive integer.
    $endgroup$
    – Travis
    Dec 25 '18 at 22:38
















  • 1




    $begingroup$
    NB using the definition of factorial, we can rewrite the sum as $5! (frac{1}{0!} - frac{1}{1!} + frac{1}{2!} - frac{1}{3!} + frac{1}{4!} - frac{1}{5!})$. Then using the power series for $exp$ and a straightforward estimate shows that we can write this as $left[frac{5!}{e}right]$ (here $[a]$ denotes the integer closest to $a$) and that this formula generalizes to when we replace $5$ with any positive integer.
    $endgroup$
    – Travis
    Dec 25 '18 at 22:38










1




1




$begingroup$
NB using the definition of factorial, we can rewrite the sum as $5! (frac{1}{0!} - frac{1}{1!} + frac{1}{2!} - frac{1}{3!} + frac{1}{4!} - frac{1}{5!})$. Then using the power series for $exp$ and a straightforward estimate shows that we can write this as $left[frac{5!}{e}right]$ (here $[a]$ denotes the integer closest to $a$) and that this formula generalizes to when we replace $5$ with any positive integer.
$endgroup$
– Travis
Dec 25 '18 at 22:38






$begingroup$
NB using the definition of factorial, we can rewrite the sum as $5! (frac{1}{0!} - frac{1}{1!} + frac{1}{2!} - frac{1}{3!} + frac{1}{4!} - frac{1}{5!})$. Then using the power series for $exp$ and a straightforward estimate shows that we can write this as $left[frac{5!}{e}right]$ (here $[a]$ denotes the integer closest to $a$) and that this formula generalizes to when we replace $5$ with any positive integer.
$endgroup$
– Travis
Dec 25 '18 at 22:38




















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3052457%2fletters-in-mailboxes-so-that-none-are-in-the-right-one%23new-answer', 'question_page');
}
);

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







-

Popular posts from this blog

Bundesstraße 106

Image
Dieser Artikel beschreibt die Bundesstraße 106 in Deutschland. Zur gleichnamigen Straße in Österreich siehe Mölltal Straße. Vorlage:Infobox hochrangige Straße/Wartung/DE-B Bundesstraße 106 in Deutschland Karte Basisdaten Betreiber: Deutschland  Bundesrepublik Deutschland Straßenbeginn: Wismar ( 53° 54′  N , 11° 24′  O 53.900536 11.396875 ) Straßenende: Schwerin ( 53° 36′  N , 11° 24′  O 53.592785 11.404892 ) Gesamtlänge: 40,7 km Bundesland: Mecklenburg-Vorpommern Ausbauzustand: zweistreifig [1] Bundesstraße 106 in Schwerin (Umgehungsstraße) Straßenverlauf Land Mecklenburg-Vorpommern Landkreis Nordwestmecklenburg Ortsumgehung Wismar Wallensteingraben über   Dorf Mecklenburg Wallensteingraben Groß Stieten Bad Kleinen OT Niendorf Bahnstrecke Lübeck–Bad Kleinen Zickhusen Lübstorf Klein Trebbow OT Kirch Stück
Read more

Verónica Boquete

Image
Verónica Boquete im Trikot der Nationalmannschaft (2013) Personalia Name Verónica Boquete Giadans Geburtstag 9. April 1987 Geburtsort Santiago de Compostela, Spanien Größe 159 cm Position Mittelfeld / Sturm Juniorinnen Jahre Station 2001–2005 Xuventú Aguiño Frauen Jahre Station Spiele (Tore) 1 2005–2008 Prainsa Zaragoza 83 (40) 2008–2010 Espanyol Barcelona 53 (30) 2010 Buffalo Flash 9 0 (9) 2010 Chicago Red Stars 3 0 (1) 2010–2011 Espanyol Barcelona 26 (41) 2011 Philadelphia Independence 13 0 (5) 2011 Energija Woronesch 5 0 (1) 2012–2014 Tyresö FF 39 (14) 2014 Portland Thorns FC 15 0 (4) 2014–2015 1. FFC Frankfurt 23 0 (7) 2015–2016 FC Bayern München 9 0 (0) 2016–2018 Paris Saint-Germain 31 0 (8) 2018 Peking BG Phoenix 2019– Utah Royals FC 0 0 (0) Nationalmannschaft Jahre Auswahl
Read more

Ida-Boy-Ed-Garten

Image
Die Lage des Ida-Boy-Ed-Gartens, rot markiert Der Ida-Boy-Ed-Garten Der Ida-Boy-Ed-Garten, Blick von der Wakenitzmauer durch das Tor in der Stadtmauer Der Ida-Boy-Ed-Garten ist eine Straße der Lübecker Altstadt. Inhaltsverzeichnis 1 Lage 2 Geschichte 3 Literatur 4 Weblinks Lage | Der etwa 90 Meter lange Ida-Boy-Ed-Garten befindet sich an der nördlichen Spitze der Altstadtinsel, vor dem Burgtor. Die in einem Bogen durch eine Grünanlage hangaufwärts führende Straße verbindet die Wakenitzmauer mit der Burgtorbrücke. Geschichte | Der heutige Ida-Boy-Ed-Garten wurde ursprünglich als Verlängerung der Wakenitzmauer angelegt. 1903 wurde in den erhaltenen Teil der mittelalterlichen Stadtmauer, an dem die Wakenitzmauer bei der Einmündung der Kaiserstraße begann, ein Tor mit einem großen Bogen für die Durchführung der Straße und zwei kleineren seitlichen Öffnungen für Fußgänger gebrochen, um für die neu errichteten Wohnhäuser in diesem Bereich
Read more