Thank you very much!
I think the most hard part of this problem is problem b.
For problem b, if I devide n chips into two parts: n-n/2, and n/2, it
is easy to prove that at least one of the two parts will satisfy the
condition that more than half of the chips are good, so if I can find
out
Here is the description of this problem:
Professor Diogenes has n supposedly identical VLSI[1] chips that in
principle are capable of
testing each other. The professor's test jig accommodates two chips at
a time. When the jig is
loaded,
