source
stringclasses
1 value
problem
stringlengths
115
4.91k
solution
stringlengths
453
7.23k
messages
listlengths
2
2
aops_forum
Black and white coins are placed on some of the squares of a $418\times 418$ grid. All black coins that are in the same row as any white coin(s) are removed. After that, all white coins that are in the same column as any black coin(s) are removed. If $b$ is the number of black coins remaining and $w$ is the nu...
1. **Initial Setup**: Consider a $418 \times 418$ grid. We need to place black and white coins on this grid such that after removing coins according to the given rules, the product of the number of remaining black coins ($b$) and the number of remaining white coins ($w$) is maximized. 2. **First Removal Step**: All bl...
[ { "content": "Black and white coins are placed on some of the squares of a $418\\times 418$ grid. All black coins that are in the same row as any white coin(s) are removed. After that, all white coins that are in the same column as any black coin(s) are removed. If $b$ is the number of black coins remain...
aops_forum
$A$ and $B$ are two opposite vertices of an $n \times n$ board. Within each small square of the board, the diagonal parallel to $AB$ is drawn, so that the board is divided in $2n^{2}$ equal triangles. A coin moves from $A$ to $B$ along the grid, and for every segment of the grid that it visits, a seed is ...
1. **Restate the Problem in Terms of Graph Theory:** Consider a coordinate grid such that \( A \equiv (n, 0) \), \( B \equiv (0, n) \), and the other two corners of the board are \( (0, 0) \) and \( (n, n) \). The problem can be restated as follows: - Color some of the sides of the triangles such that: 1. In...
[ { "content": " $A$ and $B$ are two opposite vertices of an $n \\times n$ board. Within each small square of the board, the diagonal parallel to $AB$ is drawn, so that the board is divided in $2n^{2}$ equal triangles. A coin moves from $A$ to $B$ along the grid, and for every segment of the grid tha...
aops_forum
**p1.** Suppose that $a \oplus b = ab - a - b$ . Find the value of $$ ((1 \oplus 2) \oplus (3 \oplus 4)) \oplus 5. $$ **p2.** Neethin scores a $59$ on his number theory test. He proceeds to score a $17$ , $23$ , and $34$ on the next three tests. What score must he achieve on his next test to earn an overall a...
To solve the given problem, we will use the Cauchy-Schwarz inequality. The Cauchy-Schwarz inequality states that for any real numbers \(x_1, x_2, \ldots, x_n\) and \(y_1, y_2, \ldots, y_n\), \[ \left( \sum_{i=1}^{n} x_i y_i \right)^2 \leq \left( \sum_{i=1}^{n} x_i^2 \right) \left( \sum_{i=1}^{n} y_i^2 \right) \] Equa...
[ { "content": "**p1.** Suppose that $a \\oplus b = ab - a - b$ . Find the value of $$ ((1 \\oplus 2) \\oplus (3 \\oplus 4)) \\oplus 5. $$ **p2.** Neethin scores a $59$ on his number theory test. He proceeds to score a $17$ , $23$ , and $34$ on the next three tests. What score must he achieve on his nex...
aops_forum
A plane rectangular grid is given and a “rational point” is defined as a point $(x, y)$ where $x$ and $y$ are both rational numbers. Let $A,B,A',B'$ be four distinct rational points. Let $P$ be a point such that $\frac{A'B'}{AB}=\frac{B'P}{BP} = \frac{PA'}{PA}.$ In other words, the triangles $ABP, A'B'P$ ...
1. **Given Information and Definitions:** - We have four distinct rational points \( A, B, A', B' \) on a plane rectangular grid. - A rational point is defined as a point \((x, y)\) where both \(x\) and \(y\) are rational numbers. - We need to prove that point \(P\) is generally a rational point and identify a...
[ { "content": "A plane rectangular grid is given and a “rational point” is defined as a point $(x, y)$ where $x$ and $y$ are both rational numbers. Let $A,B,A',B'$ be four distinct rational points. Let $P$ be a point such that $\\frac{A'B'}{AB}=\\frac{B'P}{BP} = \\frac{PA'}{PA}.$ In other words, the ...
aops_forum
A bear is in the center of the left down corner of a $100*100$ square .we call a cycle in this grid a bear cycle if it visits each square exactly ones and gets back to the place it started.Removing a row or column with compose the bear cycle into number of pathes.Find the minimum $k$ so that in any bear cycle we ca...
1. **Understanding the Problem:** - We have a $100 \times 100$ grid. - A bear cycle is a path that visits each square exactly once and returns to the starting point. - We need to find the minimum $k$ such that removing any row or column from the grid results in the maximum length of the remaining paths being a...
[ { "content": "A bear is in the center of the left down corner of a $100*100$ square .we call a cycle in this grid a bear cycle if it visits each square exactly ones and gets back to the place it started.Removing a row or column with compose the bear cycle into number of pathes.Find the minimum $k$ so that i...
aops_forum
We have sheet of paper, divided on $100\times 100$ unit squares. In some squares we put rightangled isosceles triangles with leg = $1$ ( Every triangle lies in one unit square and is half of this square). Every unit grid segment( boundary too) is under one leg of triangle. Find maximal number of unit squares, that...
1. **Upper Bound Calculation:** - Each triangle covers one vertical and one horizontal segment. - There are 101 vertical segments in each row (including boundaries). - In the top row, there are 100 horizontal segments above it that must be covered by triangles in this row. - Therefore, 100 of the top row's ...
[ { "content": "We have sheet of paper, divided on $100\\times 100$ unit squares. In some squares we put rightangled isosceles triangles with leg = $1$ ( Every triangle lies in one unit square and is half of this square). Every unit grid segment( boundary too) is under one leg of triangle. Find maximal numbe...
aops_forum
Consider the $5$ by $5$ by $5$ equilateral triangular grid as shown: [asy] size(5cm); real n = 5; for (int i = 0; i < n; ++i) { draw((0.5*i,0.866*i)--(n-0.5*i,0.866*i)); } for (int i = 0; i < n; ++i) { draw((n-i,0)--((n-i)/2,(n-i)*0.866)); }...
1. **Total Number of Upward-Oriented Equilateral Triangles:** - The grid is a 5 by 5 by 5 equilateral triangular grid. - The number of upward-oriented equilateral triangles in such a grid can be calculated by summing the number of triangles of each possible size. - For a grid of side length \( n \), the number...
[ { "content": "Consider the $5$ by $5$ by $5$ equilateral triangular grid as shown:\n\n[asy]\n size(5cm);\n real n = 5;\n for (int i = 0; i < n; ++i) {\n draw((0.5*i,0.866*i)--(n-0.5*i,0.866*i));\n }\n for (int i = 0; i < n; ++i) {\n draw((n-i,0)--((...
aops_forum
In an $n$ -by- $m$ grid, $1$ row and $1$ column are colored blue, the rest of the cells are white. If precisely $\frac{1}{2010}$ of the cells in the grid are blue, how many values are possible for the ordered pair $(n,m)$
1. Let \( n \) be the number of rows and \( m \) be the number of columns in the grid. The total number of cells in the grid is \( mn \). 2. Since one row and one column are colored blue, the total number of blue cells is \( m + n - 1 \) (since the intersection cell is counted twice). 3. Given that the fraction of blue...
[ { "content": "In an $n$ -by- $m$ grid, $1$ row and $1$ column are colored blue, the rest of the cells are white. If precisely $\\frac{1}{2010}$ of the cells in the grid are blue, how many values are possible for the ordered pair $(n,m)$ ", "role": "user" }, { "content": "1. Let \\( n \\) be...
aops_forum
Find all pairs of positive integers \((a,b)\) with the following property: there exists an integer \(N\) such that for any integers \(m\ge N\) and \(n\ge N\), every \(m\times n\) grid of unit squares may be partitioned into \(a\times b\) rectangles and fewer than \(ab\) unit squares. *Proposed by Holden Mui*
To find all pairs of positive integers \((a, b)\) such that there exists an integer \(N\) with the property that for any integers \(m \ge N\) and \(n \ge N\), every \(m \times n\) grid of unit squares can be partitioned into \(a \times b\) rectangles and fewer than \(ab\) unit squares, we need to analyze the possible v...
[ { "content": "Find all pairs of positive integers \\((a,b)\\) with the following property: there exists an integer \\(N\\) such that for any integers \\(m\\ge N\\) and \\(n\\ge N\\), every \\(m\\times n\\) grid of unit squares may be partitioned into \\(a\\times b\\) rectangles and fewer than \\(ab\\) unit squ...
aops_forum
Every cell of a $2017\times 2017$ grid is colored either black or white, such that every cell has at least one side in common with another cell of the same color. Let $V_1$ be the set of all black cells, $V_2$ be the set of all white cells. For set $V_i (i=1,2)$ , if two cells share a common side, draw an edge w...
1. **Base Case and Induction Setup:** - We start by considering the base case where \( n = 1 \). In this case, the grid is a single cell, and the problem is trivial since the center is the only cell and thus an endpoint. - We will use induction on \( n \), where \( n \) is an odd integer. Assume the statement is ...
[ { "content": "Every cell of a $2017\\times 2017$ grid is colored either black or white, such that every cell has at least one side in common with another cell of the same color. Let $V_1$ be the set of all black cells, $V_2$ be the set of all white cells. For set $V_i (i=1,2)$ , if two cells share a comm...
aops_forum
Given is a positive integer $n$ . There are $2n$ mutually non-attacking rooks placed on a grid $2n \times 2n$ . The grid is splitted into two connected parts, symmetric with respect to the center of the grid. What is the largest number of rooks that could lie in the same part?
1. **Understanding the Problem:** We are given a $2n \times 2n$ grid with $2n$ mutually non-attacking rooks. The grid is split into two connected parts, symmetric with respect to the center. We need to determine the largest number of rooks that can lie in the same part. 2. **Constructing an Example:** To show th...
[ { "content": "Given is a positive integer $n$ . There are $2n$ mutually non-attacking rooks placed on a grid $2n \\times 2n$ . The grid is splitted into two connected parts, symmetric with respect to the center of the grid. What is the largest number of rooks that could lie in the same part?", "role": "...
aops_forum
Alzim and Badril are playing a game on a hexagonal lattice grid with 37 points (4 points a side), all of them uncolored. On his turn, Alzim colors one uncolored point with the color red, and Badril colors **two** uncolored points with the color blue. The game ends either when there is an equilateral triangle whose vert...
1. **Initial Setup and Strategy**: - Consider the hexagonal lattice grid with 37 points. - Denote the hexagons as \( H_1 \) (small), \( H_2 \) (medium), and \( H_3 \) (large). - Alzim starts by coloring the center of \( H_3 \) red. 2. **Case 1: Badril Colors Two Vertices of \( H_1 \)**: - Badril colors two...
[ { "content": "Alzim and Badril are playing a game on a hexagonal lattice grid with 37 points (4 points a side), all of them uncolored. On his turn, Alzim colors one uncolored point with the color red, and Badril colors **two** uncolored points with the color blue. The game ends either when there is an equilater...
aops_forum
Consider lattice points of a $6*7$ grid.We start with two points $A,B$ .We say two points $X,Y$ connected if one can reflect several times WRT points $A,B$ and reach from $X$ to $Y$ .Over all choices of $A,B$ what is the minimum number of connected components?
1. **Define the Problem and Graph Representation:** We are given a $6 \times 7$ grid of lattice points, and we need to determine the minimum number of connected components when considering reflections with respect to two points $A$ and $B$. We represent the grid as a graph where each vertex corresponds to a lattice ...
[ { "content": "Consider lattice points of a $6*7$ grid.We start with two points $A,B$ .We say two points $X,Y$ connected if one can reflect several times WRT points $A,B$ and reach from $X$ to $Y$ .Over all choices of $A,B$ what is the minimum number of connected components?", "role": "user" },...
aops_forum
On a $5 \times 5$ grid we randomly place two \emph{cars}, which each occupy a single cell and randomly face in one of the four cardinal directions. It is given that the two cars do not start in the same cell. In a \emph{move}, one chooses a car and shifts it one cell forward. The probability that there exists a seque...
1. **Define the problem setup:** - We have a $5 \times 5$ grid. - Two cars are placed randomly on the grid, each occupying a single cell and facing one of the four cardinal directions (north, south, east, west). - The cars do not start in the same cell. - We need to find the probability that there exists a ...
[ { "content": "On a $5 \\times 5$ grid we randomly place two \\emph{cars}, which each occupy a single cell and randomly face in one of the four cardinal directions. It is given that the two cars do not start in the same cell. In a \\emph{move}, one chooses a car and shifts it one cell forward. The probability ...
aops_forum
Given an integer $n>1$ and a $n\times n$ grid $ABCD$ containing $n^2$ unit squares, each unit square is colored by one of three colors: Black, white and gray. A coloring is called *symmetry* if each unit square has center on diagonal $AC$ is colored by gray and every couple of unit squares which are symmetry ...
Let's break down the problem into detailed steps to find the minimum value of \( k \) for \( n = 5 \). ### Step 1: Understanding the Grid and Symmetry The grid is a \( 5 \times 5 \) matrix with the diagonal \( AC \) (from top-left to bottom-right) containing gray squares. The symmetry condition requires that each pair...
[ { "content": "Given an integer $n>1$ and a $n\\times n$ grid $ABCD$ containing $n^2$ unit squares, each unit square is colored by one of three colors: Black, white and gray. A coloring is called *symmetry* if each unit square has center on diagonal $AC$ is colored by gray and every couple of unit squa...
aops_forum
nic $\kappa$ y is drawing kappas in the cells of a square grid. However, he does not want to draw kappas in three consecutive cells (horizontally, vertically, or diagonally). Find all real numbers $d>0$ such that for every positive integer $n,$ nic $\kappa$ y can label at least $dn^2$ cells of an $n\times n$ sq...
1. **Understanding the Problem:** We need to find all real numbers \( d > 0 \) such that for every positive integer \( n \), we can label at least \( dn^2 \) cells of an \( n \times n \) square grid with kappas, under the constraint that no three consecutive cells (horizontally, vertically, or diagonally) contain ka...
[ { "content": "nic $\\kappa$ y is drawing kappas in the cells of a square grid. However, he does not want to draw kappas in three consecutive cells (horizontally, vertically, or diagonally). Find all real numbers $d>0$ such that for every positive integer $n,$ nic $\\kappa$ y can label at least $dn^2$ cell...
aops_forum
How many different sets of three points in this equilateral triangular grid are the vertices of an equilateral triangle? Justify your answer. [center]![Image](http://i.imgur.com/S6RXkYY.png)[/center]
To determine the number of different sets of three points in an equilateral triangular grid that form the vertices of an equilateral triangle, we can use a combinatorial approach. The formula provided in the solution is: \[ \sum_{k=1}^n k \left( \frac{(n+1-k)(n+2-k)}{2} \right) \] This formula can be simplified to: ...
[ { "content": "How many different sets of three points in this equilateral triangular grid are the vertices of an equilateral triangle? Justify your answer.\n\n[center]![Image](http://i.imgur.com/S6RXkYY.png)[/center]", "role": "user" }, { "content": "To determine the number of different sets of thre...
aops_forum
Let us have an infinite grid of unit squares. We write in every unit square a real number, such that the absolute value of the sum of the numbers from any $n*n$ square is less or equal than $1$ . Prove that the absolute value of the sum of the numbers from any $m*n$ rectangular is less or equal than $4$ .
1. **Understanding the Problem:** We are given an infinite grid of unit squares, each containing a real number. The absolute value of the sum of the numbers in any \( n \times n \) square is at most 1. We need to prove that the absolute value of the sum of the numbers in any \( m \times n \) rectangle is at most 4. ...
[ { "content": "Let us have an infinite grid of unit squares. We write in every unit square a real number, such that the absolute value of the sum of the numbers from any $n*n$ square is less or equal than $1$ . Prove that the absolute value of the sum of the numbers from any $m*n$ rectangular is less or equ...
aops_forum
A $5\times5$ grid of squares is filled with integers. Call a rectangle *corner-odd* if its sides are grid lines and the sum of the integers in its four corners is an odd number. What is the maximum possible number of corner-odd rectangles within the grid? Note: A rectangles must have four distinct corners to be cons...
1. **Understanding the Problem:** We need to find the maximum number of corner-odd rectangles in a $5 \times 5$ grid. A rectangle is corner-odd if the sum of the integers at its four corners is odd. 2. **Analyzing the Grid:** Consider a $5 \times 5$ grid. Each cell can contain either an odd or an even integer. F...
[ { "content": "A $5\\times5$ grid of squares is filled with integers. Call a rectangle *corner-odd* if its sides are grid lines and the sum of the integers in its four corners is an odd number. What is the maximum possible number of corner-odd rectangles within the grid?\n\nNote: A rectangles must have four di...
aops_forum
Write an integer between $1$ and $9$ in each square of the $5 \times 7$ grid as shown in the figure below. [asy] import math; size(200); add(shift(0, 0)*grid(7, 5)); [/asy] Find the maximum possible value of the sum of the $35$ numbers written when writing different numbers for any two squares that share a ver...
1. **Understanding the Problem:** We need to fill a \(5 \times 7\) grid with integers between 1 and 9 such that no two squares sharing a vertex have the same number. We aim to maximize the sum of these numbers. 2. **Constraints:** - Each number must be between 1 and 9. - No two adjacent squares (sharing a ver...
[ { "content": "Write an integer between $1$ and $9$ in each square of the $5 \\times 7$ grid as shown in the figure below.\n[asy]\nimport math;\nsize(200);\n\nadd(shift(0, 0)*grid(7, 5));\n[/asy]\nFind the maximum possible value of the sum of the $35$ numbers written when writing different numbers for an...
aops_forum
Consider a $ n\times n $ square grid which is divided into $ n^2 $ unit squares(think of a chess-board). The set of all unit squares intersecting the main diagonal of the square or lying under it is called an $n$ -staircase. Find the number of ways in which an $n$ -stair case can be partitioned into several recta...
1. **Labeling the Grid:** Label the squares so that the lower-left square is \((1,1)\) and the upper-right square is \((n,n)\). The main diagonal is the diagonal from \((1,1)\) to \((n,n)\). A square \((x,y)\) belongs to the \(n\)-staircase if and only if \(1 \le x \le y \le n\). 2. **Rectangle Containment:** No...
[ { "content": "Consider a $ n\\times n $ square grid which is divided into $ n^2 $ unit squares(think of a chess-board). The set of all unit squares intersecting the main diagonal of the square or lying under it is called an $n$ -staircase. Find the number of ways in which an $n$ -stair case can be partiti...
aops_forum
Let $n$ be an even positive integer. Write the numbers $1, 2, \cdots, n^2$ in the squares of an $n \times n$ grid so that the $k$ th row, from left to right, is \[ (k-1)n + 1, \ (k-1)n + 2, \ \cdots, \ (k-1)n + n. \] Color the squares of the grid so that half of the squares in each row and in each column are red...
To prove that the sum of the numbers on the red squares is equal to the sum of the numbers on the black squares for any coloring, we can proceed as follows: 1. **Grid Setup and Numbering**: - The grid is an \( n \times n \) grid where \( n \) is an even positive integer. - The numbers \( 1, 2, \ldots, n^2 \) are...
[ { "content": "Let $n$ be an even positive integer. Write the numbers $1, 2, \\cdots, n^2$ in the squares of an $n \\times n$ grid so that the $k$ th row, from left to right, is \\[ (k-1)n + 1, \\ (k-1)n + 2, \\ \\cdots, \\ (k-1)n + n. \\] Color the squares of the grid so that half of the squares in each ...
aops_forum
In an $n \times n$ square grid, $n$ squares are marked so that every rectangle composed of exactly $n$ grid squares contains at least one marked square. Determine all possible values of $n$ .
To determine all possible values of \( n \) such that in an \( n \times n \) square grid, \( n \) squares are marked so that every rectangle composed of exactly \( n \) grid squares contains at least one marked square, we need to analyze the problem in detail. 1. **Case \( n = 1 \)**: - If \( n = 1 \), the grid is ...
[ { "content": "In an $n \\times n$ square grid, $n$ squares are marked so that every rectangle composed of exactly $n$ grid squares contains at least one marked square. Determine all possible values of $n$ .", "role": "user" }, { "content": "To determine all possible values of \\( n \\) such t...
aops_forum
Let $n$ be a positive integer. Consider an $n\times n$ grid of unit squares. How many ways are there to partition the horizontal and vertical unit segments of the grid into $n(n + 1)$ pairs so that the following properties are satisfi ed? (i) Each pair consists of a horizontal segment and a vertical segment tha...
1. **Define the Problem and Key Terms:** - We are given an \( n \times n \) grid of unit squares. - We need to partition the horizontal and vertical unit segments into \( n(n + 1) \) pairs. - Each pair consists of a horizontal segment and a vertical segment that share a common endpoint. - No segment is in m...
[ { "content": "Let $n$ be a positive integer. Consider an $n\u0002\\times n$ grid of unit squares. How many ways are there to partition the horizontal and vertical unit segments of the grid into $n(n + 1)$ pairs so that the following properties are satisfi\fed?\n\n(i) Each pair consists of a horizontal seg...
aops_forum
Robert colors each square in an empty 3 by 3 grid either red or green. Find the number of colorings such that no row or column contains more than one green square.
1. **Case 1: 0 green squares** If there are no green squares, then all squares are red. There is only one way to color the grid in this case. \[ \text{Number of ways} = 1 \] 2. **Case 2: 1 green square** We need to place one green square in the grid. We can choose any of the 3 rows and any of the 3 co...
[ { "content": "Robert colors each square in an empty 3 by 3 grid either red or green. Find the number of colorings such that no row or column contains more than one green square.", "role": "user" }, { "content": "1. **Case 1: 0 green squares**\n\n If there are no green squares, then all squares are...
aops_forum
A blue square of side length $10$ is laid on top of a coordinate grid with corners at $(0,0)$ , $(0,10)$ , $(10,0)$ , and $(10,10)$ . Red squares of side length $2$ are randomly placed on top of the grid, changing the color of a $2\times2$ square section red. Each red square when placed lies completely within...
1. **Understanding the Problem:** - We have a blue square of side length \(10\) laid on a coordinate grid with corners at \((0,0)\), \((0,10)\), \((10,0)\), and \((10,10)\). - Red squares of side length \(2\) are randomly placed on the grid, changing the color of a \(2 \times 2\) square section to red. - Each ...
[ { "content": "A blue square of side length $10$ is laid on top of a coordinate grid with corners at $(0,0)$ , $(0,10)$ , $(10,0)$ , and $(10,10)$ . Red squares of side length $2$ are randomly placed on top of the grid, changing the color of a $2\\times2$ square section red. Each red square when placed...
aops_forum
Consider the $4\times4$ array of $16$ dots, shown below. [asy] size(2cm); dot((0,0)); dot((1,0)); dot((2,0)); dot((3,0)); dot((0,1)); dot((1,1)); dot((2,1)); dot((3,1)); dot((0,2)); dot((1,2)); dot((2,2)); dot((3,2)); dot((0,3)); dot((1,3)); dot((2,3)); dot((3,3)); [/asy] Counting the number of squares whose vert...
To solve this problem, we need to ensure that each of the 14 squares (nine \(1 \times 1\) squares, four \(2 \times 2\) squares, and one \(3 \times 3\) square) is missing at least one vertex by deleting the minimum number of dots. 1. **Identify the vertices of each square:** - There are 16 dots arranged in a \(4 \t...
[ { "content": "Consider the $4\\times4$ array of $16$ dots, shown below.\n\n[asy]\nsize(2cm);\ndot((0,0));\ndot((1,0));\ndot((2,0));\ndot((3,0));\ndot((0,1));\ndot((1,1));\ndot((2,1));\ndot((3,1));\ndot((0,2));\ndot((1,2));\ndot((2,2));\ndot((3,2));\ndot((0,3));\ndot((1,3));\ndot((2,3));\ndot((3,3));\n[/asy]...
aops_forum
In a $4\times 4$ grid of unit squares, five squares are chosen at random. The probability that no two chosen squares share a side is $\tfrac mn$ for positive relatively prime integers $m$ and $n$ . Find $m+n$ . *Proposed by David Altizio*
To solve this problem, we need to calculate the probability that no two chosen squares in a \(4 \times 4\) grid share a side. We will use combinatorial methods and casework to find the number of valid configurations and then divide by the total number of ways to choose 5 squares from 16. 1. **Total number of ways to c...
[ { "content": "In a $4\\times 4$ grid of unit squares, five squares are chosen at random. The probability that no two chosen squares share a side is $\\tfrac mn$ for positive relatively prime integers $m$ and $n$ . Find $m+n$ .\n\n*Proposed by David Altizio*", "role": "user" }, { "content":...
aops_forum
Treasure was buried in a single cell of an $M\times N$ ( $2\le M$ , $N$ ) grid. Detectors were brought to find the cell with the treasure. For each detector, you can set it up to scan a specific subgrid $[a,b]\times[c,d]$ with $1\le a\le b\le M$ and $1\le c\le d\le N$ . Running the detector will tell you whethe...
** - We need to ensure that each cell in the grid is uniquely identified by the set of detectors. - We can achieve this by setting up detectors to scan specific rows and columns. 4. **Vertical Detectors:** - We set up detectors to scan vertical strips of the grid. - For \( 1 \leq k \leq \lceil \frac{m}{2} ...
[ { "content": "Treasure was buried in a single cell of an $M\\times N$ ( $2\\le M$ , $N$ ) grid. Detectors were brought to find the cell with the treasure. For each detector, you can set it up to scan a specific subgrid $[a,b]\\times[c,d]$ with $1\\le a\\le b\\le M$ and $1\\le c\\le d\\le N$ . Running th...
aops_forum
Robert tiles a $420 \times 420$ square grid completely with $1 \times 2$ blocks, then notices that the two diagonals of the grid pass through a total of $n$ blocks. Find the sum of all possible values of $n$ .
1. **Understanding the Problem:** - We have a $420 \times 420$ square grid. - The grid is tiled completely with $1 \times 2$ blocks. - We need to find the total number of blocks that the two diagonals of the grid pass through. 2. **Analyzing the Diagonals:** - Each diagonal of a $420 \times 420$ grid passe...
[ { "content": "Robert tiles a $420 \\times 420$ square grid completely with $1 \\times 2$ blocks, then notices that the two diagonals of the grid pass through a total of $n$ blocks. Find the sum of all possible values of $n$ .", "role": "user" }, { "content": "1. **Understanding the Problem:**...
aops_forum
Consider a $9 \times 9$ grid of squares. Haruki fills each square in this grid with an integer between 1 and 9, inclusive. The grid is called a $\textit{super-sudoku}$ if each of the following three conditions hold: - Each column in the grid contains each of the numbers $1, 2, 3, 4, 5, 6, 7, 8, 9$ exactly onc...
1. **Assume the bottom left \(3 \times 3\) subsquare is filled as follows:** \[ \begin{array}{ccc} 7 & 8 & 9 \\ 4 & 5 & 6 \\ 1 & 2 & 3 \\ \end{array} \] We will use a coordinate system where the bottom left square is \((0,0)\). 2. **Consider the placement of the number 1 in the grid:** - Sin...
[ { "content": "Consider a $9 \\times 9$ grid of squares. Haruki fills each square in this grid with an integer between 1 and 9, inclusive. The grid is called a $\\textit{super-sudoku}$ if each of the following three conditions hold:\n\n\n\n- Each column in the grid contains each of the numbers $1, 2, 3, 4,...
aops_forum
The sides of an equilateral triangle with sides of length $n$ have been divided into equal parts, each of length $1$ , and lines have been drawn through the points of division parallel to the sides of the triangle, thus dividing the large triangle into many small triangles. Nils has a pile of rhombic tiles, each of ...
1. **Understanding the Problem:** - We have an equilateral triangle with side length \( n \). - The triangle is divided into smaller equilateral triangles of side length 1. - We need to tile the large triangle using rhombic tiles, each of which covers two small triangles. - We aim to determine the maximum n...
[ { "content": "The sides of an equilateral triangle with sides of length $n$ have been divided into equal parts, each of length $1$ , and lines have been drawn through the points of division parallel to the sides of the triangle, thus dividing the large triangle into many small triangles. Nils has a pile of r...
aops_forum
**p1.** Ten math students take a test, and the average score on the test is $28$ . If five students had an average of $15$ , what was the average of the other five students' scores?**p2.** If $a\otimes b = a^2 + b^2 + 2ab$ , find $(-5\otimes 7) \otimes 4$ .**p3.** Below is a $3 \times 4$ grid. Fill each square wi...
To solve this problem, we need to find the length of \(AX\) in the given geometric configuration involving two externally tangent circles. 1. **Identify the given elements and their relationships:** - Let \(C\) be the center of the smaller circle with radius \(13\). - Let \(D\) be the center of the larger circle...
[ { "content": "**p1.** Ten math students take a test, and the average score on the test is $28$ . If five students had an average of $15$ , what was the average of the other five students' scores?**p2.** If $a\\otimes\tb = a^2 + b^2 + 2ab$ , find $(-5\\otimes 7) \\otimes 4$ .**p3.** Below is a $3 \\times 4$...
aops_forum
Let $a$ be a fixed positive integer. For a given positive integer $n$ , consider the following assertion. In an infinite two-dimensional grid of squares, $n$ different cells are colored black. Let $K$ denote the number of $a$ by $a$ squares in the grid containing exactly $a$ black cells. Then over all pos...
1. **Define the function \( f \):** Let \( f \) be a function that maps an \( a \times a \) square to the number of black cells in that square. Specifically, if the number of black cells in the \( a \times a \) square is \( x \), then: \[ f(\text{square}) = \begin{cases} x & \text{if } x < a \\ x - ...
[ { "content": "Let $a$ be a fixed positive integer. For a given positive integer $n$ , consider the following assertion.\n\nIn an infinite two-dimensional grid of squares, $n$ different cells are colored black. Let $K$ denote the number of $a$ by $a$ squares in the grid containing exactly $a$ black ...
aops_forum
Consider a $2 \times n$ grid where each cell is either black or white, which we attempt to tile with $2 \times 1$ black or white tiles such that tiles have to match the colors of the cells they cover. We first randomly select a random positive integer $N$ where $N$ takes the value $n$ with probability $\frac...
1. **Define Variables and Probabilities:** Let \( a_n \) be the number of ways to color the squares of a \( 2 \times n \) grid such that it has a valid tiling. Let \( p_n \) be the probability that a random coloring of a \( 2 \times n \) grid has a valid tiling. We have: \[ p_n = \frac{a_n}{2^{2n}} = \left(\fr...
[ { "content": "Consider a $2 \\times n$ grid where each cell is either black or white, which we attempt to tile with $2 \\times 1$ black or white tiles such that tiles have to match the colors of the cells they cover. We first randomly select a random positive integer $N$ where $N$ takes the value $n$ ...
aops_forum
A number of robots are placed on the squares of a finite, rectangular grid of squares. A square can hold any number of robots. Every edge of each square of the grid is classified as either passable or impassable. All edges on the boundary of the grid are impassable. You can give any of the commands up, down, left, or r...
1. **Induction Basis:** - We start by considering the case of two robots, \( A \) and \( B \), on a grid of height \( m \) and width \( n \). - By the problem's assumption, there exists a finite sequence of commands that can move robot \( A \) to the position of robot \( B \). Let the length of this path be \( \e...
[ { "content": "A number of robots are placed on the squares of a finite, rectangular grid of squares. A square can hold any number of robots. Every edge of each square of the grid is classified as either passable or impassable. All edges on the boundary of the grid are impassable. You can give any of the command...
aops_forum
Consider in the plane a finite set of segments such that the sum of their lengths is less than $\sqrt{2}$ . Prove that there exists an infinite unit square grid covering the plane such that the lines defining the grid do not intersect any of the segments. *Vasile Pop*
1. **Lemma:** Given segments on the number line such that the sum of their lengths is less than $\sqrt{2}$, we can label the integers on the number line on intervals of length $1$ such that no part of a segment is labeled. **Proof of Lemma:** Assume the contrary. We set a starting point for the integer $0$, and fro...
[ { "content": "Consider in the plane a finite set of segments such that the sum of their lengths is less than $\\sqrt{2}$ . Prove that there exists an infinite unit square grid covering the plane such that the lines defining the grid do not intersect any of the segments.\n\n*Vasile Pop*", "role": "user" }...
aops_forum
A finite set $S$ of unit squares is chosen out of a large grid of unit squares. The squares of $S$ are tiled with isosceles right triangles of hypotenuse $2$ so that the triangles do not overlap each other, do not extend past $S$ , and all of $S$ is fully covered by the triangles. Additionally, the hypotenuse ...
1. **Labeling the Grid:** We start by labeling the grid with a repeating pattern of numbers from 1 to 4. Each unit square in the grid is labeled with one of these numbers in a specific pattern. This labeling helps us track the arrangement of the triangles. 2. **Splitting Each Square:** Each unit square is split ...
[ { "content": "A finite set $S$ of unit squares is chosen out of a large grid of unit squares. The squares of $S$ are tiled with isosceles right triangles of hypotenuse $2$ so that the triangles do not overlap each other, do not extend past $S$ , and all of $S$ is fully covered by the triangles. Additio...
aops_forum
A tennis net is made of strings tied up together which make a grid consisting of small congruent squares as shown below. [asy] size(500); xaxis(-50,50); yaxis(-5,5); add(shift(-50,-5)*grid(100,10));[/asy] The size of the net is $100\times 10$ small squares. What is the maximal number of edges of small squares which c...
1. **Understanding the Problem:** - The tennis net is a grid of \(100 \times 10\) small squares. - We need to find the maximum number of edges that can be cut without breaking the net into two pieces. 2. **Grid Structure:** - The grid has \(100\) columns and \(10\) rows. - Each small square has \(4\) edges...
[ { "content": "A tennis net is made of strings tied up together which make a grid consisting of small congruent squares as shown below.\n[asy]\nsize(500);\nxaxis(-50,50);\nyaxis(-5,5);\nadd(shift(-50,-5)*grid(100,10));[/asy]\nThe size of the net is $100\\times 10$ small squares. What is the maximal number of e...
aops_forum
Let $n$ be a positive integer. Let $S$ be the set of $n^2$ cells in an $n\times n$ grid. Call a subset $T$ of $S$ a **double staircase** if - $T$ can be partitioned into $n$ horizontal nonoverlapping rectangles of dimensions $1 \times 1, 1 \times 2, ..., 1 \times n,$ and - $T$ can also be partitione...
1. **Define the Problem and Initial Setup:** We are given an \( n \times n \) grid with \( n^2 \) cells. We need to determine the number of ways to form a "double staircase" in this grid. A double staircase is defined as a subset \( T \) of \( S \) (the set of all cells) that can be partitioned into \( n \) horizont...
[ { "content": "Let $n$ be a positive integer. Let $S$ be the set of $n^2$ cells in an $n\\times n$ grid. Call a subset $T$ of $S$ a **double staircase** if\n\n\n- $T$ can be partitioned into $n$ horizontal nonoverlapping rectangles of dimensions $1 \\times 1,\n1 \\times 2, ..., 1 \\times n,$ and...
aops_forum
<u>Round 9</u>**p25.** Let $S$ be the region bounded by the lines $y = x/2$ , $y = -x/2$ , and $x = 6$ . Pick a random point $P = (x, y)$ in $S$ and translate it $3$ units right to $P' = (x + 3, y)$ . What is the probability that $P'$ is in $S$ ?**p26.** A triangle with side lengths $17$ , $25$ , and ...
1. Given the equation: \[ \sqrt[3]{4x - 1} + \sqrt[3]{4x + 1} = \sqrt[3]{8x} \] we start by cubing both sides to eliminate the cube roots. 2. Cubing the left-hand side: \[ \left(\sqrt[3]{4x - 1} + \sqrt[3]{4x + 1}\right)^3 = (\sqrt[3]{4x - 1})^3 + 3(\sqrt[3]{4x - 1})^2(\sqrt[3]{4x + 1}) + 3(\sqrt[3]{...
[ { "content": "<u>Round 9</u>**p25.** Let $S$ be the region bounded by the lines $y = x/2$ , $y = -x/2$ , and $x = 6$ . Pick a random point $P = (x, y)$ in $S$ and translate it $3$ units right to $P' = (x + 3, y)$ . What is the probability that $P'$ is in $S$ ?**p26.** A triangle with side lengths...
aops_forum
Consider a triangular grid of equilateral triangles with unit sides. Assume that $\mathcal{P}$ is a non-self-intersecting polygon with perimeter 1399 and sides from the grid. Prove that $\mathcal{P}$ has either an internal or an external 120-degree angle. *Proposed by Seyed Hessam Firouzi*
1. **Assume the contrary**: Suppose that the polygon $\mathcal{P}$ does not have any internal or external 120-degree angles. 2. **Color the edges**: Color the edges of the triangular grid using three colors, say 1, 2, and 3, such that two edges sharing a vertex have the same color if and only if the angle between them...
[ { "content": "Consider a triangular grid of equilateral triangles with unit sides. Assume that $\\mathcal{P}$ is a non-self-intersecting polygon with perimeter 1399 and sides from the grid. Prove that $\\mathcal{P}$ has either an internal or an external 120-degree angle.\n\n*Proposed by Seyed Hessam Firouzi...
aops_forum
**p1.** Ana, Bob, Cho, Dan, and Eve want to use a microwave. In order to be fair, they choose a random order to heat their food in (all orders have equal probability). Ana's food needs $5$ minutes to cook, Bob's food needs $7$ minutes, Cho's needs $1$ minute, Dan's needs $12$ minutes, and Eve's needs $5$ minu...
1. To find the expected number of minutes Bob has to wait for his food to be done, we need to consider the expected waiting time for each person ahead of him in the queue. 2. Each of the other four people (Ana, Cho, Dan, and Eve) has a $\frac{1}{2}$ chance of being ahead of Bob in the queue. By the Linearity of Expec...
[ { "content": "**p1.** Ana, Bob, Cho, Dan, and Eve want to use a microwave. In order to be fair, they choose a random order to heat their food in (all orders have equal probability). Ana's food needs $5$ minutes to cook, Bob's food needs $7$ minutes, Cho's needs $1$ minute, Dan's needs $12$ minutes, and ...
aops_forum
In each square of a $6\times6$ grid there is a lightning bug on or off. One move is to choose three consecutive squares, either horizontal or vertical, and change the lightning bugs in those $3$ squares from off to on or from on to off. Show if at the beginning there is one lighting bug on and the rest of them off,...
1. **Color the Board:** We color the $6 \times 6$ grid in a repeating pattern of three colors, say 1, 2, and 3, as follows: \[ \begin{array}{cccccc} 1 & 2 & 3 & 1 & 2 & 3 \\ 2 & 3 & 1 & 2 & 3 & 1 \\ 3 & 1 & 2 & 3 & 1 & 2 \\ 1 & 2 & 3 & 1 & 2 & 3 \\ 2 & 3 & 1 & 2 & 3 & 1 \\ 3 & 1 & 2 & 3 & 1 &...
[ { "content": "In each square of a $6\\times6$ grid there is a lightning bug on or off. One move is to choose three consecutive squares, either horizontal or vertical, and change the lightning bugs in those $3$ squares from off to on or from on to off. Show if at the beginning there is one lighting bug on an...
aops_forum
**p1.** On SeaBay, green herring costs $\$ 2.50 $ per pound, blue herring costs $ \ $4.00$ per pound, and red herring costs $\$ 5,85 $ per pound. What must Farmer James pay for $ 12 $ pounds of green herring and $ 7 $ pounds of blue herring, in dollars?**p2.** A triangle has side lengths $ 3 $, $ 4 $, and $ 6 $. A s...
### Problem 1 1. Calculate the cost for 12 pounds of green herring: \[ 12 \text{ pounds} \times \$2.50 \text{ per pound} = 12 \times 2.50 = \$30.00 \] 2. Calculate the cost for 7 pounds of blue herring: \[ 7 \text{ pounds} \times \$4.00 \text{ per pound} = 7 \times 4.00 = \$28.00 \] 3. Add the costs t...
[ { "content": "**p1.** On SeaBay, green herring costs $\\$ 2.50 $ per pound, blue herring costs $ \\ $4.00$ per pound, and red herring costs $\\$ 5,85 $ per pound. What must Farmer James pay for $ 12 $ pounds of green herring and $ 7 $ pounds of blue herring, in dollars?**p2.** A triangle has side lengths $ 3...
aops_forum
In a $m\times{n}$ grid are there are token. Every token *dominates* every square on its same row ( $\leftrightarrow$ ), its same column ( $\updownarrow$ ), and diagonal ( $\searrow\hspace{-4.45mm}\nwarrow$ )(Note that the token does not \emph{dominate} the diagonal ( $\nearrow\hspace{-4.45mm}\swarrow$ ), determine t...
1. **Define the problem and assumptions:** We need to determine the minimum number of tokens required to dominate all squares on an \(m \times n\) grid. A token dominates all squares in its row, column, and one of the diagonals (\(\searrow\hspace{-4.45mm}\nwarrow\)). 2. **Identify "naughty" squares:** Let \(k\) ...
[ { "content": "In a $m\\times{n}$ grid are there are token. Every token *dominates* every square on its same row ( $\\leftrightarrow$ ), its same column ( $\\updownarrow$ ), and diagonal ( $\\searrow\\hspace{-4.45mm}\\nwarrow$ )(Note that the token does not \\emph{dominate} the diagonal ( $\\nearrow\\hspace{-...
aops_forum
Let $n$ be a positive integer $\geq 2$ . Consider a $n$ by $n$ grid with all entries $1$ . Define an operation on a square to be changing the signs of all squares adjacent to it but not the sign of its own. Find all $n$ such that it is possible after a finite sequence of operations to reach a $n$ by $n$ ...
1. **Initial Setup and Definitions:** - We start with an \( n \times n \) grid where all entries are \( 1 \). - The operation defined changes the signs of all squares adjacent to a chosen square but does not change the sign of the chosen square itself. - We need to determine for which values of \( n \) it is p...
[ { "content": "Let $n$ be a positive integer $\\geq 2$ . Consider a $n$ by $n$ grid with all entries $1$ . Define an operation on a square to be changing the signs of all squares adjacent to it but not the sign of its own. Find all $n$ such that it is possible after a finite sequence of operations to ...
aops_forum
Two players play alternatively on an infinite square grid. The first player puts an $X$ in an empty cell and the second player puts an $O$ in an empty cell. The first player wins if he gets $11$ adjacent $X$ 's in a line - horizontally, vertically or diagonally. Show that the second player can always prevent the...
1. **Understanding the Problem:** - Two players, A and B, play on an infinite grid. - Player A places an $X$ in an empty cell. - Player B places an $O$ in an empty cell. - Player A wins if they get 11 adjacent $X$'s in a line (horizontally, vertically, or diagonally). - We need to show that Player B can ...
[ { "content": "Two players play alternatively on an infinite square grid. The first player puts an $X$ in an empty cell and the second player puts an $O$ in an empty cell. The first player wins if he gets $11$ adjacent $X$ 's in a line - horizontally, vertically or diagonally. Show that the second player ...
aops_forum
In the movie ”Prison break $4$ ”. Michael Scofield has to break into The Company. There, he encountered a kind of code to protect Scylla from being taken away. This code require picking out every number in a $2015\times 2015$ grid satisfying: i) The number right above of this number is $\equiv 1 \mod 2$ ii) The nu...
To solve this problem, we need to identify the numbers in a \(2015 \times 2015\) grid that satisfy the given modular conditions. Let's break down the problem step by step. 1. **Understanding the Grid Layout:** - The grid is filled with numbers from \(1\) to \(2015^2\). - The first row is filled with numbers in a...
[ { "content": "In the movie ”Prison break $4$ ”. Michael Scofield has to break into The Company. There, he encountered a kind of code to protect Scylla from being taken away. This code require picking out every number in a $2015\\times 2015$ grid satisfying:\ni) The number right above of this number is $\\e...
aops_forum
**p13.** Let $\vartriangle ABC$ be an equilateral triangle with side length $1$ . Let the unit circles centered at $A$ , $B$ , and $C$ be $\Omega_A$ , $\Omega_B$ , and $\Omega_C$ , respectively. Then, let $\Omega_A$ and $\Omega_C$ intersect again at point $D$ , and $\Omega_B$ and $\Omega_C$ intersect...
1. To find the probability that the second largest number in the list of the largest numbers from each row is 2023, we need to consider the placement of the numbers 2023, 2024, and 2025 in the grid. 2. The desired result will occur when 2024 and 2025 are in the same row, but 2023 is in a different row from those two. T...
[ { "content": "**p13.** Let $\\vartriangle ABC$ be an equilateral triangle with side length $1$ . Let the unit circles centered at $A$ , $B$ , and $C$ be $\\Omega_A$ , $\\Omega_B$ , and $\\Omega_C$ , respectively. Then, let $\\Omega_A$ and $\\Omega_C$ intersect again at point $D$ , and $\\Omega_B...
aops_forum
Let $m$ and $n$ be positive integers. Fuming Zeng gives James a rectangle, such that $m-1$ lines are drawn parallel to one pair of sides and $n-1$ lines are drawn parallel to the other pair of sides (with each line distinct and intersecting the interior of the rectangle), thus dividing the rectangle into an $m...
1. **Determine \( C_{m,n} \):** - For \( m = 1 \), there is only one possibility, and it always works. Thus, \( C_{1,n} = 1 \). - For \( m = 2 \), we claim that \( C_{2,n} = 2^{m-1} \cdot m \). This is because there must be one rectangle known in each column and two rectangles known in one row. There are \( m \) ...
[ { "content": "Let $m$ and $n$ be positive integers. Fuming Zeng gives James a rectangle, such that $m-1$ lines are drawn parallel to one pair of sides and $n-1$ lines are drawn parallel to the other pair of sides (with each line distinct and intersecting the interior of the rectangle), thus dividing the...
aops_forum
You have an $n\times n$ grid and want to remove all edges of the grid by the sequence of the following moves. In each move, you can select a cell and remove exactly three edges surrounding that cell; in particular, that cell must have at least three remaining edges for the operation to be valid. For which positive in...
1. **Counting the Edges:** - An \( n \times n \) grid has \( n \) rows and \( n \) columns. - Each row has \( n+1 \) vertical edges, and each column has \( n+1 \) horizontal edges. - Therefore, the total number of edges in the grid is: \[ 2n(n+1) \] - Since each move removes exactly 3 edges, ...
[ { "content": "You have an $n\\times n$ grid and want to remove all edges of the grid by the sequence of the following moves. In each move, you can select a cell and remove exactly three edges surrounding that cell; in particular, that cell must have at least three remaining edges for the operation to be valid...
aops_forum
$m\times n$ grid is tiled by mosaics $2\times2$ and $1\times3$ (horizontal and vertical). Prove that the number of ways to choose a $1\times2$ rectangle (horizontal and vertical) such that one of its cells is tiled by $2\times2$ mosaic and the other cell is tiled by $1\times3$ mosaic [horizontal and vertica...
1. **Assign Values to Unit Squares:** - Write the number \(1\) in each unit square tiled by \(2 \times 2\) tiles. - Write the number \(0\) in each unit square tiled by \(3 \times 1\) tiles (both horizontal and vertical). 2. **Define the Sum \(S\):** - For any possible \(1 \times 2\) rectangle (domino), sum up...
[ { "content": " $m\\times n$ grid is tiled by mosaics $2\\times2$ and $1\\times3$ (horizontal and vertical). Prove that the number of ways to choose a $1\\times2$ rectangle (horizontal and vertical) such that one of its cells is tiled by $2\\times2$ mosaic and the other cell is tiled by $1\\times3$ mo...
aops_forum
In each square of an $n\times{n}$ grid there is a lamp. If the lamp is touched it changes its state every lamp in the same row and every lamp in the same column (the one that are on are turned off and viceversa). At the begin, all the lamps are off. Show that lways is possible, with an appropriated sequence of touch...
To solve this problem, we need to show that it is always possible to turn on all the lamps in an \( n \times n \) grid with an appropriate sequence of touches, and we need to find the minimal number of touches required. 1. **Initial Setup and Problem Understanding**: - We start with an \( n \times n \) grid where a...
[ { "content": "In each square of an $n\\times{n}$ grid there is a lamp. If the lamp is touched it changes its state every lamp in the same row and every lamp in the same column (the one that are on are turned off and viceversa). At the begin, all the lamps are off. Show that lways is possible, with an appropr...
aops_forum
A robot is standing on the bottom left vertex $(0,0)$ of a $5\times5$ grid, and wants to go to $(5,5)$ , only moving to the right $(a,b)\mapsto(a+1,b)$ or upward $(a,b)\mapsto(a,b+1)$ . However this robot is not programmed perfectly, and sometimes takes the upper-left diagonal path $(a,b)\mapsto(a-1,b+1)$ . As...
1. **Define the problem and constraints:** - The robot starts at \((0,0)\) and wants to reach \((5,5)\) on a \(5 \times 5\) grid. - The robot can move right \((a,b) \mapsto (a+1,b)\), up \((a,b) \mapsto (a,b+1)\), or diagonally up-left \((a,b) \mapsto (a-1,b+1)\). - The robot takes the diagonal path exactly on...
[ { "content": "A robot is standing on the bottom left vertex $(0,0)$ of a $5\\times5$ grid, and wants to go to $(5,5)$ , only moving to the right $(a,b)\\mapsto(a+1,b)$ or upward $(a,b)\\mapsto(a,b+1)$ . However this robot is not programmed perfectly, and sometimes takes the upper-left diagonal path $(a...
aops_forum
Let $n$ be a positive integer. Initially, a $2n \times 2n$ grid has $k$ black cells and the rest white cells. The following two operations are allowed : (1) If a $2\times 2$ square has exactly three black cells, the fourth is changed to a black cell; (2) If there are exactly two black cells in a $2 \times 2$ ...
1. **Understanding the Problem:** We are given a $2n \times 2n$ grid with $k$ black cells and the rest white cells. We can perform two operations: - If a $2 \times 2$ square has exactly three black cells, the fourth cell is changed to black. - If a $2 \times 2$ square has exactly two black cells, the black cel...
[ { "content": "Let $n$ be a positive integer. Initially, a $2n \\times 2n$ grid has $k$ black cells and the rest white cells. The following two operations are allowed :\n(1) If a $2\\times 2$ square has exactly three black cells, the fourth is changed to a black cell; \n(2) If there are exactly two black...
aops_forum
The problems are really difficult to find online, so here are the problems. P1. It is known that two positive integers $m$ and $n$ satisfy $10n - 9m = 7$ dan $m \leq 2018$ . The number $k = 20 - \frac{18m}{n}$ is a fraction in its simplest form. a) Determine the smallest possible value of $k$ . b) If the den...
To solve this problem, we need to find all possible values of \( y \) given the constraints \( x < 100 \), \( y > 9 \), and \( y = \frac{p}{777} x \), where \( p \) is a 3-digit number with the tens digit being 5. 1. **Factorize 777**: \[ 777 = 3 \times 7 \times 37 \] Therefore, \( x \) must be a factor of...
[ { "content": "The problems are really difficult to find online, so here are the problems.\n\nP1. It is known that two positive integers $m$ and $n$ satisfy $10n - 9m = 7$ dan $m \\leq 2018$ . The number $k = 20 - \\frac{18m}{n}$ is a fraction in its simplest form.\na) Determine the smallest possible va...
aops_forum
Given an integer $n\geq 3$ . For each $3\times3$ squares on the grid, call this $3\times3$ square isolated if the center unit square is white and other 8 squares are black, or the center unit square is black and other 8 squares are white. Now suppose one can paint an infinite grid by white or black, so that one ...
1. **Define Isolated Centers and Set \( S \)**: - Call the center square of an isolated \(3 \times 3\) square an isolated center. - Consider the set \( S \) of isolated centers in the \(a \times b\) rectangle. - Suppose a \(a \times b\) rectangle contains \(n^2 - n\) isolated squares, and take one with minimum...
[ { "content": "Given an integer $n\\geq 3$ . For each $3\\times3$ squares on the grid, call this $3\\times3$ square isolated if the center unit square is white and other 8 squares are black, or the center unit square is black and other 8 squares are white. \n\nNow suppose one can paint an infinite grid by w...
aops_forum
A farmer buys a batch of trees, which he wishes to plant in a square grid. For example, if he had $25$ trees, then he could plant them as shown below. [asy] size(3cm,0); dot((0,0)); dot((0,1)); dot((0,2)); dot((0,3)); dot((0,4)); dot((1,0)); dot((1,1)); dot((1,2)); dot((1,3)); dot((1,4)); dot((2,0)); dot((2,1)); dot...
1. Let \( x \) be the number of trees the farmer initially has. According to the problem, if the farmer had \( x + 20 \) trees, he could plant them in a square grid. This implies that \( x + 20 \) is a perfect square. Similarly, if the farmer had \( x - 39 \) trees, he could also plant them in a square grid, implying t...
[ { "content": "A farmer buys a batch of trees, which he wishes to plant in a square grid. For example, if he had $25$ trees, then he could plant them as shown below.\n\n[asy]\nsize(3cm,0);\ndot((0,0));\ndot((0,1));\ndot((0,2));\ndot((0,3));\ndot((0,4));\ndot((1,0));\ndot((1,1));\ndot((1,2));\ndot((1,3));\ndot(...
aops_forum
Is it possible to write the numbers $17$ , $18$ , $19$ ,... $32$ in a $4*4$ grid of unit squares with one number in each square such that if the grid is divided into four $2*2$ subgrids of unit squares ,then the product of numbers in each of the subgrids divisible by $16$ ?
1. **Identify the numbers and their prime factorization:** The numbers in question are \(17, 18, 19, \ldots, 32\). We need to determine the number of factors of 2 in each of these numbers. \[ \begin{aligned} &17 = 2^0 \cdot 17, \\ &18 = 2^1 \cdot 9, \\ &19 = 2^0 \cdot 19, \\ &20 = 2^2 \cdot 5, \\ ...
[ { "content": "Is it possible to write the numbers $17$ , $18$ , $19$ ,... $32$ in a $4*4$ grid of unit squares with one number in each square such that if the grid is divided into four $2*2$ subgrids of unit squares ,then the product of numbers in each of the subgrids divisible by $16$ ?", "role": ...
aops_forum
Given an odd $n\in\mathbb N$ . In an $n\times n$ chessboard, you may place many $2\times2$ squares. How many grids, at most, are covered by exactly one square?
1. **Initial Assumption and Contradiction:** - Assume there exists a column with \( n \) grids, such that each grid is covered by exactly one \( 2 \times 2 \) square. - Since \( n \) is odd, covering \( n \) grids in pairs (each pair being part of a \( 2 \times 2 \) square) is impossible because \( n \) cannot be...
[ { "content": "Given an odd $n\\in\\mathbb N$ . In an $n\\times n$ chessboard, you may place many $2\\times2$ squares. How many grids, at most, are covered by exactly one square?", "role": "user" }, { "content": "1. **Initial Assumption and Contradiction:**\n - Assume there exists a column wit...
aops_forum
Let $\alpha \geq 1$ be a real number. Hephaestus and Poseidon play a turn-based game on an infinite grid of unit squares. Before the game starts, Poseidon chooses a finite number of cells to be *flooded*. Hephaestus is building a *levee*, which is a subset of unit edges of the grid (called *walls*) forming a connecte...
We claim that the answer is all $\boxed{\alpha > 2}$. Call Poseidon "Po" and call Hephaestus "You, the engineer" (yes, you). 1. **Winning Strategy for $\alpha > 2$:** - Define a round to be two turns, one by you and the one after by Po. - Label the squares with coordinates and suppose that if Po flooded squares ...
[ { "content": "Let $\\alpha \\geq 1$ be a real number. Hephaestus and Poseidon play a turn-based game on an infinite grid of unit squares. Before the game starts, Poseidon chooses a finite number of cells to be *flooded*. Hephaestus is building a *levee*, which is a subset of unit edges of the grid (called *wa...
aops_forum
Divide the plane into an infinite square grid by drawing all the lines $x=m$ and $y=n$ for $m,n \in \mathbb Z$ . Next, if a square's upper-right corner has both coordinates even, color it black; otherwise, color it white (in this way, exactly $1/4$ of the squares are black and no two black squares are adjacent)...
1. **Setup and Initial Conditions:** - We divide the plane into an infinite square grid by drawing all the lines \( x = m \) and \( y = n \) for \( m, n \in \mathbb{Z} \). - We color a square black if its upper-right corner has both coordinates even; otherwise, we color it white. - Given \( r \) and \( s \) ar...
[ { "content": "Divide the plane into an infinite square grid by drawing all the lines $x=m$ and $y=n$ for $m,n \\in \\mathbb Z$ . Next, if a square's upper-right corner has both coordinates even, color it black; otherwise, color it white (in this way, exactly $1/4$ of the squares are black and no two bla...
aops_forum
The following figure shows a $3^2 \times 3^2$ grid divided into $3^2$ subgrids of size $3 \times 3$ . This grid has $81$ cells, $9$ in each subgrid. [asy] draw((0,0)--(9,0)--(9,9)--(0,9)--cycle, linewidth(2)); draw((0,1)--(9,1)); draw((0,2)--(9,2)); draw((0,3)--(9,3), linewidth(2)); draw((0,4)--(9,4)); draw((0...
To solve this problem, we need to find the number of ways to select \( n^2 \) cells from an \( n^2 \times n^2 \) grid such that there is exactly one cell from each subgrid, one from each row, and one from each column. 1. **Understanding the Grid Structure**: - The grid is divided into \( n^2 \) subgrids, each of s...
[ { "content": "The following figure shows a $3^2 \\times 3^2$ grid divided into $3^2$ subgrids of size $3 \\times 3$ . This grid has $81$ cells, $9$ in each subgrid.\n[asy]\ndraw((0,0)--(9,0)--(9,9)--(0,9)--cycle, linewidth(2));\ndraw((0,1)--(9,1));\ndraw((0,2)--(9,2));\ndraw((0,3)--(9,3), linewidth(2))...
aops_forum
Let $n$ be an odd positive integer, and consider an infinite square grid. Prove that it is impossible to fill in one of $1,2$ or $3$ in every cell, which simultaneously satisfies the following conditions: (1) Any two cells which share a common side does not have the same number filled in them. (2) For any $1\ti...
1. **Initial Assumptions and Setup:** - Let \( n \) be an odd positive integer. - Consider an infinite square grid where each cell is filled with one of the numbers \( 1, 2, \) or \( 3 \). - The grid must satisfy the following conditions: 1. Any two cells sharing a common side do not have the same number....
[ { "content": "Let $n$ be an odd positive integer, and consider an infinite square grid. Prove that it is impossible to fill in one of $1,2$ or $3$ in every cell, which simultaneously satisfies the following conditions: \n(1) Any two cells which share a common side does not have the same number filled in t...
aops_forum
Problems 7, 8 and 9 are about these kites. [asy] for (int a = 0; a < 7; ++a) { for (int b = 0; b < 8; ++b) { dot((a,b)); } } draw((3,0)--(0,5)--(3,7)--(6,5)--cycle);[/asy] The large kite is covered with gold foil. The foil is cut from a rectangular piece that just covers the entire grid. How many square inches of was...
1. **Determine the dimensions of the rectangular piece:** - The kite is inscribed in a grid with dimensions 7 units by 8 units. - Therefore, the rectangular piece that covers the entire grid has an area of \(7 \times 8 = 56\) square units. 2. **Calculate the area of the kite:** - The kite is composed of two p...
[ { "content": "Problems 7, 8 and 9 are about these kites.\n\n[asy]\nfor (int a = 0; a < 7; ++a)\n{\nfor (int b = 0; b < 8; ++b)\n{\ndot((a,b));\n}\n}\ndraw((3,0)--(0,5)--(3,7)--(6,5)--cycle);[/asy]\n\nThe large kite is covered with gold foil. The foil is cut from a rectangular piece that just covers the entire g...
aops_forum
Given a grid rectangle of size $2010 \times 1340$ . A grid point is called *fair* if the $2$ axis-parallel lines passing through it from the upper left and lower right corners of the large rectangle cut out a rectangle of equal area (such a point is shown in the figure). How many fair grid points lie inside the rec...
1. Let \( x \) and \( y \) be the side lengths of the top right rectangle. The area of the top right rectangle is \( xy \). The area of the bottom left rectangle is \((2010 - x)(1340 - y)\). 2. Since the areas of these two rectangles are equal, we have: \[ xy = (2010 - x)(1340 - y) \] 3. Expanding and simpli...
[ { "content": "Given a grid rectangle of size $2010 \\times 1340$ . A grid point is called *fair* if the $2$ axis-parallel lines passing through it from the upper left and lower right corners of the large rectangle cut out a rectangle of equal area (such a point is shown in the figure). How many fair grid po...
aops_forum
Let $\{m, n, k\}$ be positive integers. $\{k\}$ coins are placed in the squares of an $m \times n$ grid. A square may contain any number of coins, including zero. Label the $\{k\}$ coins $C_1, C_2, · · · C_k$ . Let $r_i$ be the number of coins in the same row as $C_i$ , including $C_i$ itself. Let $s_i$ ...
1. **Define the problem and variables:** Let \( \{m, n, k\} \) be positive integers. We have \( k \) coins placed in an \( m \times n \) grid. Each square can contain any number of coins, including zero. Label the \( k \) coins as \( C_1, C_2, \ldots, C_k \). Let \( r_i \) be the number of coins in the same row as \...
[ { "content": "Let $\\{m, n, k\\}$ be positive integers. $\\{k\\}$ coins are placed in the squares of an $m \\times n$ grid. A square may contain any number of coins, including zero. Label the $\\{k\\}$ coins $C_1, C_2, · · · C_k$ . Let $r_i$ be the number of coins in the same row as $C_i$ , includin...
aops_forum
Given an equilateral triangle with sidelength $k$ cm. With lines parallel to it's sides, we split it into $k^2$ small equilateral triangles with sidelength $1$ cm. This way, a triangular grid is created. In every small triangle of sidelength $1$ cm, we place exactly one integer from $1$ to $k^2$ (included...
To solve this problem, we need to analyze the distribution of the small equilateral triangles within the larger equilateral triangle and how they contribute to the values of the hexagons formed by the grid. 1. **Understanding the Grid and Hexagons:** - The large equilateral triangle has a side length of \( k \) cm....
[ { "content": "Given an equilateral triangle with sidelength $k$ cm. With lines parallel to it's sides, we split it into $k^2$ small equilateral triangles with sidelength $1$ cm. This way, a triangular grid is created. In every small triangle of sidelength $1$ cm, we place exactly one integer from $1$...
aops_forum
$N$ cells chosen on a rectangular grid. Let $a_i$ is number of chosen cells in $i$ -th row, $b_j$ is number of chosen cells in $j$ -th column. Prove that $$ \prod_{i} a_i! \cdot \prod_{j} b_j! \leq N! $$
To prove the inequality \[ \prod_{i} a_i! \cdot \prod_{j} b_j! \leq N! \] we will use the combinatorial interpretation and properties of multinomial coefficients. 1. **Combinatorial Interpretation**: Consider a rectangular grid with \(N\) chosen cells. Let \(a_i\) be the number of chosen cells in the \(i\)-th row ...
[ { "content": " $N$ cells chosen on a rectangular grid. Let $a_i$ is number of chosen cells in $i$ -th row, $b_j$ is number of chosen cells in $j$ -th column. Prove that $$ \\prod_{i} a_i! \\cdot \\prod_{j} b_j! \\leq N! $$ ", "role": "user" }, { "content": "To prove the inequality \n\\[ ...
aops_forum
In each cell of an \(n \times n\) grid, one of the numbers \(0\), \(1,\) or \(2\) must be written. Determine all positive integers \(n\) for which there exists a way to fill the \(n \times n\) grid such that, when calculating the sum of the numbers in each row and each column, the numbers \(1, 2, \ldots, 2n\) are obtai...
To solve this problem, we need to determine all positive integers \( n \) for which there exists a way to fill an \( n \times n \) grid with the numbers \( 0, 1, \) or \( 2 \) such that the sums of the numbers in each row and each column are the numbers \( 1, 2, \ldots, 2n \) in some order. 1. **Sum of All Numbers in ...
[ { "content": "In each cell of an \\(n \\times n\\) grid, one of the numbers \\(0\\), \\(1,\\) or \\(2\\) must be written. Determine all positive integers \\(n\\) for which there exists a way to fill the \\(n \\times n\\) grid such that, when calculating the sum of the numbers in each row and each column, the nu...
aops_forum
Let $m$ and $n$ be fixed positive integers. Tsvety and Freyja play a game on an infinite grid of unit square cells. Tsvety has secretly written a real number inside of each cell so that the sum of the numbers within every rectangle of size either $m$ by $n$ or $n$ by $m$ is zero. Freyja wants to learn all o...
1. **Understanding the Problem:** - Tsvety writes a real number in each cell of an infinite grid. - The sum of the numbers within every rectangle of size either \( m \times n \) or \( n \times m \) is zero. - Freyja asks for the number in specific cells and wins if she can deduce all numbers in the grid. 2. *...
[ { "content": "Let $m$ and $n$ be fixed positive integers. Tsvety and Freyja play a game on an infinite grid of unit square cells. Tsvety has secretly written a real number inside of each cell so that the sum of the numbers within every rectangle of size either $m$ by $n$ or $n$ by $m$ is zero. Freyj...
aops_forum
<u>Round 5</u>**p13.** Initially, the three numbers $20$ , $201$ , and $2016$ are written on a blackboard. Each minute, Zhuo selects two of the numbers on the board and adds $1$ to each. Find the minimum $n$ for which Zhuo can make all three numbers equal to $n$ .**p14.** Call a three-letter string rearrangeab...
To solve the problem, we need to determine the minimum value \( n \) such that the three numbers \( 20 \), \( 201 \), and \( 2016 \) can all be made equal by repeatedly selecting two of the numbers and adding 1 to each. 1. **Initial Setup**: - The numbers on the board are \( 20 \), \( 201 \), and \( 2016 \). 2. **...
[ { "content": "<u>Round 5</u>**p13.** Initially, the three numbers $20$ , $201$ , and $2016$ are written on a blackboard. Each minute, Zhuo selects two of the numbers on the board and adds $1$ to each. Find the minimum $n$ for which Zhuo can make all three numbers equal to $n$ .**p14.** Call a three-let...
aops_forum
<details><summary>Intro</summary>The answers to each of the ten questions in this section are integers containing only the digits $ 1$ through $ 8$ , inclusive. Each answer can be written into the grid on the answer sheet, starting from the cell with the problem number, and continuing across or down until the entire...
1. To find the closest integer to \(6\sqrt{35}\), we start by approximating \(\sqrt{35}\). 2. We know that \( \sqrt{36} = 6 \) and \( \sqrt{25} = 5 \). Since \(35\) is closer to \(36\) than to \(25\), we can estimate that \(\sqrt{35}\) is slightly less than \(6\). 3. For a more precise approximation, we can use the f...
[ { "content": "<details><summary>Intro</summary>The answers to each of the ten questions in this section are integers containing only the digits $ 1$ through $ 8$ , inclusive. Each answer can be written into the grid on the answer sheet, starting from the cell with the problem number, and continuing across or...
aops_forum
There is a $11\times 11$ square grid. We divided this in $5$ rectangles along unit squares. How many ways that one of the rectangles doesn’t have a edge on basic circumference. Note that we count as different ways that one way coincides with another way by rotating or reversing.
To solve this problem, we need to consider the constraints and the structure of the grid and rectangles. Let's break down the problem step by step. 1. **Understanding the Grid and Rectangles**: - We have an \(11 \times 11\) grid. - We need to divide this grid into 5 rectangles. - One of these rectangles must ...
[ { "content": "There is a $11\\times 11$ square grid. We divided this in $5$ rectangles along unit squares. How many ways that one of the rectangles doesn’t have a edge on basic circumference.\nNote that we count as different ways that one way coincides with another way by rotating or reversing.\n", "rol...
aops_forum
<u>Round 1</u>**p1.** Solve the maze ![Image](https://cdn.artofproblemsolving.com/attachments/8/c/6439816a52b5f32c3cb415e2058556edb77c80.png)**p2.** Billiam can write a problem in $30$ minutes, Jerry can write a problem in $10$ minutes, and Evin can write a problem in $20$ minutes. Billiam begins writing problems...
1. Given the equations: \[ \sqrt[3]{x} + \sqrt[3]{y} = 2 \] and \[ x + y = 20 \] 2. We start by cubing both sides of the first equation: \[ (\sqrt[3]{x} + \sqrt[3]{y})^3 = 2^3 \] Expanding the left-hand side using the binomial theorem, we get: \[ \sqrt[3]{x}^3 + 3\sqrt[3]{x}^2\sq...
[ { "content": "<u>Round 1</u>**p1.** Solve the maze\n![Image](https://cdn.artofproblemsolving.com/attachments/8/c/6439816a52b5f32c3cb415e2058556edb77c80.png)**p2.** Billiam can write a problem in $30$ minutes, Jerry can write a problem in $10$ minutes, and Evin can write a problem in $20$ minutes. Billiam ...
aops_forum
Given a $2023 \times 2023$ square grid, there are beetles on some of the unit squares, with at most one beetle on each unit square. In the first minute, every beetle will move one step to its right or left adjacent square. In the second minute, every beetle will move again, only this time, in case the beetle moved ri...
1. **Color the grid in a checkerboard pattern:** - Consider a $2023 \times 2023$ grid. Color the grid in a checkerboard pattern such that no two adjacent cells have the same color. This means each cell is either black or white, and each row and column alternates between black and white cells. 2. **Define happy and ...
[ { "content": "Given a $2023 \\times 2023$ square grid, there are beetles on some of the unit squares, with at most one beetle on each unit square. In the first minute, every beetle will move one step to its right or left adjacent square. In the second minute, every beetle will move again, only this time, in c...
aops_forum
Problems 7, 8 and 9 are about these kites. To promote her school's annual Kite Olympics, Genevieve makes a small kite and a large kite for a bulletin board display. The kites look like the one in the diagram. For her small kite Genevieve draws the kite on a one-inch grid. For the large kite she triples both the height ...
To find the area of the small kite, we can use the Shoelace Theorem or divide the kite into simpler geometric shapes. Here, we will use the method of dividing the kite into triangles and rearranging them into a rectangle. 1. **Identify the vertices of the kite:** The vertices of the kite are given as \((3,0)\), \((...
[ { "content": "Problems 7, 8 and 9 are about these kites.\nTo promote her school's annual Kite Olympics, Genevieve makes a small kite and a large kite for a bulletin board display. The kites look like the one in the diagram. For her small kite Genevieve draws the kite on a one-inch grid. For the large kite she t...
aops_forum
Let \(n\) be a positive integer and consider an \(n\times n\) square grid. For \(1\le k\le n\), a *python* of length \(k\) is a snake that occupies \(k\) consecutive cells in a single row, and no other cells. Similarly, an *anaconda* of length \(k\) is a snake that occupies \(k\) consecutive cells in a single column, a...
To prove that the sum of the squares of the lengths of the snakes is at least \(n^2\), we will use a combinatorial argument and properties of the grid and snakes. 1. **Grid and Snakes Setup**: - Consider an \(n \times n\) grid. - A *python* of length \(k\) occupies \(k\) consecutive cells in a single row. - A...
[ { "content": "Let \\(n\\) be a positive integer and consider an \\(n\\times n\\) square grid. For \\(1\\le k\\le n\\), a *python* of length \\(k\\) is a snake that occupies \\(k\\) consecutive cells in a single row, and no other cells. Similarly, an *anaconda* of length \\(k\\) is a snake that occupies \\(k\\) ...
aops_forum
The fi gure below shows a $9\times7$ arrangement of $2\times2$ squares. Alternate squares of the grid are split into two triangles with one of the triangles shaded. Find the area of the shaded region. [asy] size(5cm); defaultpen(linewidth(.6)); fill((0,1)--(1,1)--(1,0)--cycle^^(0,3)--(1,3)--(1,2)--cycle^^(1,2)--(2,...
1. First, we need to determine the total number of $2 \times 2$ squares in the $9 \times 7$ grid. Each $2 \times 2$ square occupies a $2 \times 2$ area, so we can count how many such squares fit horizontally and vertically. - Horizontally: $\left\lfloor \frac{9}{2} \right\rfloor = 4$ squares - Vertically: $\left\...
[ { "content": "The fi\fgure below shows a $9\\times7$ arrangement of $2\\times2$ squares. Alternate squares of the grid are split into two triangles with one of the triangles shaded. Find the area of the shaded region.\n[asy]\nsize(5cm);\ndefaultpen(linewidth(.6));\nfill((0,1)--(1,1)--(1,0)--cycle^^(0,3)--(1...
aops_forum
Consider a $5 \times 5$ grid of squares. Vladimir colors some of these squares red, such that the centers of any four red squares do $\textbf{not}$ form an axis-parallel rectangle (i.e. a rectangle whose sides are parallel to those of the squares). What is the maximum number of squares he could have colored red?
1. **Understanding the Problem:** We need to color the maximum number of squares in a $5 \times 5$ grid such that no four centers of the colored squares form an axis-parallel rectangle. An axis-parallel rectangle has sides parallel to the grid lines. 2. **Initial Considerations:** - If there is no row with 3 or ...
[ { "content": "Consider a $5 \\times 5$ grid of squares. Vladimir colors some of these squares red, such that the centers of any four red squares do $\\textbf{not}$ form an axis-parallel rectangle (i.e. a rectangle whose sides are parallel to those of the squares). What is the maximum number of squares he co...
aops_forum
Mr. Jones teaches algebra. He has a whiteboard with a pre-drawn coordinate grid that runs from $-10$ to $10$ in both the $x$ and $y$ coordinates. Consequently, when he illustrates the graph of a quadratic, he likes to use a quadratic with the following properties: I. The quadratic sends integers to integers....
1. **Form of the Quadratic**: We start by writing the quadratic in the form \( a(x - b)(x - c) \), where \( b < c \) and \( a \neq 0 \). This ensures that the quadratic has roots at \( x = b \) and \( x = c \). 2. **Vertex Calculation**: The vertex of a quadratic \( ax^2 + bx + c \) is given by \( x = -\frac{B}{2A} \)...
[ { "content": "Mr. Jones teaches algebra. He has a whiteboard with a pre-drawn coordinate grid that runs from $-10$ to $10$ in both the $x$ and $y$ coordinates. Consequently, when he illustrates the graph of a quadratic, he likes to use a quadratic with the following properties:\nI. The quadratic send...
aops_forum
The following diagram shows a grid of $36$ cells. Find the number of rectangles pictured in the diagram that contain at least three cells of the grid. ![Image](https://cdn.artofproblemsolving.com/attachments/a/4/e9ba3a35204ec68c17a364ebf92cc107eb4d7a.png)
1. **Calculate the total number of rectangles in the grid:** The grid is a $6 \times 6$ grid, which means it has 7 horizontal and 7 vertical lines. The number of ways to choose 2 horizontal lines from 7 is $\binom{7}{2}$, and the number of ways to choose 2 vertical lines from 7 is also $\binom{7}{2}$. Therefore, th...
[ { "content": "The following diagram shows a grid of $36$ cells. Find the number of rectangles pictured in the diagram that contain at least three cells of the grid.\n![Image](https://cdn.artofproblemsolving.com/attachments/a/4/e9ba3a35204ec68c17a364ebf92cc107eb4d7a.png)", "role": "user" }, { "cont...
aops_forum
For what polynomials $P(n)$ with integer coefficients can a positive integer be assigned to every lattice point in $\mathbb{R}^3$ so that for every integer $n \ge 1$ , the sum of the $n^3$ integers assigned to any $n \times n \times n$ grid of lattice points is divisible by $P(n)$ ? *Proposed by Andre Arslan...
1. **Initial Setup and Claim:** We claim that the answer is \( P(x) = c \cdot x^k \). Let \( f(x,y,z) \) be the number assigned to the point \((x,y,z)\). Assume that a polynomial \( P(n) \) works. Define: \[ a_k = \sum_{x \leq n} \sum_{y \leq n} f(x,y,k) \] Then, \(\ldots, a_{-1}, a_0, a_1, \ldots\) is t...
[ { "content": "For what polynomials $P(n)$ with integer coefficients can a positive integer be assigned to every lattice point in $\\mathbb{R}^3$ so that for every integer $n \\ge 1$ , the sum of the $n^3$ integers assigned to any $n \\times n \\times n$ grid of lattice points is divisible by $P(n)$ ?\...
aops_forum
Let $k$ be a positive integer. Marco and Vera play a game on an infinite grid of square cells. At the beginning, only one cell is black and the rest are white. A turn in this game consists of the following. Marco moves first, and for every move he must choose a cell which is black and which has more than two white ...
To solve this problem, we need to determine the minimal value of \( k \) such that Vera can guarantee a win no matter what Marco does, and then find the smallest positive integer \( t \) such that Vera can guarantee a win after at most \( t \) turns. Finally, we compute \( 100m + t \). 1. **Understanding Marco's Move:...
[ { "content": "Let $k$ be a positive integer. Marco and Vera play a game on an infinite grid of square cells. At the beginning, only one cell is black and the rest are white. \n\tA turn in this game consists of the following. Marco moves first, and for every move he must choose a cell which is black and which ...
aops_forum
Janez wants to make an $m\times n$ grid (consisting of unit squares) using equal elements of the form $\llcorner$ , where each leg of an element has the unit length. No two elements can overlap. For which values of $m$ and $n$ can Janez do the task?
1. **Understanding the Problem:** Janez wants to tile an \(m \times n\) grid using L-shaped trominoes (each tromino covers 3 unit squares). The goal is to determine for which values of \(m\) and \(n\) this is possible. 2. **Initial Observations:** - Each tromino covers 3 unit squares. - Therefore, the total n...
[ { "content": "Janez wants to make an $m\\times n$ grid (consisting of unit squares) using equal elements of the form $\\llcorner$ , where each leg of an element has the unit length. No two elements can overlap. For which values of $m$ and $n$ can Janez do the task?", "role": "user" }, { "cont...
aops_forum
Consider a $6 \times 6$ grid of squares. Edmond chooses four of these squares uniformly at random. What is the probability that the centers of these four squares form a square?
1. **Identify the total number of ways to choose 4 squares from a 6x6 grid:** The total number of squares in a 6x6 grid is \(6 \times 6 = 36\). The number of ways to choose 4 squares out of 36 is given by the binomial coefficient: \[ \binom{36}{4} = \frac{36!}{4!(36-4)!} = \frac{36!}{4! \cdot 32!} \] 2. **...
[ { "content": "Consider a $6 \\times 6$ grid of squares. Edmond chooses four of these squares uniformly at random. What is the probability that the centers of these four squares form a square?", "role": "user" }, { "content": "1. **Identify the total number of ways to choose 4 squares from a 6x6 gr...
aops_forum
<u>Round 6</u>**p16.** Let $ABC$ be a triangle with $AB = 3$ , $BC = 4$ , and $CA = 5$ . There exist two possible points $X$ on $CA$ such that if $Y$ and $Z$ are the feet of the perpendiculars from $X$ to $AB$ and $BC,$ respectively, then the area of triangle $XY Z$ is $1$ . If the distance betwee...
1. Let us construct a desired order of \(1, 2, 3, \ldots, n\) from a desired ordering of \(1, 2, 3, \ldots, n-1\). Note that we can insert an \(n\) behind any of the numbers \[ \left\lceil \frac{n}{2} \right\rceil, \left\lceil \frac{n}{2} \right\rceil + 1, \ldots, n-1, \] or at the front of the line. There...
[ { "content": "<u>Round 6</u>**p16.** Let $ABC$ be a triangle with $AB = 3$ , $BC = 4$ , and $CA = 5$ . There exist two possible points $X$ on $CA$ such that if $Y$ and $Z$ are the feet of the perpendiculars from $X$ to $AB$ and $BC,$ respectively, then the area of triangle $XY Z$ is $1$ . ...
aops_forum
Show for any positive integer $n$ that there exists a circle in the plane such that there are exactly $n$ grid points within the circle. (A grid point is a point having integer coordinates.)
1. **Understanding the Problem:** We need to show that for any positive integer \( n \), there exists a circle in the plane such that there are exactly \( n \) grid points (points with integer coordinates) within the circle. 2. **Choosing a Center:** Consider the point \( \left(\sqrt{2}, \frac{1}{3}\right) \) as...
[ { "content": "Show for any positive integer $n$ that there exists a circle in the plane such that there are exactly $n$ grid points within the circle. (A grid point is a point having integer coordinates.)\n", "role": "user" }, { "content": "1. **Understanding the Problem:**\n We need to show t...
aops_forum
If all vertices of a triangle on the square grid are grid points, then the triangle is called a *lattice* triangle. What is the area of the lattice triangle with (one) of the smallest area, if one grid has area $1$ square unit?
1. **Understanding the Problem:** We need to find the area of the smallest lattice triangle on a square grid where each grid square has an area of 1 square unit. 2. **Using Pick's Theorem:** Pick's Theorem states that for a lattice polygon, the area \( A \) can be calculated using the formula: \[ A = I + \...
[ { "content": "If all vertices of a triangle on the square grid are grid points, then the triangle is called a *lattice* triangle. What is the area of the lattice triangle with (one) of the smallest area, if one grid has area $1$ square unit?", "role": "user" }, { "content": "1. **Understanding th...
aops_forum
- A power grid with the shape of a $3\times 3$ lattice with $16$ nodes (vertices of the lattice) joined by wires (along the sides of squares. It may have happened that some of the wires have burned out. In one test technician can choose any two nodes and check if electrical current circulates between them (i.e th...
To solve this problem, we need to determine the minimum number of tests required to demonstrate that all nodes in a power grid are connected. We will approach this problem by considering the properties of the graph formed by the nodes and wires. ### 1. Understanding the Problem The power grid is represented as a $3 \t...
[ { "content": "\n\n- A power grid with the shape of a $3\\times 3$ lattice with $16$ nodes (vertices of the lattice) joined by wires (along the sides of squares. It may have happened that some of the wires have burned out. In one test technician can choose any two nodes and check if electrical current circul...
aops_forum
Misha has a $100$ x $100$ chessboard and a bag with $199$ rooks. In one move he can either put one rook from the bag on the lower left cell of the grid, or remove two rooks which are on the same cell, put one of them on the adjacent square which is above it or right to it, and put the other in the bag. Misha wants...
To determine if Misha can place exactly 100 rooks on a 100x100 chessboard such that no two rooks attack each other, we can use an inductive approach. Let's generalize the problem for an \( n \times n \) chessboard with \( 2n-1 \) rooks. 1. **Base Case:** For \( n = 1 \), we have a \( 1 \times 1 \) chessboard and \(...
[ { "content": "Misha has a $100$ x $100$ chessboard and a bag with $199$ rooks. In one move he can either put one rook from the bag on the lower left cell of the grid, or remove two rooks which are on the same cell, put one of them on the adjacent square which is above it or right to it, and put the other i...
aops_forum
Suppose $n\geq 3$ is an integer. There are $n$ grids on a circle. We put a stone in each grid. Find all positive integer $n$ , such that we can perform the following operation $n-2$ times, and then there exists a grid with $n-1$ stones in it: $\bullet$ Pick a grid $A$ with at least one stone in it. And pic...
1. **Labeling the Grids:** Let's label the grids as \(1, 2, 3, \ldots, n\) in a clockwise direction. Each grid initially contains one stone. 2. **Understanding the Operation:** The operation allows us to pick a grid \(A\) with at least one stone and a positive integer \(k \leq n-1\). We then take all stones from...
[ { "content": "Suppose $n\\geq 3$ is an integer. There are $n$ grids on a circle. We put a stone in each grid. Find all positive integer $n$ , such that we can perform the following operation $n-2$ times, and then there exists a grid with $n-1$ stones in it: $\\bullet$ Pick a grid $A$ with at least ...
aops_forum
Given a grid of $6\times 6$ , write down integer which is more than or equal to 1 and less than or equal to 6 in each grid. For integers $1\leq i,\ j\leq 6$ , denote denote by $i \diamondsuit j$ the integer written in the entry in the $i-$ th row and $j-$ th colum of the grid. How many ways are there to write ...
1. **Define the Problem and Notations:** We are given a $6 \times 6$ grid where each entry is an integer between 1 and 6. For integers $1 \leq i, j \leq 6$, denote by $i \diamondsuit j$ the integer written in the entry in the $i$-th row and $j$-th column of the grid. The conditions to satisfy are: - For any integ...
[ { "content": "Given a grid of $6\\times 6$ , write down integer which is more than or equal to 1 and less than or equal to 6 in each grid. For integers $1\\leq i,\\ j\\leq 6$ , denote\ndenote by $i \\diamondsuit j$ the integer written in the entry in the $i-$ th row and $j-$ th colum of the grid.\n\nHow...
aops_forum
In an $m \times n$ grid, each square is either filled or not filled. For each square, its *value* is defined as $0$ if it is filled and is defined as the number of neighbouring filled cells if it is not filled. Here, two squares are neighbouring if they share a common vertex or side. Let $f(m,n)$ be the largest t...
1. **Understanding the Grid and Values:** - Each square in the grid can have up to 8 neighbors (if it is not on the edge or corner). - The value of a filled square is \( 0 \). - The value of an unfilled square is the number of its neighboring filled squares. 2. **Maximizing the Total Value \( f(m,n) \):** ...
[ { "content": "In an $m \\times n$ grid, each square is either filled or not filled. For each square, its *value* is defined as $0$ if it is filled and is defined as the number of neighbouring filled cells if it is not filled. Here, two squares are neighbouring if they share a common vertex or side. Let $f(...
aops_forum
$k$ marbles are placed onto the cells of a $2024 \times 2024$ grid such that each cell has at most one marble and there are no two marbles are placed onto two neighboring cells (neighboring cells are defined as cells having an edge in common). a) Assume that $k=2024$ . Find a way to place the marbles satisfying t...
### Part (a) 1. **Arrange Marbles on the Diagonal:** - Place each of the 2024 marbles on one of the two main diagonals of the \(2024 \times 2024\) grid. For example, place a marble at each cell \((i, i)\) for \(i = 1, 2, \ldots, 2024\). 2. **Verify the Condition:** - Each marble is placed such that no two marbl...
[ { "content": " $k$ marbles are placed onto the cells of a $2024 \\times 2024$ grid such that each cell has at most one marble and there are no two marbles are placed onto two neighboring cells (neighboring cells are defined as cells having an edge in common).\n\na) Assume that $k=2024$ . Find a way to place...
aops_forum
Is it possible to fill a $3 \times 3$ grid with each of the numbers $1,2,\ldots,9$ once each such that the sum of any two numbers sharing a side is prime?
1. **Assume we can fill the $3 \times 3$ grid with the numbers $1, 2, \ldots, 9$ such that the sum of any two numbers sharing a side is prime.** 2. **Consider the number $7$.** - The possible prime sums involving $7$ are $7 + 2 = 9$, $7 + 4 = 11$, and $7 + 6 = 13$. - Therefore, the only possible neighbors for $7...
[ { "content": "Is it possible to fill a $3 \\times 3$ grid with each of the numbers $1,2,\\ldots,9$ once each such that the sum of any two numbers sharing a side is prime?", "role": "user" }, { "content": "1. **Assume we can fill the $3 \\times 3$ grid with the numbers $1, 2, \\ldots, 9$ such tha...
aops_forum
<u>Round 5</u>**p13.** Sally is at the special glasses shop, where there are many different optical lenses that distort what she sees and cause her to see things strangely. Whenever she looks at a shape through lens $A$ , she sees a shape with $2$ more sides than the original (so a square would look like a hexagon)....
1. Let the people be \( P_1, P_2, P_3, \ldots, P_{2015} \), who retrieve their hats in that order. 2. Define \( x_1, x_2, x_3, \ldots, x_{2015} \) such that, for all \( i \in \{1,2,3,\ldots,2015\} \), \( x_i=0 \) if \( P_i \) does not get their hat and \( x_i=1 \) if \( P_i \) does get their hat. 3. We wish to find \( ...
[ { "content": "<u>Round 5</u>**p13.** Sally is at the special glasses shop, where there are many different optical lenses that distort what she sees and cause her to see things strangely. Whenever she looks at a shape through lens $A$ , she sees a shape with $2$ more sides than the original (so a square would...
aops_forum
In each lattice-point of an $m \times n$ grid and in the centre of each of the formed unit squares a pawn is placed. a) Find all such grids with exactly $500$ pawns. b) Prove that there are infinitely many positive integers $k$ for which therer is no grid containing exactly $k$ pawns.
### Part (a) 1. **Determine the number of pawns in the grid:** - There are \((m+1)(n+1)\) lattice points in an \(m \times n\) grid. - There are \(mn\) unit squares in the grid. - Therefore, the total number of pawns is given by: \[ (m+1)(n+1) + mn \] 2. **Set up the equation for the total numbe...
[ { "content": "In each lattice-point of an $m \\times n$ grid and in the centre of each of the formed unit squares a pawn is placed.\n\na) Find all such grids with exactly $500$ pawns.\nb) Prove that there are infinitely many positive integers $k$ for which therer is no grid containing exactly $k$ pawns....
aops_forum
Derek fills a square $10$ by $10$ grid with $50$ $1$ s and $50$ $2$ s. He takes the product of the numbers in each of the $10$ rows. He takes the product of the numbers in each of the $10$ columns. He then sums these $20$ products up to get an integer $N.$ Find the minimum possible value of $N.$
1. **Representation of the Products:** - Derek fills a \(10 \times 10\) grid with \(50\) ones and \(50\) twos. - The product of the numbers in each row can be represented as \(2^{a_i}\), where \(a_i\) is the number of twos in the \(i\)-th row. - Similarly, the product of the numbers in each column can be repre...
[ { "content": "Derek fills a square $10$ by $10$ grid with $50$ $1$ s and $50$ $2$ s. He takes the product of the numbers in each of the $10$ rows. He takes the product of the numbers in each of the $10$ columns. He then sums these $20$ products up to get an integer $N.$ Find the minimum possib...