The 100 Cables (no knowledge of math required):
In a very tall building, 100 cables were placed connecting the roof to the basement. Unfortunately the people that placed them forgot to tag them, so nobody knows which end at the top leads to which end at the bottom. But, fortunately our engineers came up with a series of experiments that led to a solution. In each experiment they connected several (one or more) pairs of cables at the roof to batteries, so that each battery is connected to exactly 2 cables (one to the '+' and one to the '-'). They would then go down, and using a light bulb they would find pairs of cables that turn the light bulb on. They would mark their results (doesn't matter how), and then go up to make the next experiment. What is the minimum number of experiments that is required to know exactly which cable end at the roof leads to which cable end at the bottom? (Show how to do it, and prove that it is minimal).
Note: obviously the maximum number of pairs that can be connected in one experiment is 50, because each battery connects exactly 2 cable ends and there are 100 of these. Now imagine that the cables at the roof are R1, R2, ...R100, and that the cables at the basement are B1, B2, ...B100. If we connect cables (R1, R2) and (R3, R4) at the top, and then go down to the basement we find 2 pairs. Say that these are (B1, B2) and (B3, B4). Notice that in this case all the following assignments are valid: (R1->B1, R2->B2, R3->B3, R4->B4) (R1->B2, R2->B1, R3->B3, R4->B4) (R1->B3, R2->B4, R3->B1, R4->B2) and so on (5 more options).
In a very tall building, 100 cables were placed connecting the roof to the basement. Unfortunately the people that placed them forgot to tag them, so nobody knows which end at the top leads to which end at the bottom. But, fortunately our engineers came up with a series of experiments that led to a solution. In each experiment they connected several (one or more) pairs of cables at the roof to batteries, so that each battery is connected to exactly 2 cables (one to the '+' and one to the '-'). They would then go down, and using a light bulb they would find pairs of cables that turn the light bulb on. They would mark their results (doesn't matter how), and then go up to make the next experiment. What is the minimum number of experiments that is required to know exactly which cable end at the roof leads to which cable end at the bottom? (Show how to do it, and prove that it is minimal).
Note: obviously the maximum number of pairs that can be connected in one experiment is 50, because each battery connects exactly 2 cable ends and there are 100 of these. Now imagine that the cables at the roof are R1, R2, ...R100, and that the cables at the basement are B1, B2, ...B100. If we connect cables (R1, R2) and (R3, R4) at the top, and then go down to the basement we find 2 pairs. Say that these are (B1, B2) and (B3, B4). Notice that in this case all the following assignments are valid: (R1->B1, R2->B2, R3->B3, R4->B4) (R1->B2, R2->B1, R3->B3, R4->B4) (R1->B3, R2->B4, R3->B1, R4->B2) and so on (5 more options).