HMMT 二月 2011 · ALGCOMB 赛 · 第 18 题
HMMT February 2011 — ALGCOMB Round — Problem 18
题目详情
英文原题
- Let n be an odd positive integer, and suppose that n people sit on a committee that is in the processof electing a president. The members sit in a circle, and every member votes for the person either tohis/her immediate left, or to his/her immediate right. If one member wins more votes than all the other members do, he/she will be declared to be the president; otherwise, one of the the members whowon at least as many votes as all the other members did will be randomly selected to be the president.
If Hermia and Lysander are two members of the committee, with Hermia sitting to Lysander’s leftand Lysander planning to vote for Hermia, determine the probability that Hermia is elected president,
assuming that the other n − 1 members vote randomly.
√
2 2
解析
英文解析
- Let n be an odd positive integer, and suppose that n people sit on a committee that is in the processof electing a president. The members sit in a circle, and every member votes for the person either tohis/her immediate left, or to his/her immediate right. If one member wins more votes than all the other members do, he/she will be declared to be the president; otherwise, one of the the members whowon at least as many votes as all the other members did will be randomly selected to be the president.
If Hermia and Lysander are two members of the committee, with Hermia sitting to Lysander’s leftand Lysander planning to vote for Hermia, determine the probability that Hermia is elected president,
assuming that the other n − 1 members vote randomly.
2 − 1 n
Answer: Let x be the probability Hermia is elected if Lysander votes for her, and let y be then − 1
n 2
probability that she wins if Lysander does not vote for her. We are trying to find x , and do so by firstfinding y . If Lysander votes for Hermia with probability then the probability that Hermia is elected 1
y 2
x 1
chairman is + , but it is also by symmetry. If Lysander does not vote for Hermia, Hermia can
2 2 nget at most 1 vote, and then can only be elected if everyone gets one vote and she wins the tiebreaker.
The probability she wins the tiebreaker is , and chasing around the circle, the probability that every 1
1 nperson gets 1 vote is . (Everyone votes for the person to the left, or everyone votes for the personn − 1
to the right.) Hence 2
y = .1
n − 1
n 2
x 1 1
Then + = , so solving for x givesn
2 n 2 nn
2 − 1
x = .
n − 1
n 2
√
2 2