Recursive Theorems for Success Runs and Reliability of Consecutive-K-Out-of-N: F Systems

Andreas N. Philippou

A chapter in Applications of Fibonacci Numbers, 1988, pp 149-161 from Springer

Abstract: Abstract Unless otherwise stated, in this paper k is a fixed positive integer, nf (1 ≤i ≤k) and n are non-negative integers as specified, p and x are real numbers in the intervals (0, 1) and (0, ∞), respectively, and q = 1-p. In a recent paper, Philippou and Makri [11] studied the length Ln (n≥1) of the longest success run in n Bernoulli trials, deriving the probability function of Ln, its distribution function, and its factorial moments. In particular, they found that (1.1) $$ P({L_n} \le k) = \frac{{{p^{n + 1}}}}{q}{\sum\limits_{{n_1},...,{n_{k + 1}}} {\left( {_{}^{{n_1} + ... + {n_{k + 1}}}} \right)(\frac{q}{p})} ^{{n_1} + ... + {n_{k + 1}}}},0 \le k \le n,{n_1} + 2{n_2} + ... + (k + 1){n_{k + 1}} = n + 1 $$ and (1.2) $$ P({L_n} \le k) = \frac{{{p^{n + 1}}}}{q}F_{n + 2}^{(k + 1)}(q/p),0 \le k \le n $$ where $$ \left\{ {F_n^{(k)}(x))_n^\infty } \right. = 0 $$ are the Fibnacci-type polynomials of order k [11, 15].

Date: 1988
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-7801-1_14

Ordering information: This item can be ordered from
http://www.springer.com/9789401578011

DOI: 10.1007/978-94-015-7801-1_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().