Coin-weighting problem

Let n coins of weights 0 and 1 be given. We are also given a scale with which we may weigh any subset of the coins. The information from previous weighting may be used. The object is to determine the weights of the coins with the minimal number of weightings. Formally, a collection ${S}_{1},\dots ,{S}_{m}$ subsets of $\{1,\dots ,n\}$ is called determing if any $T\subseteq \{1,\dots ,n\}$ can be uniquely determined by the cardinalities $|{S}_{i}\cap T|$ for $1\le i\le m.$. Let D(n) be the minimum m for which such a determing collection exists. Show that $D(n)\ge \frac{n}{{\mathrm{log}}_{2}(n+1)}$.

Let ${S}_{1},\dots ,{S}_{m}$ be an arbitrary determining collection. Also, assume that T be an arbitrary subset of $\{1,\dots ,n\}$. Then there are ${2}^{n}$ possibilities to choose T from $\{1,\dots ,n\}$. On the other hand, for each $1\le i\le m$, there are only $n+1$ possible $|{S}_{i}\cap T|$ because $0\le |{S}_{i}\cap T|\le |{S}_{i}|\le n$. But now I don't know how to apply the pigeonhole principle. This principle says that: if a set A consisting of at least $rs+1$ objects is partitioned into r classes, then some class receives at least $s+1$ objects. Equivalently, if $A=\bigcup _{i=1}^{r}{B}_{i}$ (disjoint union) and $|{B}_{i}|\le s$ for every $1\le i\le r$, then $|A|\le rs$. I can't use this principle in my answer. How can I introduce A and ${B}_{i}^{{}^{\prime}}s$ here? I was wondering if someone could help me about it.

Let n coins of weights 0 and 1 be given. We are also given a scale with which we may weigh any subset of the coins. The information from previous weighting may be used. The object is to determine the weights of the coins with the minimal number of weightings. Formally, a collection ${S}_{1},\dots ,{S}_{m}$ subsets of $\{1,\dots ,n\}$ is called determing if any $T\subseteq \{1,\dots ,n\}$ can be uniquely determined by the cardinalities $|{S}_{i}\cap T|$ for $1\le i\le m.$. Let D(n) be the minimum m for which such a determing collection exists. Show that $D(n)\ge \frac{n}{{\mathrm{log}}_{2}(n+1)}$.

Let ${S}_{1},\dots ,{S}_{m}$ be an arbitrary determining collection. Also, assume that T be an arbitrary subset of $\{1,\dots ,n\}$. Then there are ${2}^{n}$ possibilities to choose T from $\{1,\dots ,n\}$. On the other hand, for each $1\le i\le m$, there are only $n+1$ possible $|{S}_{i}\cap T|$ because $0\le |{S}_{i}\cap T|\le |{S}_{i}|\le n$. But now I don't know how to apply the pigeonhole principle. This principle says that: if a set A consisting of at least $rs+1$ objects is partitioned into r classes, then some class receives at least $s+1$ objects. Equivalently, if $A=\bigcup _{i=1}^{r}{B}_{i}$ (disjoint union) and $|{B}_{i}|\le s$ for every $1\le i\le r$, then $|A|\le rs$. I can't use this principle in my answer. How can I introduce A and ${B}_{i}^{{}^{\prime}}s$ here? I was wondering if someone could help me about it.