If Larry, Moe and Curly visit a town with 7 churches











up vote
2
down vote

favorite












I am working through the following question:




If Larry, Moe and Curly visit a town with 7 churches, then (a) in how many ways can all three visit the same church, and (b) in how many ways will they not all choose the same church?




For a) I have the following calculation:



$$binom{7}{1} = 7$$



Is it that simple or am I missing something?



For b) I have this:



$$P_3^7 = 210$$



Am I on the right path, or have I made any errors? Thanks for your help!










share|cite|improve this question


















  • 3




    a) Yep. Right. And for b), just realize that the number of ways they will not all choose the same church is the total number of ways they can go to church minus the number of ways they all go to the same church. Easy!
    – David G. Stork
    Nov 20 at 7:52










  • @DavidG.Stork Thank you! That clears things up!
    – Lee
    Nov 20 at 8:00










  • Larry, Moe, and Curly were all Jewish (archive.jns.org/latest-articles/2012/12/3/…), so they were probably visiting synagogues rather than churches. Anyway, the answers depend on whether or not Larry visiting a given house of worship followed by Moe is considered different from Moe visiting first, followed by Larry, and so on.
    – Gerry Myerson
    Nov 20 at 8:25










  • Your answer on b) actually answers another question: "in how many ways can they all choose a different church to visit?"
    – drhab
    Nov 20 at 9:49















up vote
2
down vote

favorite












I am working through the following question:




If Larry, Moe and Curly visit a town with 7 churches, then (a) in how many ways can all three visit the same church, and (b) in how many ways will they not all choose the same church?




For a) I have the following calculation:



$$binom{7}{1} = 7$$



Is it that simple or am I missing something?



For b) I have this:



$$P_3^7 = 210$$



Am I on the right path, or have I made any errors? Thanks for your help!










share|cite|improve this question


















  • 3




    a) Yep. Right. And for b), just realize that the number of ways they will not all choose the same church is the total number of ways they can go to church minus the number of ways they all go to the same church. Easy!
    – David G. Stork
    Nov 20 at 7:52










  • @DavidG.Stork Thank you! That clears things up!
    – Lee
    Nov 20 at 8:00










  • Larry, Moe, and Curly were all Jewish (archive.jns.org/latest-articles/2012/12/3/…), so they were probably visiting synagogues rather than churches. Anyway, the answers depend on whether or not Larry visiting a given house of worship followed by Moe is considered different from Moe visiting first, followed by Larry, and so on.
    – Gerry Myerson
    Nov 20 at 8:25










  • Your answer on b) actually answers another question: "in how many ways can they all choose a different church to visit?"
    – drhab
    Nov 20 at 9:49













up vote
2
down vote

favorite









up vote
2
down vote

favorite











I am working through the following question:




If Larry, Moe and Curly visit a town with 7 churches, then (a) in how many ways can all three visit the same church, and (b) in how many ways will they not all choose the same church?




For a) I have the following calculation:



$$binom{7}{1} = 7$$



Is it that simple or am I missing something?



For b) I have this:



$$P_3^7 = 210$$



Am I on the right path, or have I made any errors? Thanks for your help!










share|cite|improve this question













I am working through the following question:




If Larry, Moe and Curly visit a town with 7 churches, then (a) in how many ways can all three visit the same church, and (b) in how many ways will they not all choose the same church?




For a) I have the following calculation:



$$binom{7}{1} = 7$$



Is it that simple or am I missing something?



For b) I have this:



$$P_3^7 = 210$$



Am I on the right path, or have I made any errors? Thanks for your help!







permutations combinations






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 20 at 7:49









Lee

1015




1015








  • 3




    a) Yep. Right. And for b), just realize that the number of ways they will not all choose the same church is the total number of ways they can go to church minus the number of ways they all go to the same church. Easy!
    – David G. Stork
    Nov 20 at 7:52










  • @DavidG.Stork Thank you! That clears things up!
    – Lee
    Nov 20 at 8:00










  • Larry, Moe, and Curly were all Jewish (archive.jns.org/latest-articles/2012/12/3/…), so they were probably visiting synagogues rather than churches. Anyway, the answers depend on whether or not Larry visiting a given house of worship followed by Moe is considered different from Moe visiting first, followed by Larry, and so on.
    – Gerry Myerson
    Nov 20 at 8:25










  • Your answer on b) actually answers another question: "in how many ways can they all choose a different church to visit?"
    – drhab
    Nov 20 at 9:49














  • 3




    a) Yep. Right. And for b), just realize that the number of ways they will not all choose the same church is the total number of ways they can go to church minus the number of ways they all go to the same church. Easy!
    – David G. Stork
    Nov 20 at 7:52










  • @DavidG.Stork Thank you! That clears things up!
    – Lee
    Nov 20 at 8:00










  • Larry, Moe, and Curly were all Jewish (archive.jns.org/latest-articles/2012/12/3/…), so they were probably visiting synagogues rather than churches. Anyway, the answers depend on whether or not Larry visiting a given house of worship followed by Moe is considered different from Moe visiting first, followed by Larry, and so on.
    – Gerry Myerson
    Nov 20 at 8:25










  • Your answer on b) actually answers another question: "in how many ways can they all choose a different church to visit?"
    – drhab
    Nov 20 at 9:49








3




3




a) Yep. Right. And for b), just realize that the number of ways they will not all choose the same church is the total number of ways they can go to church minus the number of ways they all go to the same church. Easy!
– David G. Stork
Nov 20 at 7:52




a) Yep. Right. And for b), just realize that the number of ways they will not all choose the same church is the total number of ways they can go to church minus the number of ways they all go to the same church. Easy!
– David G. Stork
Nov 20 at 7:52












@DavidG.Stork Thank you! That clears things up!
– Lee
Nov 20 at 8:00




@DavidG.Stork Thank you! That clears things up!
– Lee
Nov 20 at 8:00












Larry, Moe, and Curly were all Jewish (archive.jns.org/latest-articles/2012/12/3/…), so they were probably visiting synagogues rather than churches. Anyway, the answers depend on whether or not Larry visiting a given house of worship followed by Moe is considered different from Moe visiting first, followed by Larry, and so on.
– Gerry Myerson
Nov 20 at 8:25




Larry, Moe, and Curly were all Jewish (archive.jns.org/latest-articles/2012/12/3/…), so they were probably visiting synagogues rather than churches. Anyway, the answers depend on whether or not Larry visiting a given house of worship followed by Moe is considered different from Moe visiting first, followed by Larry, and so on.
– Gerry Myerson
Nov 20 at 8:25












Your answer on b) actually answers another question: "in how many ways can they all choose a different church to visit?"
– drhab
Nov 20 at 9:49




Your answer on b) actually answers another question: "in how many ways can they all choose a different church to visit?"
– drhab
Nov 20 at 9:49















active

oldest

votes











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',
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%2f3006059%2fif-larry-moe-and-curly-visit-a-town-with-7-churches%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















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.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • 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.


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%2f3006059%2fif-larry-moe-and-curly-visit-a-town-with-7-churches%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

Probability when a professor distributes a quiz and homework assignment to a class of n students.

Aardman Animations

Are they similar matrix