Pigeohole principle - rolling die

  • Thread starter Thread starter jwxie
  • Start date Start date
  • Tags Tags
    Principle Rolling
AI Thread Summary
The discussion revolves around applying the Pigeonhole Principle to determine how many times a single die must be rolled to achieve repeated scores. For at least two identical scores, seven rolls are needed, as there are six faces on the die. To get at least three identical scores, the correct calculation reveals that 13 rolls are necessary, not eight, due to the need for additional rolls to ensure repetition. The reasoning emphasizes that as the number of required repetitions increases, the number of rolls must also increase significantly. The conversation highlights the complexity of applying the principle beyond the initial understanding.
jwxie
Messages
278
Reaction score
0
How many times must we roll a single die in order to get the same score:
a) at least twice?
b) at least three times?
c) at least n times? for n >= 4

Well I know that P.P says that for m objects, and n boxes, where m > n, there must be one box of n that contains at least two or more objects.

It seems simple, but the application is not.

So for the given problem, like a
There are 6 sides for a single die. And I thought I should do 6^2, since we want to the get the same number at least twice.

I get really stuck at solving this. Can you guys kindly guide me through?

Thanks,
 
Physics news on Phys.org
Well, the die has six different faces. Do you really need to throw it 62 times to get the same result twice? Think of the different faces as the "holes" and the each throw's score as the "pigeons".
 
Okay, in order to get one hole get two pigeons, we need n holes, and n+1 pigeons, so for (a) we need 7, where n = 6.

to get three pigeons in one hole, and we still have 6 (n) holes, i thought we just need another pigeons, total of 8 pigeons, but the answer key said 13. how come?

thanks jsuarez
 
we still have 6 (n) holes, i thought we just need another pigeons, total of 8 pigeons

No, for all questions you have just six "holes" (the faces), but the number of "pigeons" (each pigeon is the score at each throw) increases.

So for the second (and third) questions, just apply the same reasoning that you applied on the first. You should be able to see that 8 doesn't work; just look at the following eight (possible) scores: 1 4 3 2 4 2 1 6

So, how many throws do you need for the same score to appear at least three times?
 
JSuarez said:
No, for all questions you have just six "holes" (the faces), but the number of "pigeons" (each pigeon is the score at each throw) increases.

So for the second (and third) questions, just apply the same reasoning that you applied on the first. You should be able to see that 8 doesn't work; just look at the following eight (possible) scores: 1 4 3 2 4 2 1 6

So, how many throws do you need for the same score to appear at least three times?

oh right. in order to get another one for the one that has two already, we need another round (which means 6 more)

so the whole process grows by 6(n-1) +1
 
Yes.
 

Similar threads

Back
Top