Pub Date : 2024-02-22DOI: 10.1080/00029890.2024.2313951
Edited by Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West
Published in The American Mathematical Monthly (Ahead of Print, 2024)
发表于《美国数学月刊》（2024 年提前出版）
{"title":"Problems and Solutions","authors":"Edited by Daniel H. Ullman, Daniel J. Velleman, Stan Wagon, Douglas B. West","doi":"10.1080/00029890.2024.2313951","DOIUrl":"https://doi.org/10.1080/00029890.2024.2313951","url":null,"abstract":"Published in The American Mathematical Monthly (Ahead of Print, 2024)","PeriodicalId":517373,"journal":{"name":"American Mathematical Monthly","volume":"23 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139925221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-22DOI: 10.1080/00029890.2024.2308489
Renyuan Li, Shenglong Zhu
We introduce an extension of Mastermind called Clear Mastermind with enhanced feedback inspired by that from Wordle. The only difference between Clear Mastermind and Mastermind is a rule that provi...
{"title":"Playing Mastermind with Wordle-like Feedback","authors":"Renyuan Li, Shenglong Zhu","doi":"10.1080/00029890.2024.2308489","DOIUrl":"https://doi.org/10.1080/00029890.2024.2308489","url":null,"abstract":"We introduce an extension of Mastermind called Clear Mastermind with enhanced feedback inspired by that from Wordle. The only difference between Clear Mastermind and Mastermind is a rule that provi...","PeriodicalId":517373,"journal":{"name":"American Mathematical Monthly","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139925220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-22DOI: 10.1080/00029890.2024.2309103
Pamela E. Harris, Jan Kretschmann, J. Carlos Martínez Mori
Quicksort is a classical divide-and-conquer sorting algorithm. It is a comparison sort that makes an average of 2(n+1)Hn−4n comparisons on an array of size n ordered uniformly at random, where Hn:=...
Quicksort 是一种经典的分而治之排序算法。它是一种比较排序，在大小为 n 的数组上平均进行 2(n+1)Hn-4n 次随机均匀排序的比较，其中 Hn:=...
{"title":"Lucky Cars and the Quicksort Algorithm","authors":"Pamela E. Harris, Jan Kretschmann, J. Carlos Martínez Mori","doi":"10.1080/00029890.2024.2309103","DOIUrl":"https://doi.org/10.1080/00029890.2024.2309103","url":null,"abstract":"Quicksort is a classical divide-and-conquer sorting algorithm. It is a comparison sort that makes an average of 2(n+1)Hn−4n comparisons on an array of size n ordered uniformly at random, where Hn:=...","PeriodicalId":517373,"journal":{"name":"American Mathematical Monthly","volume":"20 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139928455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-22DOI: 10.1080/00029890.2024.2311446
Golden Sun, Vladyslav Yaskin
Let A be a subset of the integer lattice Zn contained inside a sphere S in Rn. Suppose that for each u∈S we know the number of points of A visible from u. Does this information determine the set A ...
设 A 是整数网格 Zn 的一个子集，包含在 Rn 中的球面 S 内。假设对于每个 u∈S 我们都知道从 u 可见的 A 点的个数。这些信息是否决定了集合 A ...
{"title":"On a Uniqueness Problem in Discrete Tomography","authors":"Golden Sun, Vladyslav Yaskin","doi":"10.1080/00029890.2024.2311446","DOIUrl":"https://doi.org/10.1080/00029890.2024.2311446","url":null,"abstract":"Let A be a subset of the integer lattice Zn contained inside a sphere S in Rn. Suppose that for each u∈S we know the number of points of A visible from u. Does this information determine the set A ...","PeriodicalId":517373,"journal":{"name":"American Mathematical Monthly","volume":"34 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139925222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：