POW #3The King Arthur ProblemOnce upon a time,there were 19 (not 12) knights seated around King Arthur’s round table,numbered surprisingly enough 1 through 19.The king decided to use this method for choosing the one knight who would get to marry hi

POW #3The King Arthur ProblemOnce upon a time,there were 19 (not 12) knights seated around King Arthur’s round table,numbered surprisingly enough 1 through 19.The king decided to use this method for choosing the one knight who would get to marry hi
POW #3
The King Arthur Problem
Once upon a time,there were 19 (not 12) knights seated around King Arthur’s round table,numbered surprisingly enough 1 through 19.The king decided to use this method for choosing the one knight who would get to marry his beautiful (or handsome son if a knightess)
• Start with 1,he eliminated every second knight in order until only one knight remained.
• Thus,for 19 knights,he eliminated 2,4,6,8,10,12,14,16,18,1,5,9,13,17,3,11,19,and 15.The remaining knight was number7.
The king decided to use the same method to determine the best mathematician in the realm.He called together 100 of the best thinkers and told them to sit at a circular table with 100 numbered seats.Of course YOU are one of these brilliant mathematicians.
Which seat should you choose to be selected the best mathematic in the realm?
Which seat should you choose if there are 500 seats?
Which seat should you choose if there are 1,000 seats?

POW #3The King Arthur ProblemOnce upon a time,there were 19 (not 12) knights seated around King Arthur’s round table,numbered surprisingly enough 1 through 19.The king decided to use this method for choosing the one knight who would get to marry hi
若有2的n次幂个人,则剩下的为1号.找规律可得,如果有2的n次幂加上m个人,则剩下1+2m号人.故若有100人,剩第1+36*2=73号.依此类推,500人剩489号,1000人剩977号.