|
|
| (10 intermediate revisions by the same user not shown) |
| Line 1: |
Line 1: |
| − | Do not post these problems until after March 21 and March 22, 2023.
| + | The 14th USAJMO was held on March 22 and March 23, 2023. The first link will contain the full set of test problems. The rest will contain each individual problem and its solution. |
| − | ==Day 1==
| |
| | | | |
| − | ==Problem 1==
| + | [[2023 USAJMO Problems]] |
| − | ==Problem 2==
| + | * [[2023 USAJMO Problems/Problem 1]] |
| − | ==Problem 3==
| + | * [[2023 USAJMO Problems/Problem 2]] |
| − | (Holden Mui) Consider an <math>n</math>-by-<math>n</math> board of unit squares for some odd positive integer <math>n</math>. We say that a collection <math>C</math> of identical dominoes is a maximal grid-aligned configuration on the board if <math>C</math> consists of <math>(n^2-1)/2</math> dominoes where each domino covers exactly two neighboring squares and the dominoes don't overlap: <math>C</math> then covers all but one square on the board. We are allowed to slide (but not rotate) a domino on the board to cover the uncovered square, resulting in a new maximal grid-aligned configuration with another square uncovered. Let <math>k(C)</math> be the number of distinct maximal grid-aligned configurations obtainable from <math>C</math> by repeatedly sliding dominoes. Find the maximum value of <math>k(C)</math> as a function of <math>n</math>.
| + | * [[2023 USAJMO Problems/Problem 3]] |
| | + | * [[2023 USAJMO Problems/Problem 4]] |
| | + | * [[2023 USAJMO Problems/Problem 5]] |
| | + | * [[2023 USAJMO Problems/Problem 6]] |
| | | | |
| − | ==Day 2== | + | == See Also == |
| | + | * [[Mathematics competitions]] |
| | + | * [[Mathematics competition resources]] |
| | + | * [[Math books]] |
| | + | * [[USAJMO]] |
| | | | |
| − | ==Problem 4== | + | {{USAJMO newbox|year= 2023 |before=[[2022 USAJMO]]|after=[[2024 USAJMO]]}} |
| − | (David Torres) Two players, <math>B</math> and <math>R</math>, play the following game on an infinite grid of unit squares, all initially colored white. The players take turns starting with <math>B</math>. On <math>B</math>'s turn, <math>B</math> selects one white unit square and colors it blue. On <math>R</math>'s turn, <math>R</math> selects two white unit squares and colors them red. The players alternate until <math>B</math> decides to end the game. At this point, <math>B</math> gets a score, given by the number of unit squares in the largest (in terms of area) simple polygon containing only blue unit squares. What is the largest score <math>B</math> can guarantee?
| |
| − | | |
| − | (A simple polygon is a polygon (not necessarily convex) that does not intersect itself and has no holes.
| |
| − | | |
| − | ==Problem 5==
| |
| − | A positive integer <math>a</math> is selected, and some positive integers are written on a board. Alice and Bob play the following game. On Alice's turn, she must replace some integer <math>n</math> on the board with <math>n+a</math>, and on Bob's turn he must replace some even integer <math>n</math> on the board with <math>n/2</math>. Alice goes first and they alternate turns. If on his turn Bob has no valid moves, the game ends.
| |
| − | | |
| − | After analyzing the integers on the board, Bob realizes that, regardless of what moves Alice makes, he will be able to force the game to end eventually. Show that, in fact, for this value of <math>a</math> and these integers on the board, the game is guaranteed to end regardless of Alice's or Bob's moves.
| |
| − | | |
| − | ==Problem 6==
| |
