Question

If \(A \subseteq S\), which inequality always gives the possible number of elements in \(A\)?

Options

• \(0 \leq n(S) \leq n(A)\)

• \(1 \leq n(A) \leq n(S)\)

• \(n(S) \leq n(A) \leq 0\)

• \(0 \leq n(A) \leq n(S)\)

Answer 1

An event may contain no elements, giving \(n(A)=0\). Because it is a subset of \(S\), it cannot contain more elements than \(S\), so \(n(A) \leq n(S)\).