2011-01-17

類似於鴿龍問題

A factory makes automobile parts. Each part has a code consisting of a digit,a letter,and a digit,with the digits disinct,such as 5C7,1O6,or 3Z0.Last week the factory made 8,000 parts.
Find the minimum number of parts that must have the same serial number.[96台大電機離散 14 .]

解答給D,但我覺得是C,理由如下:
   8000 = 2340 + 2340 + 2340 + 980
   Find the minimum number of parts that must have the same serial number.
   最小的重複號碼我認為只有三組
   ex: 位數為2,僅使用0~1編號,共14組
         考慮如下;
         (0 0)   (0 0)    (0 0)    (0 0)
         (0 1)   (0 1)    (0 1)    (0 1)
         (1 0)   (1 0)    (1 0)  
         (1 1)   (1 1)    (1 1)
        Find the minimum number of parts that must have the same serial number.
        >>三組

1 則留言:

線代離散助教(wynne) 提到...

the idea here is that there are 10*26*9=2340 types of code, so the minimum number of the parts that must have the same serial number should be ceiling(8000/2340)=4