OLAIJU, S and TAIWO, AKEEM A (2015) STEPS PROBLEM: THE LINK BETWEEN COMBINATORIC AND K-BONACCI SEQUENCES. European Journal of Statistics and Probability, 3 (4). pp. 10-19. ISSN 2055-0162
![[img]](https://eprints.federalpolyilaro.edu.ng/style/images/fileicons/text.png) |
Text
TAIWOA.A15.pdf Download (340kB) |
Abstract
In this paper we generalized the combinatorial formula for k-bonacci numbers where k is a positive integer by using the well-known step problem. We solved this problem using the combinatorial analysis. We established the relationship between the combinatorial analysis and the famous Fibonacci sequences. We extended our analysis to the case of taking 1 or 2 or 3 or 4 up to k steps at a time, which allowed us to derive a combinatorial equivalent of k-bonacci numbers
| Item Type: | Article |
|---|---|
| Subjects: | H Social Sciences > H Social Sciences (General) H Social Sciences > HB Economic Theory |
| Divisions: | Faculty of Law, Arts and Social Sciences > School of Management |
| Depositing User: | Miss Ayomikun Ogunbadejo |
| Date Deposited: | 25 Aug 2020 14:14 |
| Last Modified: | 25 Aug 2020 14:14 |
| URI: | http://eprints.federalpolyilaro.edu.ng/id/eprint/1135 |
Actions (login required)
 |
View Item |
