For each successive presidential term from Teddy Roosevelt to Ronald Reagan (first term), the party affiliation controlling the White House is shown below, where R designates Republican and D designates Democrat.† R R R D D R R D D D D D R D R R D R Historical Note: In cases in which a president died in office or resigned, the period during which the vice president finished the term is not counted as a new term. Test the sequence for randomness. Use ? = 0.05. (a) What is the level of significance? State the null and alternate hypotheses. Ho: The symbols are not randomly mixed. H1: The symbols are not randomly mixed.Ho: The symbols are randomly mixed. H1: The symbols are not randomly mixed. Ho: The symbols are not randomly mixed. H1: The symbols are randomly mixed.Ho: The symbols are randomly mixed. H1: The symbols are randomly mixed. (b) Find the sample test statistic R, the number of runs. R = (c) Find the upper and lower critical values in the Critical Values for Number of Runs R table. c1=c2= (d) Conclude the test. At the ? = 0.05 level, we reject the null hypothesis and conclude the data are not statistically significant.At the ? = 0.05 level, we fail to reject the null hypothesis and conclude the data are not statistically significant. At the ? = 0.05 level, we reject the null hypothesis and conclude the data are statistically significant.At the ? = 0.05 level, we fail to reject the null hypothesis and conclude the data are statistically significant. (e) Interpret your conclusion in the context of the application. Fail to reject the null hypothesis, there is sufficient evidence that the sequence of presidential party affiliation is not random.Fail to reject the null hypothesis, there is insufficient evidence that the sequence of presidential party affiliation is not random. Reject the null hypothesis, there is sufficient evidence that the sequence of presidential party affiliation is not random.Reject the null hypothesis, there is insufficient evidence that the sequence of presidential party affiliation is not random.
Permutations and Combinations
If there are 5 dishes, they can be relished in any order at a time. In permutation, it should be in a particular order. In combination, the order does not matter. Take 3 letters a, b, and c. The possible ways of pairing any two letters are ab, bc, ac, ba, cb and ca. It is in a particular order. So, this can be called the permutation of a, b, and c. But if the order does not matter then ab is the same as ba. Similarly, bc is the same as cb and ac is the same as ca. Here the list has ab, bc, and ac alone. This can be called the combination of a, b, and c.
Counting Theory
The fundamental counting principle is a rule that is used to count the total number of possible outcomes in a given situation.
R | R | R | D | D | R | R | D | D | D | D | D |
R | D | R | R | D | R |
Run test :
Run test is a statistical test used to determine of the data obtained from a sample is random. That is why it is called Run Test for Randomness.
Randomness of the data is determined based on the number and nature of runs present in the data of interest.
Given Information :
R | R | R | D | D | R | R | D | D | D | D | D |
R | D | R | R | D | R |
Step by step
Solved in 2 steps with 3 images