首页 > 最新文献

The American Mathematical Monthly最新文献

英文 中文
Problems and Solutions 问题与解决方案
Pub Date : 2024-05-20 DOI: 10.1080/00029890.2024.2351727
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.2351727","DOIUrl":"https://doi.org/10.1080/00029890.2024.2351727","url":null,"abstract":"Published in The American Mathematical Monthly (Ahead of Print, 2024)","PeriodicalId":501497,"journal":{"name":"The American Mathematical Monthly","volume":"219 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141151410","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}
引用次数: 0
Building Sets of Permutation-Fair Dice 构建互易公平骰子集
Pub Date : 2024-05-13 DOI: 10.1080/00029890.2024.2345576
Michael Purcell
{"title":"Building Sets of Permutation-Fair Dice","authors":"Michael Purcell","doi":"10.1080/00029890.2024.2345576","DOIUrl":"https://doi.org/10.1080/00029890.2024.2345576","url":null,"abstract":"","PeriodicalId":501497,"journal":{"name":"The American Mathematical Monthly","volume":"58 10","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140985096","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}
引用次数: 0
Unlocking Your Bike the Easy Way 轻松为自行车开锁
Pub Date : 2024-05-13 DOI: 10.1080/00029890.2024.2346070
Mathias Sonnleitner
Combination locks are widely used to secure bicycles. We consider a combination lock consisting of adjacent rotating dials with the first nonnegative integers printed on each of them. Assuming that...
密码锁被广泛用于保护自行车。我们考虑的密码锁由相邻的旋转刻度盘组成,每个刻度盘上都印有第一个非负整数。假设...
{"title":"Unlocking Your Bike the Easy Way","authors":"Mathias Sonnleitner","doi":"10.1080/00029890.2024.2346070","DOIUrl":"https://doi.org/10.1080/00029890.2024.2346070","url":null,"abstract":"Combination locks are widely used to secure bicycles. We consider a combination lock consisting of adjacent rotating dials with the first nonnegative integers printed on each of them. Assuming that...","PeriodicalId":501497,"journal":{"name":"The American Mathematical Monthly","volume":"97 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141171119","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}
引用次数: 0
100 Years Ago This Month in The American Mathematical Monthly 100 年前的本月《美国数学月刊
Pub Date : 2024-05-08 DOI: 10.1080/00029890.2024.2345573
Edited by Vadim Ponomarenko
Published in The American Mathematical Monthly (Ahead of Print, 2024)
发表于《美国数学月刊》(2024 年提前出版)
{"title":"100 Years Ago This Month in The American Mathematical Monthly","authors":"Edited by Vadim Ponomarenko","doi":"10.1080/00029890.2024.2345573","DOIUrl":"https://doi.org/10.1080/00029890.2024.2345573","url":null,"abstract":"Published in The American Mathematical Monthly (Ahead of Print, 2024)","PeriodicalId":501497,"journal":{"name":"The American Mathematical Monthly","volume":"35 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141151408","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}
引用次数: 0
On Liouville’s Theorem for Conformal Maps 关于共形映射的柳维尔定理
Pub Date : 2024-05-07 DOI: 10.1080/00029890.2024.2344409
Mathew Kushelman, Peter McGrath
A theorem of Liouville asserts that the simplest angle-preserving transformations on Euclidean space—translations, dilations, reflections, and inversions—generate all angle-preserving transformatio...
柳维尔的一个定理断言,欧几里得空间上最简单的保角变换--平移、扩张、反射和反转--会产生所有的保角变换。
{"title":"On Liouville’s Theorem for Conformal Maps","authors":"Mathew Kushelman, Peter McGrath","doi":"10.1080/00029890.2024.2344409","DOIUrl":"https://doi.org/10.1080/00029890.2024.2344409","url":null,"abstract":"A theorem of Liouville asserts that the simplest angle-preserving transformations on Euclidean space—translations, dilations, reflections, and inversions—generate all angle-preserving transformatio...","PeriodicalId":501497,"journal":{"name":"The American Mathematical Monthly","volume":"56 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140888438","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}
引用次数: 0
Sums of Two Squares Visualized 可视化的两个平方之和
Pub Date : 2024-05-07 DOI: 10.1080/00029890.2024.2344421
Ishan Banerjee, Amites Sarkar
In 1972, John Brillhart described an algorithm for expressing a prime p≡1 (mod4) as the sum of two squares. Brillhart’s algorithm, which is based on the Euclidean algorithm, is simplicity itself. H...
1972 年,约翰-布里尔哈特描述了一种将素数 p≡1 (mod4) 表示为两个平方之和的算法。布里尔哈特的算法以欧几里得算法为基础,本身就很简单。H...
{"title":"Sums of Two Squares Visualized","authors":"Ishan Banerjee, Amites Sarkar","doi":"10.1080/00029890.2024.2344421","DOIUrl":"https://doi.org/10.1080/00029890.2024.2344421","url":null,"abstract":"In 1972, John Brillhart described an algorithm for expressing a prime p≡1 (mod4) as the sum of two squares. Brillhart’s algorithm, which is based on the Euclidean algorithm, is simplicity itself. H...","PeriodicalId":501497,"journal":{"name":"The American Mathematical Monthly","volume":"26 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141151406","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}
引用次数: 0
A Fair Shake: How Close Can The Sum Of n-Sided Dice Be To A Uniform Distribution? 公平分配:n 边骰子之和与均匀分布的关系有多近?
Pub Date : 2024-05-07 DOI: 10.1080/00029890.2024.2347163
Shamil Asgarli, Michael Hartglass, Daniel Ostrov, Byron Walden
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...
掷两颗可能不公平的 n 面骰子(均标有 1、2、...、n),并记录总和。骰子的边数应该如何加权,才能使所得的和最接近均匀分布?
{"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":"https://doi.org/10.1080/00029890.2024.2347163","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.0,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141151409","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}
引用次数: 0
An Exact Bound for the Inner Product of Vectors in ℂ n n 中向量内积的精确边界
Pub Date : 2024-05-03 DOI: 10.1080/00029890.2024.2344412
I. Pinelis
{"title":"An Exact Bound for the Inner Product of Vectors in ℂ\u0000 n","authors":"I. Pinelis","doi":"10.1080/00029890.2024.2344412","DOIUrl":"https://doi.org/10.1080/00029890.2024.2344412","url":null,"abstract":"","PeriodicalId":501497,"journal":{"name":"The American Mathematical Monthly","volume":"89 8","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141016262","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}
引用次数: 0
A Generalization of Wayment’s Mean Value Theorem for Integrals 韦门积分均值定理的一般化
Pub Date : 2024-05-03 DOI: 10.1080/00029890.2024.2344411
L. Bougoffa
{"title":"A Generalization of Wayment’s Mean Value Theorem for Integrals","authors":"L. Bougoffa","doi":"10.1080/00029890.2024.2344411","DOIUrl":"https://doi.org/10.1080/00029890.2024.2344411","url":null,"abstract":"","PeriodicalId":501497,"journal":{"name":"The American Mathematical Monthly","volume":"46 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141015820","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}
引用次数: 0
Zaremba’s Conjecture for Geometric Sequences: An Algorithm 几何序列的扎伦巴猜想:一种算法
Pub Date : 2024-04-02 DOI: 10.1080/00029890.2024.2323902
Elias Dubno
Even though Zaremba’s conjecture remains open, Bourgain and Kontorovich solved the problem for a full density subset. Nevertheless, there are only a handful of explicit sequences known to satisfy t...
尽管扎伦巴的猜想仍悬而未决,但布尔甘和康托罗维奇已经解决了全密度子集的问题。尽管如此,已知只有少数几个明确的序列满足这个猜想。
{"title":"Zaremba’s Conjecture for Geometric Sequences: An Algorithm","authors":"Elias Dubno","doi":"10.1080/00029890.2024.2323902","DOIUrl":"https://doi.org/10.1080/00029890.2024.2323902","url":null,"abstract":"Even though Zaremba’s conjecture remains open, Bourgain and Kontorovich solved the problem for a full density subset. Nevertheless, there are only a handful of explicit sequences known to satisfy t...","PeriodicalId":501497,"journal":{"name":"The American Mathematical Monthly","volume":"21 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141151402","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}
引用次数: 0
期刊
The American Mathematical Monthly
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1