On The Improvement of Combinatorial Mathematics Teaching From Generating Function
- Cheng Ji
 
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.
-  Full Text: 
 PDF 
                            
                     - DOI:10.5539/cis.v10n2p104
 
Journal Metrics
WJCI (2022): 0.636
Impact Factor 2022 (by WJCI): 0.419
h-index (January 2024): 43
i10-index (January 2024): 193
h5-index (January 2024): N/A
h5-median(January 2024): N/A
( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )
Index
- BASE (Bielefeld Academic Search Engine)
 - CNKI Scholar
 - CrossRef
 - DBLP (2008-2019)
 - EuroPub Database
 - Excellence in Research for Australia (ERA)
 - Genamics JournalSeek
 - GETIT@YALE (Yale University Library)
 - Google Scholar
 - Harvard Library
 - Infotrieve
 - Mendeley
 - Open policy finder
 - ResearchGate
 - Scilit
 - The Keepers Registry
 - UCR Library
 - WJCI Report
 - WorldCat
 
Contact
- Chris LeeEditorial Assistant
 - cis@ccsenet.org