送交者: forfun 于 2009-06-03, 11:39:47:

回答: take the next diamond which is larger than the size you remember 由 blobfish 于 2009-06-03, 11:20:51:

• maxmize x*(1/(x+1) + 1/(x+2) + ... + (1/N-1)) (无内容) - licorice (0 bytes) 2009-06-03, 13:19:21 (332228)
  • probability of finding the largest one is 39.87% (无内容) - licorice (0 bytes) 2009-06-03, 13:23:34 (332229)
    • should be 10/e=36.79% (无内容) - LaoXiao (0 bytes) 2009-06-03, 17:42:32 (332293)
      • Sorry, should be 39.87% (无内容) - LaoXiao (0 bytes) 2009-06-03, 17:49:27 (332296)
    • 恩，对的。挺有意思。。。 - forfun (1900 bytes) 2009-06-03, 13:38:22 (332230)
      • Dear forfun, could you please give me your code? thanks in advance (无内容) - blobfish (0 bytes) 2009-06-03, 14:42:40 (332246)
        • Simulation matlab code: findfloor function - forfun (1072 bytes) 2009-06-03, 14:52:32 (332249)
        • Simulation matlab code: main code. - forfun (809 bytes) 2009-06-03, 14:50:53 (332248)

加跟贴