论文部分内容阅读
根据哈佛大学的数学家P.达埃科尼斯(Persi Diaconis)和哥伦比亚大学D.贝耶(David Bayer)的观点,无论你是如何出色的玩牌好手,也不可能将一副牌完全洗匀。去年的这个时候,他们用大标题公布了一个数学证明:至少要洗7次才能使一副52张纸牌彻底洗匀,而多于7次并无多大差别。这件事成了当时的头条新闻。这个问题长期以来难住了别的数学家们。一副52张的纸牌可以有无数种排列次序,52张的任何一张牌可以是整副牌的头一张,51张中的任何一张可以是第二张,依次类推,可能出现的排列数目为52×51×50×……×1。这个计算的结果大约为10~(68),远大于宇宙
According to Harvard mathematician Persi Diaconis and Columbia Baylor, no matter how well-behaved you are, it is impossible to get a complete set of cards . At this time last year, they published a mathematic proof with the headline: at least seven washings to thoroughly clean a pair of 52 cards, while more than seven were not much different. This incident became the headline news at that time. This problem has long stumped other mathematicians. A list of 52 cards can countless sorts. Any one of the 52 cards can be the first card of the entire deck, any of the 51 cards can be the second, and so on. Possible alignment The number is 52 × 51 × 50 × ... × 1. The result of this calculation is about 10 ~ (68), much larger than the universe