2018 IMO Problem 4

  • 公開日時: 2018/07/11 23:26
  • 閲覧数: 128
  • コメント数: 0
  • カテゴリ: 入試・教育

このコンテンツをご覧いただくためにはJavaScriptをONにし、最新のFlash Playerが必要です。

最新のFlash Playerのインストールはこちら

公序良俗に反する不適切な投稿を発見された方はこちらよりご報告ください

この投稿にフォローする

コメントをつけるにはログインが必要です。

コメントはまだありません。

A "site" is any point $(x, y)$ in the plane such that $x$ and $y$ are both positive integers less than or equal to 20. Initially, each of the 400 sites is unoccupied. Amy and Ben take turns placing stones with Amy going first. On her turn, Amy places a new red stone on an unoccupied site such that the distance between any two sites occupied by red stones is not equal to $\sqrt{5}$. On his turn, Ben places a new blue stone on any unoccupied site. (A site occupied by a blue stone is allowed to be at any distance from any other occupied site.) They stop as soon as a player cannot place a stone. Find the greatest $K$ such that Amy can ensure that she places at least $K$ red stones, no matter how Ben places his blue stones.