Literaturnachweis - Detailanzeige
Autor/inn/en | Plaza, A.; Falcon, S. |
---|---|
Titel | Combinatorial Proofs of Honsberger-Type Identities |
Quelle | In: International Journal of Mathematical Education in Science and Technology, 39 (2008) 6, S.785-792 (8 Seiten)Infoseite zur Zeitschrift
PDF als Volltext |
Sprache | englisch |
Dokumenttyp | gedruckt; online; Zeitschriftenaufsatz |
ISSN | 0020-739X |
Schlagwörter | Numbers; Mathematical Concepts; Mathematics Instruction; Problem Solving; Mathematical Logic; Validity; Arithmetic; Equations (Mathematics); Correlation |
Abstract | In this article, we consider some generalizations of Fibonacci numbers. We consider k-Fibonacci numbers (that follow the recurrence rule F[subscript k,n + 2] = kF[subscript k,n + 1] + F[subscript k,n]), the (k, l)-Fibonacci numbers (that follow the recurrence rule F[subscript k,n + 2] = kF[subscript k,n + 1] + lF[subscript k,n]), and the Fibonacci p-step numbers (F[subscript p](n) = F[subscript p](n - 1) + F[subscript p](n - 2) + ... + F[subscript p](n - p), with n greater than p + 1, and p greater than 2). Then we provide combinatorial interpretations of these numbers as square and domino tilings of n-boards, and by easy combinatorial arguments Honsberger identities for these Fibonacci-like numbers are given. While it is a straightforward task to prove these identities with induction, and also by arithmetical manipulations such as rearrangements, the approach used here is quite simple to follow and eventually reduces the proof to a counting problem. (Contains 5 figures and 3 tables.) (As Provided). |
Anmerkungen | Taylor & Francis, Ltd. 325 Chestnut Street Suite 800, Philadelphia, PA 19106. Tel: 800-354-1420; Fax: 215-625-2940; Web site: http://www.tandf.co.uk/journals |
Erfasst von | ERIC (Education Resources Information Center), Washington, DC |
Update | 2017/4/10 |