这个进展要从2011年的一个帖子说起。话说那年在国外一个动漫二次元爱好者的网站（4chan）上有人发了这么一个帖子：怎样以最快的速度看完“凉宫春日的忧郁”，并把所有可能的顺序都到？这句话的意思我得解释一下，这个问题不是二次元爱好者还真不好理解。......总之，你的目标就是找出一个最短由123组成的数字序列，其中要包含123的所有6种排列顺序。而这种由n个不同符号组成的序列，其中包含有这些符号所有排列顺序的序列要做“超级排列”，其中最短的一种排列方式叫“最小超级排列”，而其长度，叫做n的“最小超级排列数”，或者就简称为n的超级排列数。这个问题理解起来是不是够简单？1到4的最小超级排列：已知超级排列数：上限：n! + (n – 1)! + (n – 2)! + (n – 3)! +n – 3下限：n! + (n – 1)! + (n – 2)! +n – 3订阅公众号获取讲稿：dalaoli_shuxue
No persons identified in this episode.
This episode hasn't been transcribed yet
Help us prioritize this episode for transcription by upvoting it.
Popular episodes get transcribed faster
Other recent transcribed episodes
Transcribed and ready to explore now
Eric Larsen on the emergence and potential of AI in healthcare
10 Dec 2025
McKinsey on Healthcare
Reducing Burnout and Boosting Revenue in ASCs
10 Dec 2025
Becker’s Healthcare -- Spine and Orthopedic Podcast
Dr. Erich G. Anderer, Chief of the Division of Neurosurgery and Surgical Director of Perioperative Services at NYU Langone Hospital–Brooklyn
09 Dec 2025
Becker’s Healthcare -- Spine and Orthopedic Podcast
Dr. Nolan Wessell, Assistant Professor and Well-being Co-Director, Department of Orthopedic Surgery, Division of Spine Surgery, University of Colorado School of Medicine
08 Dec 2025
Becker’s Healthcare -- Spine and Orthopedic Podcast
NPR News: 12-08-2025 2AM EST
08 Dec 2025
NPR News Now
NPR News: 12-08-2025 1AM EST
08 Dec 2025
NPR News Now