Homework planning - Colegiul National C. Negruzzi (Iași)

Résumé de la production
Passing an exam requires that among a sequence of n homeworks a student does not obtain k consecutive failures. This leads to counting sequences of n terms "P" (pass) or "F" (fail) without k consecutive "F". In this work a recurrence equation on n is established, k being fixed, and this equation is solved explicitly for k=2. Then, the authors study the probabilistic version where "P" is obtained with a certain probability p, independently for each homework.
Mots clés
combinatoire des mots
Lecture conseillée
à partir de la terminale