{"title":"关于一个二项式系数除法器的注记","authors":"Matthew Just","doi":"10.1080/0025570X.2023.2203055","DOIUrl":null,"url":null,"abstract":"Summary Let n be a positive integer, and k and integer with . Let g be the greatest common divisor of k and n. We use the cycle construction to give a combinatorial proof that the fraction n/g divides the binomial coefficient .","PeriodicalId":18344,"journal":{"name":"Mathematics Magazine","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Note on a Binomial Coefficient Divisor\",\"authors\":\"Matthew Just\",\"doi\":\"10.1080/0025570X.2023.2203055\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary Let n be a positive integer, and k and integer with . Let g be the greatest common divisor of k and n. We use the cycle construction to give a combinatorial proof that the fraction n/g divides the binomial coefficient .\",\"PeriodicalId\":18344,\"journal\":{\"name\":\"Mathematics Magazine\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematics Magazine\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/0025570X.2023.2203055\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics Magazine","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/0025570X.2023.2203055","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
Summary Let n be a positive integer, and k and integer with . Let g be the greatest common divisor of k and n. We use the cycle construction to give a combinatorial proof that the fraction n/g divides the binomial coefficient .
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
