You are here

Streaks and Generalized Fibonacci Sequences

by Shahla Ahdout, Sheldon Rothman, and Helen Strassberg

This article originally appeared in:
College Mathematics Journal
May, 2006

Subject classification(s): Discrete Mathematics | Combinatorics | Numbers and Computation | Patterns and Sequences | Fibonacci Sequence
Applicable Course(s): 2.6 Math Liberal Arts | 2.7 Finite Math | 3.7 Discrete Math | 4.4 Combinatorics | 6.1 Probability & Statistics

It is shown that the number of \(n\)-strings that contain a \(2\)-streak involves the Fibonacci numbers, and that this can be generalized to \(k\)-streaks.

A pdf copy of the article can be viewed by clicking below. Since the copy is a faithful reproduction of the actual journal pages, the article may not begin at the top of the first page.

To open this file please click here.

These pdf files are furnished by JSTOR.

Classroom Capsules would not be possible without the contribution of JSTOR.

JSTOR provides online access to pdf copies of 512 journals, including all three print journals of the Mathematical Association of America: The American Mathematical Monthly, College Mathematics Journal, and Mathematics Magazine. We are grateful for JSTOR's cooperation in providing the pdf pages that we are using for Classroom Capsules.

Capsule Course Topic(s):
Probability | Combinatorics
Average: 2.5 (21 votes)