# Question: In Example 1 4 we showed that a true false test consisting

In Example 1.4 we showed that a true–false test consisting of 20 questions can be marked in 1,048,576 different ways. In how many ways can each question be marked true or false so that

(a) 7 are right and 13 are wrong;

(b) 10 are right and 10 are wrong;

(c) At least 17 are right?

(a) 7 are right and 13 are wrong;

(b) 10 are right and 10 are wrong;

(c) At least 17 are right?

**View Solution:**## Answer to relevant Questions

Among the seven nominees for two vacancies on a city council are three men and four women. In how many ways can these vacancies be filled (a) With any two of the seven nominees; (b) With any two of the four women; (c) With ...When n is large, n! can be approximated by means of the expression Called Stirling’s formula, where e is the base of natural logarithms. (A derivation of this formula may be found in the book by W. Feller cited among the ...In a T- maze, a rat is given food if it turns left And an electric shock if it turns right. On the first trial there is a 50– 50 chance that a rat will turn either way; then, if it receives food on the first trial, the ...Use the Venn diagram of Figure 2.7 And the method by which we proved Theorem 2.7 to prove Theorem 2.8. Figure 2.7 Given three events A, B, And C such that P(A ∩ B ∩ C) Z0 And P(C| A ∩ B) = P(C| B) , show that P(A| B ∩ C) = P(A| B) .Post your question