Problem #PRU-88184

Problems Discrete Mathematics Algorithm Theory Theory of algorithms (other)

Problem

Cowboy Joe was sentenced to death in an electric chair. He knows that out of two electric chairs standing in a special cell, one is defective. In addition, Joe knows that if he sits on this faulty chair, the penalty will not be repeated and he will be pardoned. He also knows that the guard guarding the chairs on every other day tells the truth to every question and on the alternate days he answers incorrectly to every question. The sentenced person is allowed to ask the guard exactly one question, after which it is necessary to choose which electric chair to sit on. What question can Joe ask the guard to find out for sure which chair is faulty?