Thumbnail
Access Restriction
Open

Author Kozynchenko, Alexander I.
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Run Test ♦ Long Sequence ♦ Bernoulli Trial ♦ Equal Probability Bernoulli Trial ♦ Fibonacci Number ♦ New Algorithm ♦ Event Tree Diagram ♦ Classical Combinatorial Formula ♦ Long Binomial Data Set ♦ Contemporary Computer ♦ Sample Space ♦ Error-free Exact Probability
Abstract A new algorithm of computing statistics of a longest of runs test is proposed for the case of equal probability Bernoulli trials processes. The algorithm is founded on the analysis of the event tree diagram, which has shown the role of Fibonacci numbers of higher orders in counting the number of outcomes of interest in the sample space. The proof by induction is given. Compared to the classical combinatorial formulas, the proposed algorithm provides the error-free exact probabilities and makes possible the processing of very long binomial data sets (up to 103) on contemporary computers.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study