Shamil Asgarli, Michael Hartglass, Daniel Ostrov, Byron Walden
{"title":"公平分配：n 边骰子之和与均匀分布的关系有多近？","authors":"Shamil Asgarli, Michael Hartglass, Daniel Ostrov, Byron Walden","doi":"10.1080/00029890.2024.2347163","DOIUrl":null,"url":null,"abstract":"Two possibly unfair n-sided dice, both labeled 1,2,…,n, are rolled, and the sum is recorded. How should the dice’s sides be weighted so that the resulting sum is closest to the uniform distribution...","PeriodicalId":501497,"journal":{"name":"The American Mathematical Monthly","volume":"26 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Fair Shake: How Close Can The Sum Of n-Sided Dice Be To A Uniform Distribution?\",\"authors\":\"Shamil Asgarli, Michael Hartglass, Daniel Ostrov, Byron Walden\",\"doi\":\"10.1080/00029890.2024.2347163\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Two possibly unfair n-sided dice, both labeled 1,2,…,n, are rolled, and the sum is recorded. How should the dice’s sides be weighted so that the resulting sum is closest to the uniform distribution...\",\"PeriodicalId\":501497,\"journal\":{\"name\":\"The American Mathematical Monthly\",\"volume\":\"26 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The American Mathematical Monthly\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/00029890.2024.2347163\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The American Mathematical Monthly","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/00029890.2024.2347163","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
掷两颗可能不公平的 n 面骰子（均标有 1、2、...、n），并记录总和。骰子的边数应该如何加权，才能使所得的和最接近均匀分布？
A Fair Shake: How Close Can The Sum Of n-Sided Dice Be To A Uniform Distribution?
Two possibly unfair n-sided dice, both labeled 1,2,…,n, are rolled, and the sum is recorded. How should the dice’s sides be weighted so that the resulting sum is closest to the uniform distribution...
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
