olymmath

CMO 1994 Problem 3

  • Paper

2525 men sit around a circular table. Every hour there is a vote, and each must respond yesor no. Each man behaves as follows: on the nthn^{\text{th}} , vote if his response is the same as the response of at least one of the two people he sits between, then he will respond the same way on the (n+1)th(n+1)^{\text{th}} vote as on the nthn^{\text{th}} vote; but if his response is different from that of both his neighbours on the nthn^{\text{th}} vote, then his response on the (n+1)th(n+1)^{\text{th}} vote will be different from his response on the nthn^{\text{th}} vote. Prove that, however everybody responded on the first vote, there will be a time after which nobody's response will ever change.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator ca-cmo/1994/p3 · Tag ZMM5977Z5F · Edit this page on GitHub · Keys: j next, k previous