Pigeonhole Principle ProblemPigeonhole principle: 112 hrs over 12 days, then at least 19 hrs over some consecutive 2 daysPigeonhole-principle with two choicesPigeonhole problem - salvaging my solutionProblem on pigeon hole principleTricky pigeonhole principle questionPigeonhole Principle Question: Jessica the Combinatorics StudentJessica the Combinatorics Student, part 2Pigeonhole problem involving team playing 14 consecutive gamesDifferent approach to classic pigeonhole principle problem yields different results. Why?(Generalised) pigeonhole principle
Selecting a secure PIN for building access
When and why did journal article titles become descriptive, rather than creatively allusive?
Write to EXCEL from SQL DB using VBA script
Loading but not using TikZ changes a file
Unexpected email from Yorkshire Bank
Public Salesforce Site and Security Review
How can I close a gap between my fence and my neighbor's that's on his side of the property line?
Can a cyclic Amine form an Amide?
Different output when alias
Binary Numbers Magic Trick
Stark VS Thanos
Visa for volunteering in England
Floor tile layout process?
Visualizing a complicated Region
Copying spell into spellbook time required, consecutive or disparate?
Plagiarism in class. Could it be my fault?
How could a planet have most of its water in the atmosphere?
Any examples of headwear for races with animal ears?
Airbnb - host wants to reduce rooms, can we get refund?
Problems with numbers (result of calculations) alignment using siunitx package inside tabular environment
Was Unix ever a single-user OS?
Field Length Validation for Desktop Application which has maximum 1000 characters
If Melisandre foresaw another character closing blue eyes, why did she follow Stannis?
You look catfish vs You look like a catfish?
Pigeonhole Principle Problem
Pigeonhole principle: 112 hrs over 12 days, then at least 19 hrs over some consecutive 2 daysPigeonhole-principle with two choicesPigeonhole problem - salvaging my solutionProblem on pigeon hole principleTricky pigeonhole principle questionPigeonhole Principle Question: Jessica the Combinatorics StudentJessica the Combinatorics Student, part 2Pigeonhole problem involving team playing 14 consecutive gamesDifferent approach to classic pigeonhole principle problem yields different results. Why?(Generalised) pigeonhole principle
$begingroup$
Problem: In the following 30 days you will get 46 homework sets out of which you will do at least one every day and - of course - all during the 30 days. Show that there must be a period of consecutive days during which you will do exactly 10 homework sets!
Solution: Let $f_n$ denote the number of homeworks from day $1$ to day $n$, where $nle 30$. So, let us consider from $f_1$ up to $f_11$. There are ten possibilities for the remainder when each is divided by $10$. By the pigeonhole principle, there must exist two that have the same remainder, call these $f_i$ and $f_j$, for some $i,jin [1,11]$. Therefore $$f_i - f_j equiv 0 pmod10.$$ But also $f_i - f_j not = 20$. Hence $f_i - f_j = 10$.
I think this is on the right track. However, I have not convinced myself that $f_i - f_j not = 20$
pigeonhole-principle
asked 2 hours ago
WesleyWesley
641613
$endgroup$
add a comment |
$begingroup$
Problem: In the following 30 days you will get 46 homework sets out of which you will do at least one every day and - of course - all during the 30 days. Show that there must be a period of consecutive days during which you will do exactly 10 homework sets!
Solution: Let $f_n$ denote the number of homeworks from day $1$ to day $n$, where $nle 30$. So, let us consider from $f_1$ up to $f_11$. There are ten possibilities for the remainder when each is divided by $10$. By the pigeonhole principle, there must exist two that have the same remainder, call these $f_i$ and $f_j$, for some $i,jin [1,11]$. Therefore $$f_i - f_j equiv 0 pmod10.$$ But also $f_i - f_j not = 20$. Hence $f_i - f_j = 10$.
I think this is on the right track. However, I have not convinced myself that $f_i - f_j not = 20$
pigeonhole-principle
asked 2 hours ago
WesleyWesley
641613
$endgroup$
1
$begingroup$
I don't think you can rule out the possibility that $f_i-f_j=20$. Fortunately, you don't have to. If that's the case, then do the same analysis with the next $11$ days. There aren't enough homework sets for you to hit $20$ twice.
$endgroup$
– Robert Shore
1 hour ago
add a comment |
$begingroup$
Problem: In the following 30 days you will get 46 homework sets out of which you will do at least one every day and - of course - all during the 30 days. Show that there must be a period of consecutive days during which you will do exactly 10 homework sets!
Solution: Let $f_n$ denote the number of homeworks from day $1$ to day $n$, where $nle 30$. So, let us consider from $f_1$ up to $f_11$. There are ten possibilities for the remainder when each is divided by $10$. By the pigeonhole principle, there must exist two that have the same remainder, call these $f_i$ and $f_j$, for some $i,jin [1,11]$. Therefore $$f_i - f_j equiv 0 pmod10.$$ But also $f_i - f_j not = 20$. Hence $f_i - f_j = 10$.
I think this is on the right track. However, I have not convinced myself that $f_i - f_j not = 20$
pigeonhole-principle
asked 2 hours ago
WesleyWesley
641613
$endgroup$
Problem: In the following 30 days you will get 46 homework sets out of which you will do at least one every day and - of course - all during the 30 days. Show that there must be a period of consecutive days during which you will do exactly 10 homework sets!
Solution: Let $f_n$ denote the number of homeworks from day $1$ to day $n$, where $nle 30$. So, let us consider from $f_1$ up to $f_11$. There are ten possibilities for the remainder when each is divided by $10$. By the pigeonhole principle, there must exist two that have the same remainder, call these $f_i$ and $f_j$, for some $i,jin [1,11]$. Therefore $$f_i - f_j equiv 0 pmod10.$$ But also $f_i - f_j not = 20$. Hence $f_i - f_j = 10$.
I think this is on the right track. However, I have not convinced myself that $f_i - f_j not = 20$
pigeonhole-principle
pigeonhole-principle
asked 2 hours ago
WesleyWesley
641613
asked 2 hours ago
WesleyWesley
641613
asked 2 hours ago
WesleyWesley
641613
asked 2 hours ago
WesleyWesley
641613
asked 2 hours ago
WesleyWesley
641613
641613
1
$begingroup$
I don't think you can rule out the possibility that $f_i-f_j=20$. Fortunately, you don't have to. If that's the case, then do the same analysis with the next $11$ days. There aren't enough homework sets for you to hit $20$ twice.
$endgroup$
– Robert Shore
1 hour ago
add a comment |
1
$begingroup$
I don't think you can rule out the possibility that $f_i-f_j=20$. Fortunately, you don't have to. If that's the case, then do the same analysis with the next $11$ days. There aren't enough homework sets for you to hit $20$ twice.
$endgroup$
– Robert Shore
1 hour ago
1
1
$begingroup$
I don't think you can rule out the possibility that $f_i-f_j=20$. Fortunately, you don't have to. If that's the case, then do the same analysis with the next $11$ days. There aren't enough homework sets for you to hit $20$ twice.
$endgroup$
– Robert Shore
1 hour ago
$begingroup$
I don't think you can rule out the possibility that $f_i-f_j=20$. Fortunately, you don't have to. If that's the case, then do the same analysis with the next $11$ days. There aren't enough homework sets for you to hit $20$ twice.
$endgroup$
– Robert Shore
1 hour ago
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
In fact, you would have to consider the case where $f_i-f_j=20$. Which might be messy...
You could alternatively do the following: we know that $$1le f_1<f_2<ldots<f_30=46iff 11le f_1+10<f_2+10<ldots <f_30+10=56$$ Observe know that we are considering $60$ postive integers $f_1,f_2,ldots ,f_30,f_1+10,f_2+10,ldots , f_30+10$ where all of them are less than $57$. By the Pigeonhole principle, at least $2$ numbers must be equal.
Therefore, we must have one integer from the first inequality being equal to another integer from the second inequality. Hence $$f_i=f_j+10$$ for some $i,jinBbb N_<31$. Which is exactly what we wanted to prove.
answered 1 hour ago
Dr. MathvaDr. Mathva
3,8411630
$endgroup$
1
$begingroup$
Nice ...............+1
$endgroup$
– Maria Mazur
1 hour ago
add a comment |
Your Answer
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%2f3207276%2fpigeonhole-principle-problem%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
In fact, you would have to consider the case where $f_i-f_j=20$. Which might be messy...
You could alternatively do the following: we know that $$1le f_1<f_2<ldots<f_30=46iff 11le f_1+10<f_2+10<ldots <f_30+10=56$$ Observe know that we are considering $60$ postive integers $f_1,f_2,ldots ,f_30,f_1+10,f_2+10,ldots , f_30+10$ where all of them are less than $57$. By the Pigeonhole principle, at least $2$ numbers must be equal.
Therefore, we must have one integer from the first inequality being equal to another integer from the second inequality. Hence $$f_i=f_j+10$$ for some $i,jinBbb N_<31$. Which is exactly what we wanted to prove.
answered 1 hour ago
Dr. MathvaDr. Mathva
3,8411630
$endgroup$
1
$begingroup$
Nice ...............+1
$endgroup$
– Maria Mazur
1 hour ago
add a comment |
$begingroup$
In fact, you would have to consider the case where $f_i-f_j=20$. Which might be messy...
You could alternatively do the following: we know that $$1le f_1<f_2<ldots<f_30=46iff 11le f_1+10<f_2+10<ldots <f_30+10=56$$ Observe know that we are considering $60$ postive integers $f_1,f_2,ldots ,f_30,f_1+10,f_2+10,ldots , f_30+10$ where all of them are less than $57$. By the Pigeonhole principle, at least $2$ numbers must be equal.
Therefore, we must have one integer from the first inequality being equal to another integer from the second inequality. Hence $$f_i=f_j+10$$ for some $i,jinBbb N_<31$. Which is exactly what we wanted to prove.
answered 1 hour ago
Dr. MathvaDr. Mathva
3,8411630
$endgroup$
1
$begingroup$
Nice ...............+1
$endgroup$
– Maria Mazur
1 hour ago
add a comment |
$begingroup$
In fact, you would have to consider the case where $f_i-f_j=20$. Which might be messy...
You could alternatively do the following: we know that $$1le f_1<f_2<ldots<f_30=46iff 11le f_1+10<f_2+10<ldots <f_30+10=56$$ Observe know that we are considering $60$ postive integers $f_1,f_2,ldots ,f_30,f_1+10,f_2+10,ldots , f_30+10$ where all of them are less than $57$. By the Pigeonhole principle, at least $2$ numbers must be equal.
Therefore, we must have one integer from the first inequality being equal to another integer from the second inequality. Hence $$f_i=f_j+10$$ for some $i,jinBbb N_<31$. Which is exactly what we wanted to prove.
answered 1 hour ago
Dr. MathvaDr. Mathva
3,8411630
$endgroup$
In fact, you would have to consider the case where $f_i-f_j=20$. Which might be messy...
You could alternatively do the following: we know that $$1le f_1<f_2<ldots<f_30=46iff 11le f_1+10<f_2+10<ldots <f_30+10=56$$ Observe know that we are considering $60$ postive integers $f_1,f_2,ldots ,f_30,f_1+10,f_2+10,ldots , f_30+10$ where all of them are less than $57$. By the Pigeonhole principle, at least $2$ numbers must be equal.
Therefore, we must have one integer from the first inequality being equal to another integer from the second inequality. Hence $$f_i=f_j+10$$ for some $i,jinBbb N_<31$. Which is exactly what we wanted to prove.
answered 1 hour ago
Dr. MathvaDr. Mathva
3,8411630
answered 1 hour ago
Dr. MathvaDr. Mathva
3,8411630
answered 1 hour ago
Dr. MathvaDr. Mathva
3,8411630
answered 1 hour ago
Dr. MathvaDr. Mathva
3,8411630
3,8411630
1
$begingroup$
Nice ...............+1
$endgroup$
– Maria Mazur
1 hour ago
add a comment |
1
$begingroup$
Nice ...............+1
$endgroup$
– Maria Mazur
1 hour ago
1
1
$begingroup$
Nice ...............+1
$endgroup$
– Maria Mazur
1 hour ago
$begingroup$
Nice ...............+1
$endgroup$
– Maria Mazur
1 hour ago
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%2f3207276%2fpigeonhole-principle-problem%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
1
$begingroup$
I don't think you can rule out the possibility that $f_i-f_j=20$. Fortunately, you don't have to. If that's the case, then do the same analysis with the next $11$ days. There aren't enough homework sets for you to hit $20$ twice.
$endgroup$
– Robert Shore
1 hour ago