1
$\begingroup$

ID numbers all have 7 digits from 0 to 9. We will assume that all digits can be 0 through 9

This is a homework problem, but I am afraid I am very lost, though I think I am over thinking it.

I know this is the pigeon hole theorom in which if you have N pigeons and k pigeon holes then there is at least on hole with the ceiling of N/k pigeons.

I just don't know how to apply that idea here.

The next question is similar: How many ID numbers must you have to guarantee that at least four of them have the same last 2 digits?

Would the process for this one be different than the first one?

Thanks.

$\endgroup$
  • $\begingroup$ For the first problem: I'm not sure what you mean by "at least two of them sum to the same number"; do you mean "two pairs of them" instead? ... As for the second problem, yes, it's different. How many possible choices are there for the last two digits of the ID number? Now choose the smallest N such that N divided by that number, rounded up, is 4. (There is a formula for that value of N.) $\endgroup$ – Christopher Carl Heckman Dec 1 '15 at 6:43
  • $\begingroup$ I am pretty sure it means the digits sum to the same number. As for the second, there are 81 possible choices and so 81 x 3 + 1 would be my answer? $\endgroup$ – Jane Doe Dec 1 '15 at 6:46
  • $\begingroup$ (a) "Pretty sure"? Do you have the original problem? (b) There are not 81 possible "last 2 digits"; the rest of your answer is correct, though. $\endgroup$ – Christopher Carl Heckman Dec 1 '15 at 6:48
  • $\begingroup$ That is the original problem, and I am sure as the previous part refers to the sum of all digits. And yeah, dumb mistake, 10 choices for each of the last two makes it 301. $\endgroup$ – Jane Doe Dec 1 '15 at 6:52
  • $\begingroup$ I find the title of this question misleading. $\endgroup$ – Greg Martin Dec 1 '15 at 7:38
4
$\begingroup$

For the first part, there are exactly $64$ possibilities: the possible sums range from $0$ to $63$. In order to guarantee a repetition, you need to have $64+1$ numbers. Imagine the worst case scenario that the first $64$ are all distinct. While this is highly unlikely, it is not impossible. Now add one more random code. It must duplicate one of sums in the previous $64$ codes, its unavoidable! The thing to remember is that you might do it with fewer codes, but there is a non-zero probability that all the sums would be distinct, so you cannot guarantee that some sum is repeated.

For the second part there are $10^2$ possible 2-digit endings to the 7-digit codes. You'll need $3\cdot 10^2+1$ to guarantee one of the codes repeats $4$ times by the same reasoning as above.

$\endgroup$
  • 1
    $\begingroup$ Your answer to the second part is wrong; BNSlug got it right (301). $\endgroup$ – Christopher Carl Heckman Dec 1 '15 at 7:21
  • $\begingroup$ In a seven digit code there are $10^5$ codes that share a fixed $2$ digit ending. Once the two digit ending is determined, then my answer would be correct. But this is not the question being asked upon further reflection. I have edited my answer accordingly. $\endgroup$ – Laars Helenius Dec 1 '15 at 7:29
  • 1
    $\begingroup$ Thanks a bunch, this makes a lot of sense. $\endgroup$ – Jane Doe Dec 1 '15 at 7:36

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.