布尔加法组合数学公式的一个新证明

IF 1 Q1 MATHEMATICS

Discrete Mathematics Letters Pub Date : 2022-09-02 DOI:10.47443/dml.2022.109

Necdet Batır, S. Atpinar

{"title":"布尔加法组合数学公式的一个新证明","authors":"Necdet Batır, S. Atpinar","doi":"10.47443/dml.2022.109","DOIUrl":null,"url":null,"abstract":"The Boole’s additive combinatorics formula is given by n (cid:88) k =0 ( − 1) n − k (cid:32) n k (cid:33) k m =   0 if m < n, n ! if m = n. A new proof of this formula is presented in this paper.","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A New Proof of Boole’S Additive Combinatorics Formula\",\"authors\":\"Necdet Batır, S. Atpinar\",\"doi\":\"10.47443/dml.2022.109\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Boole’s additive combinatorics formula is given by n (cid:88) k =0 ( − 1) n − k (cid:32) n k (cid:33) k m =   0 if m < n, n ! if m = n. A new proof of this formula is presented in this paper.\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-09-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2022.109\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2022.109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

《布尔additive combinatorics是赐予由n (cid的公式:88)k = 0 (n−1)k(−cid 33: 32) n k (cid) k m =0如果m < n, n !如果m = n. A新的公式证明在这张纸上。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A New Proof of Boole’S Additive Combinatorics Formula

The Boole’s additive combinatorics formula is given by n (cid:88) k =0 ( − 1) n − k (cid:32) n k (cid:33) k m =   0 if m < n, n ! if m = n. A new proof of this formula is presented in this paper.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete Mathematics Letters Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.50

自引率

12.50%

发文量

审稿时长

12 weeks