This shows you the differences between two versions of the page.
pow:problem1f21 [2021/09/13 02:42] mazur created |
pow:problem1f21 [2021/10/03 12:23] (current) mazur |
||
---|---|---|---|
Line 1: | Line 1: | ||
+ | <box 80% round orange| Problem 1 (due Monday, September 13)> | ||
+ | In a certain village there are 333 voters. Each voter belongs to one of two | ||
+ | parties: knights or knaves. Knaves sometimes lie and sometimes | ||
+ | tell the truth, while knights always tell the truth. Every voter knows | ||
+ | the | ||
+ | party affiliation of all voters and there are more knights than knaves. | ||
+ | You, the mathematician, arrive to the village with the task to meet a knight. | ||
+ | You can ask each voter the following question about | ||
+ | any voter: is she/he a knight? Find a knight by asking as few | ||
+ | questions as you can. | ||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | </box> | ||
+ | Only two solutions were received: one containing a partial solution with some useful observations and | ||
+ | one complete with the most efficient method we know (we do not know if a better procedure is possible). | ||
+ | For details see the following link {{:pow:2021fproblem1.pdf|Solution}}. |