James Chen TMUA Paper 2 · Question 11

When setting a TMUA question, I write $n$ statements, where none of them, some of them, or all of them are true. I then ask which of the statements is/are true. What is the minimum number of answer options I must set such that they cover every possible combination (disregarding order) of correct statements?

Note: See Question 1 for an example.

\displaystyle\sum_{r=0}^n\binom nr

\displaystyle\sum_{r=1}^n\binom nr

\displaystyle1+\sum_{r=0}^n\binom nr

2^{n-1}

2^{n+1}

\displaystyle1+\sum_{r=1}^n\binom nr

\displaystyle2+\sum_{r=0}^n\binom nr

\displaystyle2+\sum_{r=1}^n\binom nr

examday

James Chen TMUA Paper 2 · Q11