Pigeonhole Principle Proof Generalized
$begingroup$
An airport sees 1500 takeoffs per day. Prove that there are two planes that leave within a minute of each other.
All I can get started with is finding the total minutes in a day- 1440min. I understand that I have to fit 1500 planes into 1440 boxes however I do not know how to use this to prove that at least 2 planes leave within a minute of each other. Kindly help.
probability combinatorics discrete-mathematics pigeonhole-principle
$endgroup$
add a comment |
$begingroup$
An airport sees 1500 takeoffs per day. Prove that there are two planes that leave within a minute of each other.
All I can get started with is finding the total minutes in a day- 1440min. I understand that I have to fit 1500 planes into 1440 boxes however I do not know how to use this to prove that at least 2 planes leave within a minute of each other. Kindly help.
probability combinatorics discrete-mathematics pigeonhole-principle
$endgroup$
2
$begingroup$
assume a plane can only leave every minute, only 1440 planes can leave. If there are 1500 flights, then at least 60 of them must leave within same minutes.
$endgroup$
– user29418
Dec 9 '18 at 13:06
1
$begingroup$
@user29418 It is not necessary that atleast 60 of them must leave within the same minutes. You can say that 60 pairs are there must leave within same minute
$endgroup$
– user408906
Dec 9 '18 at 13:10
$begingroup$
you're right I messed up the wording
$endgroup$
– user29418
Dec 10 '18 at 1:18
add a comment |
$begingroup$
An airport sees 1500 takeoffs per day. Prove that there are two planes that leave within a minute of each other.
All I can get started with is finding the total minutes in a day- 1440min. I understand that I have to fit 1500 planes into 1440 boxes however I do not know how to use this to prove that at least 2 planes leave within a minute of each other. Kindly help.
probability combinatorics discrete-mathematics pigeonhole-principle
$endgroup$
An airport sees 1500 takeoffs per day. Prove that there are two planes that leave within a minute of each other.
All I can get started with is finding the total minutes in a day- 1440min. I understand that I have to fit 1500 planes into 1440 boxes however I do not know how to use this to prove that at least 2 planes leave within a minute of each other. Kindly help.
probability combinatorics discrete-mathematics pigeonhole-principle
probability combinatorics discrete-mathematics pigeonhole-principle
asked Dec 9 '18 at 13:03
MunchiesOatsMunchiesOats
323
323
2
$begingroup$
assume a plane can only leave every minute, only 1440 planes can leave. If there are 1500 flights, then at least 60 of them must leave within same minutes.
$endgroup$
– user29418
Dec 9 '18 at 13:06
1
$begingroup$
@user29418 It is not necessary that atleast 60 of them must leave within the same minutes. You can say that 60 pairs are there must leave within same minute
$endgroup$
– user408906
Dec 9 '18 at 13:10
$begingroup$
you're right I messed up the wording
$endgroup$
– user29418
Dec 10 '18 at 1:18
add a comment |
2
$begingroup$
assume a plane can only leave every minute, only 1440 planes can leave. If there are 1500 flights, then at least 60 of them must leave within same minutes.
$endgroup$
– user29418
Dec 9 '18 at 13:06
1
$begingroup$
@user29418 It is not necessary that atleast 60 of them must leave within the same minutes. You can say that 60 pairs are there must leave within same minute
$endgroup$
– user408906
Dec 9 '18 at 13:10
$begingroup$
you're right I messed up the wording
$endgroup$
– user29418
Dec 10 '18 at 1:18
2
2
$begingroup$
assume a plane can only leave every minute, only 1440 planes can leave. If there are 1500 flights, then at least 60 of them must leave within same minutes.
$endgroup$
– user29418
Dec 9 '18 at 13:06
$begingroup$
assume a plane can only leave every minute, only 1440 planes can leave. If there are 1500 flights, then at least 60 of them must leave within same minutes.
$endgroup$
– user29418
Dec 9 '18 at 13:06
1
1
$begingroup$
@user29418 It is not necessary that atleast 60 of them must leave within the same minutes. You can say that 60 pairs are there must leave within same minute
$endgroup$
– user408906
Dec 9 '18 at 13:10
$begingroup$
@user29418 It is not necessary that atleast 60 of them must leave within the same minutes. You can say that 60 pairs are there must leave within same minute
$endgroup$
– user408906
Dec 9 '18 at 13:10
$begingroup$
you're right I messed up the wording
$endgroup$
– user29418
Dec 10 '18 at 1:18
$begingroup$
you're right I messed up the wording
$endgroup$
– user29418
Dec 10 '18 at 1:18
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
The Pigeonhole Principle seems to be the perfect approach.
Let the 1440 minutes be the pigeonholes and the 1500 takeoffs be the pigeons. It follows that $$text{At least } lceilfrac{1500}{1440}rceil=2text{ planes take off in the same minute}$$
$endgroup$
add a comment |
$begingroup$
Imagine the day as divided into $1440$ one-minute intervals. Those will be your pigeonholes. The $1500$ planes are your (high-tech) pigeons. Think of a plane (= pigeon) leaving within a particular minute (= pigeonhole) as putting that pigeon in that hole. The pigeonhole principle says there must be two pigeons in a single hole. Given the nature of your pigeons, holes, and "pigeon being in a hole", this means that there must be two planes leaving in the same one-minute interval.
In general, when applying the pigeonhole principle to problems like this, you should look for ways to interpret "pigeon", "hole", and "pigeon being in a hole" in ways relevant to your problem, so that the conclusion of the pigeonhole principle, "at least two pigeons in the same hole" gets interpreted as the conclusion you want.
$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%2f3032364%2fpigeonhole-principle-proof-generalized%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
$begingroup$
The Pigeonhole Principle seems to be the perfect approach.
Let the 1440 minutes be the pigeonholes and the 1500 takeoffs be the pigeons. It follows that $$text{At least } lceilfrac{1500}{1440}rceil=2text{ planes take off in the same minute}$$
$endgroup$
add a comment |
$begingroup$
The Pigeonhole Principle seems to be the perfect approach.
Let the 1440 minutes be the pigeonholes and the 1500 takeoffs be the pigeons. It follows that $$text{At least } lceilfrac{1500}{1440}rceil=2text{ planes take off in the same minute}$$
$endgroup$
add a comment |
$begingroup$
The Pigeonhole Principle seems to be the perfect approach.
Let the 1440 minutes be the pigeonholes and the 1500 takeoffs be the pigeons. It follows that $$text{At least } lceilfrac{1500}{1440}rceil=2text{ planes take off in the same minute}$$
$endgroup$
The Pigeonhole Principle seems to be the perfect approach.
Let the 1440 minutes be the pigeonholes and the 1500 takeoffs be the pigeons. It follows that $$text{At least } lceilfrac{1500}{1440}rceil=2text{ planes take off in the same minute}$$
answered Dec 9 '18 at 13:17
Dr. MathvaDr. Mathva
1,059316
1,059316
add a comment |
add a comment |
$begingroup$
Imagine the day as divided into $1440$ one-minute intervals. Those will be your pigeonholes. The $1500$ planes are your (high-tech) pigeons. Think of a plane (= pigeon) leaving within a particular minute (= pigeonhole) as putting that pigeon in that hole. The pigeonhole principle says there must be two pigeons in a single hole. Given the nature of your pigeons, holes, and "pigeon being in a hole", this means that there must be two planes leaving in the same one-minute interval.
In general, when applying the pigeonhole principle to problems like this, you should look for ways to interpret "pigeon", "hole", and "pigeon being in a hole" in ways relevant to your problem, so that the conclusion of the pigeonhole principle, "at least two pigeons in the same hole" gets interpreted as the conclusion you want.
$endgroup$
add a comment |
$begingroup$
Imagine the day as divided into $1440$ one-minute intervals. Those will be your pigeonholes. The $1500$ planes are your (high-tech) pigeons. Think of a plane (= pigeon) leaving within a particular minute (= pigeonhole) as putting that pigeon in that hole. The pigeonhole principle says there must be two pigeons in a single hole. Given the nature of your pigeons, holes, and "pigeon being in a hole", this means that there must be two planes leaving in the same one-minute interval.
In general, when applying the pigeonhole principle to problems like this, you should look for ways to interpret "pigeon", "hole", and "pigeon being in a hole" in ways relevant to your problem, so that the conclusion of the pigeonhole principle, "at least two pigeons in the same hole" gets interpreted as the conclusion you want.
$endgroup$
add a comment |
$begingroup$
Imagine the day as divided into $1440$ one-minute intervals. Those will be your pigeonholes. The $1500$ planes are your (high-tech) pigeons. Think of a plane (= pigeon) leaving within a particular minute (= pigeonhole) as putting that pigeon in that hole. The pigeonhole principle says there must be two pigeons in a single hole. Given the nature of your pigeons, holes, and "pigeon being in a hole", this means that there must be two planes leaving in the same one-minute interval.
In general, when applying the pigeonhole principle to problems like this, you should look for ways to interpret "pigeon", "hole", and "pigeon being in a hole" in ways relevant to your problem, so that the conclusion of the pigeonhole principle, "at least two pigeons in the same hole" gets interpreted as the conclusion you want.
$endgroup$
Imagine the day as divided into $1440$ one-minute intervals. Those will be your pigeonholes. The $1500$ planes are your (high-tech) pigeons. Think of a plane (= pigeon) leaving within a particular minute (= pigeonhole) as putting that pigeon in that hole. The pigeonhole principle says there must be two pigeons in a single hole. Given the nature of your pigeons, holes, and "pigeon being in a hole", this means that there must be two planes leaving in the same one-minute interval.
In general, when applying the pigeonhole principle to problems like this, you should look for ways to interpret "pigeon", "hole", and "pigeon being in a hole" in ways relevant to your problem, so that the conclusion of the pigeonhole principle, "at least two pigeons in the same hole" gets interpreted as the conclusion you want.
answered Dec 9 '18 at 13:18
Andreas BlassAndreas Blass
49.6k451108
49.6k451108
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%2f3032364%2fpigeonhole-principle-proof-generalized%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
2
$begingroup$
assume a plane can only leave every minute, only 1440 planes can leave. If there are 1500 flights, then at least 60 of them must leave within same minutes.
$endgroup$
– user29418
Dec 9 '18 at 13:06
1
$begingroup$
@user29418 It is not necessary that atleast 60 of them must leave within the same minutes. You can say that 60 pairs are there must leave within same minute
$endgroup$
– user408906
Dec 9 '18 at 13:10
$begingroup$
you're right I messed up the wording
$endgroup$
– user29418
Dec 10 '18 at 1:18