ON NONADAPTIVE SEARCH PROBLEM

We consider nonadaptive search problem for an unknown element x from the set A = {1, 2, 3, . . . , 2}, n ≥ 3. For fixed integer S the questions are of the form: Does x belong to a subset B of A, where the sum of the elements of B is equal to S? We wish to find all integers S for which nonadaptive search with n questions finds x. We continue our investigation from [4] and solve the last remaining case n = 2, k ≥ 2.