In Classical group testing, one is given a population of n items N which contains some defective d items inside. A group test (pool) is a test on a subset of N. Under the circumstance of no errors, a test is negative if the testing pool contains no defective items and the test is positive if the testing pool contains at least one defective item but we don’t know which one. The goal is to find all defectives by using as less tests as possible, mainly to minimize the number of tests (in the worst case situation). Let M(d, n) denote the minimum number of tests in the worst case situation where \(|N|=n\) and d is the number of defectives. In this paper, we focus on estimating M(d, n) and obtain a better result than known ones in various cases of d and n.

在经典组测试中，给定n个项N的总体，其中N包含一些缺陷d项。分组测试（池）是对N的子集的测试。在没有错误的情况下，如果测试库中不包含有缺陷的项目，则测试为否定；如果测试池中至少有一个有缺陷的项目，则测试为肯定，但我们不知道哪一项。目的是通过使用尽可能少的测试来发现所有缺陷，主要是为了减少测试数量（在最坏的情况下）。令M（d，  n）表示最坏情况下的最小测试次数，其中\（| N | = n \）和d是次品的数量。在本文中，我们着重于估计M（d，  n）并在各种d和n情况下获得比已知方法更好的结果。