Integer Binomial Plan: a Generalization on Factorials and Binomial Coefficients
- Luís Ferreira
Abstract
The concept of factorial n of order k is presented in the sets of real numbers n and integer k. Some applications of this concept are examined, featuring the consistency of its proposal, and a pair of theorems demonstrated. In generalising binomial coefficients to all integers, the Pascal's Triangle is expanded to an Integer Binomial Plan, which displays remarkable properties.
- Full Text: PDF
- DOI:10.5539/jmr.v2n3p18
This work is licensed under a Creative Commons Attribution 4.0 License.
Index
- Academic Journals Database
- ACNP
- Aerospace Database
- BASE (Bielefeld Academic Search Engine)
- Civil Engineering Abstracts
- CNKI Scholar
- COPAC
- DTU Library
- EconPapers
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Google Scholar
- Harvard Library
- IDEAS
- Infotrieve
- JournalTOCs
- LOCKSS
- MathGuide
- MathSciNet
- MIAR
- PKP Open Archives Harvester
- Publons
- RePEc
- ResearchGate
- Scilit
- SHERPA/RoMEO
- SocioRePEc
- Standard Periodical Directory
- Technische Informationsbibliothek (TIB)
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WorldCat
Contact
- Sophia WangEditorial Assistant
- jmr@ccsenet.org