{"title":"从生成函数谈组合数学教学的改进","authors":"C. Ji","doi":"10.5539/cis.v10n2p104","DOIUrl":null,"url":null,"abstract":"Generating function is an effective method to solve combinatorial counting problem, but it most likely to be neglected in combinatorial mathematics teaching. In this paper, we provides a demonstration for combinatorial mathematics teaching improvement by using the generating function solving combination number and the sum of preceding terms among sequence of numbers.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"10 1","pages":"104-108"},"PeriodicalIF":0.0000,"publicationDate":"2017-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On The Improvement of Combinatorial Mathematics Teaching From Generating Function\",\"authors\":\"C. Ji\",\"doi\":\"10.5539/cis.v10n2p104\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Generating function is an effective method to solve combinatorial counting problem, but it most likely to be neglected in combinatorial mathematics teaching. In this paper, we provides a demonstration for combinatorial mathematics teaching improvement by using the generating function solving combination number and the sum of preceding terms among sequence of numbers.\",\"PeriodicalId\":14676,\"journal\":{\"name\":\"J. Chem. Inf. Comput. Sci.\",\"volume\":\"10 1\",\"pages\":\"104-108\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Chem. Inf. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5539/cis.v10n2p104\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Chem. Inf. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5539/cis.v10n2p104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On The Improvement of Combinatorial Mathematics Teaching From Generating Function
Generating function is an effective method to solve combinatorial counting problem, but it most likely to be neglected in combinatorial mathematics teaching. In this paper, we provides a demonstration for combinatorial mathematics teaching improvement by using the generating function solving combination number and the sum of preceding terms among sequence of numbers.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
