1)SAP 2)IBM,...007 too...I have to ...

來源: jinjing 於 2011-03-20 12:25:26 [] [舊帖] [給我悄悄話] 閱讀數 : (697 bytes)

1)As 100/4=25,25=3m+1,the second win,my original proof is not good,but answer is right.This question is same as that there're 25 letters one can circles 1 letter or 2 connected letters,who circles the last is lost.

2)KMM is right,as 3^11>100000>3^10,11 is enought. I have a trick anwser,9 is enough only one day.

We can identify 9!+1=362880+1,code bottles,using permutation.code peoples,1,2,3,4,5,6,7,8,9.if bottle code is 736592148,letNO.1 takes 7g,No.2 take 3,...No.9 takes 8g. If it is poison,people die should be as this order 5,9,1,3,4,8,2,7.As 1 to 1,we can identify 9!+1.The formula is M=D*P!+1.D is number of days.P are the number of people.If 2 days M=725761.

所有跟帖： 

• 回複：1)SAP 2)IBM,...007 too...I have to ... -康MM- ♀ 給 康MM 發送悄悄話 康MM 的博客首頁 (275 bytes) () 03/21/2011 postreply 08:27:34

• for2)You are very far from understanding the problem. -jinjing- ♀ 給 jinjing 發送悄悄話 (270 bytes) () 03/21/2011 postreply 10:37:44

• for 1) come on 可憐的 Jinjing....非整數, -guest007- ♂ 給 guest007 發送悄悄話 (114 bytes) () 03/21/2011 postreply 11:02:25

• 25 letters , it is not easy to do. I got this anwser in ten Mts. -jinjing- ♀ 給 jinjing 發送悄悄話 (202 bytes) () 03/21/2011 postreply 12:26:37

• 回複：for2)You are very far from understanding the problem. -康MM- ♀ 給 康MM 發送悄悄話 康MM 的博客首頁 (133 bytes) () 03/21/2011 postreply 15:53:23

• OK. -jinjing- ♀ 給 jinjing 發送悄悄話 (0 bytes) () 03/21/2011 postreply 16:05:17

• 康mm進 -guest007- ♂ 給 guest007 發送悄悄話 (165 bytes) () 03/21/2011 postreply 16:46:37

• 回複：康mm進 -康mm- ♀ 給 康mm 發送悄悄話 康mm 的博客首頁 (127 bytes) () 03/22/2011 postreply 05:03:02

• 數學證明，先手贏，就種中心就行． -jinjing- ♀ 給 jinjing 發送悄悄話 (265 bytes) () 03/22/2011 postreply 20:18:05

請您先登陸，再發跟帖！