{"title":"可视化的两个平方之和","authors":"Ishan Banerjee, Amites Sarkar","doi":"10.1080/00029890.2024.2344421","DOIUrl":null,"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.0000,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sums of Two Squares Visualized\",\"authors\":\"Ishan Banerjee, Amites Sarkar\",\"doi\":\"10.1080/00029890.2024.2344421\",\"DOIUrl\":null,\"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.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.2344421\",\"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.2344421","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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...
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
