In: Advanced Math
we are given n chips which may be working or defective. A working chip behaves as follows: if we connect it to another chip, the original chip will correctly output whether the new connected chip is working or is defective. However, if we connect a defective chip to another chip, it may output any arbitrary answer (defective---->might say the other one is working /defective).
In the class, we saw that if strictly more than half the chips are working, then there is an algorithm that finds a working chip using O(n) tests.
1) Prove that even when we only have a single working chip and a single defective chip (i.e.,n = 2), there is no algorithm that can find the working chip in general.