scientific article; zbMATH DE number 4068005

From MaRDI portal
Publication:3800845





[For the entire collection see Zbl 0635.00004.] Denote by \(L_ n\) the length of the longest success run in n Bernoulli trials. In a recent paper, the author and \textit{F. S. Makri} [Fibonacci Q. 23, 338-346 (1985; Zbl 0575.60022)] derived a closed formula for the distribution function of \(L_ n\), \(P(L_ n\leq k)\), in terms of multinomial coefficients. They also derived a simple formula for \(P(L_ n\leq K)\) in terms of the Fibonacci-type polynomials of order \(k+1\). However, the task of calculating the probabilities \(P(L_ n\leq k)\), \(0\leq k\leq n\), by either formula may become quite cumbersome for large values of k and n. In the present paper, simple formulas are derived for \(P(L_ n<k)\) when \(k\leq n\leq 4k+2\), and a recurrence for \(P(L_ n<k)\) if \(n\geq 4k+3\). As a byproduct, simple formulas are obtained for the reliability R(p;k,n) of a consecutive-k-out-of-n:F system, when \(k\leq n\leq 4k+2\), and a recurrence on n for R(p;k,n) if \(n\geq 4k+3.\) In addition, simple formulas are given for \(P(N_ k=n)\), when \(k\leq n\leq 5k+3\), and a recurrence on n for \(P(N_ k=n)\) if \(n\geq 5k+4\), where \(N_ k\) denotes the number of Bernoulli trials until the occurrence of a success run of length k. The usefulness of the present results for computational purposes is illustrated by means of four examples.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3800845)