Jerry has red blocks, yellow blocks, and blue blocks. He builds a tower $5$ blocks high, without any $2$ blocks of the same color touching each other. Also, if the tower is flipped upside-down, it still looks the same. Compute the number of ways Jerry could have built this tower.

Given 2005 distinct numbers $a_1,\,a_2,\dots,a_{2005}$. By one question, we may take three different indices $1\le i<j<k\le 2005$ and find out the set of numbers $\{a_i,\,a_j,\,a_k\}$ (unordered, of course). Find the minimal number of questions, which are necessary to find out all numbers $a_i$.

Is it possible to select $1000$ points in the plane so that $6000$ pairwise distances between them are equal?

The game of Nelipe is played on a $16\times16$-grid as follows: The two players write in turn numbers $1, 2,..., 16$ in different squares. The numbers on each row, column, and in every one of the 16 smaller squares have to be different. The loser is the one who is not able to write a number. Which one of the players wins, if both play with an optimal strategy?

Consider a $m\times n$ rectangular grid with $m$ rows and $n$ columns. There are water fountains on some of the squares. A water fountain can spray water onto any of it's adjacent squares, or a square in the same column such that there is exactly one square between them. Find the minimum number of fountains such that each square can be sprayed in the case that a) $m=4$; b) $m=3$.

Find the number of distinguishable $2\times 2\times 2$ cubes that can be formed by gluing together two blue, two green, two red, and two yellow $1\times 1\times 1$ cubes. Two cubes are indistinguishable if one can be rotated so that the two cubes have identical coloring patterns.

Given an $n \times n$ ($n \ge 3$) square table with one of the following unit vectors $\uparrow, \downarrow, \leftarrow, \rightarrow$ in any its cell (the vectors are parallel to the sides and the middles of them coincide with the centers of the cells). Per move a beetle creeps from one cell to another in accordance with the vector’s direction. If the beetle starts from any cell, then it comes back to this cell after some number of moves. The vectors are directed so that they do not allow the beetle to leave the table. Is it possible that the sum of all vectors at any row (except for the first one and the last one) is equal to the vector that is parallel to this row, and the sum of all vectors at any column (except for the first one and the last one) is equal to the vector that is parallel to this column ? (D. Dudko)

You are given a positive integer $n$. $n^2$ amount of people stand on coordinates $(x;y)$ where $x,y\in\{0;1;2;...;n-1\}$. Every person got a water cup and two people are considered to be neighbour if the distance between them is $1$. At the first minute, the person standing on coordinates $(0;0)$ got $1$ litres of water, and the other $n^2-1$ people's water cup is empty. Every minute, two neighbouring people are chosen that does not have the same amount of water in their water cups, and they equalize the amount of water in their water cups. Prove that, no matter what, the person standing on the coordinates $(x;y)$ will not have more than $\frac1{x+y+1}$ litres of water.

Let $A$ be the set of all sequences from 0’s or 1’s with length 4. What’s the minimal number of sequences that can be chosen, so that an arbitrary sequence from $A$ differs at most in 1 position from one of the chosen?

Let $A$ consist of $16$ elements of the set $\{1, 2, 3,..., 106\}$, so that the difference of two arbitrary elements in $A$ are different from $6, 9, 12, 15, 18, 21$. Prove that there are two elements of $A$ for which their difference equals to $3$.

Do there exist 100 points on the plane such that the pairwise distances between them are pairwise distinct consecutive integer numbers larger than 2022?

Two operations are allowed: (i) to write two copies of number $1$; (ii) to replace any two identical numbers $n$ by $(n + 1)$ and $(n - 1)$. Find the minimal number of operations that required to produce the number $2005$ (at the beginning there are no numbers). [i](8 points)[/i]

In how many ways can we fill the cells of a $4\times4$ grid such that each cell contains exactly one positive integer and the product of the numbers in each row and each column is $2020$?

Marc has an $n\times n$ board, where $n\ge 3$ is an integer, and an unlimited supply of green and red apples. Marc wants to place some apples on the board, so that the following conditions hold. [list] [*] Every cell of the board has exactly one apple, be it red or green. [*] All rows and columns of the board have at least one red apple. [*] No two rows or columns have the same apple color sequence. Note that rows are read from left to right, and columns are read from top to bottom. Also note that we [b]do not[/b] allow a row and a column to have the same color sequence. [/list] Find, in terms of $n$, the minimal number of red apples that Marc needs in order to fill the board in this way.

Let $n$ be an odd natural number. We consider an $n\times n$ grid which is made up of $n^2$ unit squares and $2n(n+1)$ edges. We colour each of these edges either $\color{red} \textit{red}$ or $\color{blue}\textit{blue}$. If there are at most $n^2$ $\color{red} \textit{red}$ edges, then show that there exists a unit square at least three of whose edges are $\color{blue}\textit{blue}$.

The [i][b]duchess[/b][/i] is a chess piece such that the duchess attacks all the cells in two of the four diagonals which she is contained(the directions of the attack can vary to two different duchesses). Determine the greatest integer $n$, such that we can put $n$ duchesses in a table $8\times 8$ and none duchess attacks other duchess. Note: The attack diagonals can be "outside" the table; for instance, a duchess on the top-leftmost cell we can choose attack or not the main diagonal of the table $8\times 8$.

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 can select an $a\times b$ rectangle which contains at least $n^2-n$ isolated $3\times 3$ square. Find the minimum of $a+b$ that such thing can happen. (Note that $a,b$ are positive reals, and selected $a\times b$ rectangle may have sides not parallel to grid line of the infinite grid.)

Let $p$ be an odd prime. Determine the number of nonempty subsets from $\{1, 2, \dots, p - 1\}$ for which the sum of its elements is divisible by $p$.

Let $S$ be a set not empty of positive integers and $AB$ a segment with, initially, only points $A$ and $B$ colored by red. An operation consists of choosing two distinct points $X, Y$ colored already by red and $n\in S$ an integer, and painting in red the $n$ points $A_1, A_2,..., A_n$ of segment $XY$ such that $XA_1= A_1A_2= A_2A_3=...= A_{n-1}A_n= A_nY$ and $XA_1<XA_2<...<XA_n$. Find the least positive integer $m$ such exists a subset $S$ of $\{1,2,.., m\}$ such that, after a finite number of operations, we can paint in red the point $K$ in the segment $AB$ defined by $\frac{AK}{KB}= \frac{2709}{2022}$. Also, find the number of such subsets for such a value of $m$.

[hide=B stands for Bernoulli, G stands for Germain]they had two problem sets under those two names[/hide] [u]Set 1[/u] [b]B1 / G1[/b] Find $20^3 + 2^2 + 3^1$. [b]B2[/b] A piece of string of length $10$ is cut $4$ times into strings of equal length. What is the length of each small piece of string? [b]B3 / G2[/b] What is the smallest perfect square that is also a perfect cube? [b]B4[/b] What is the probability a $5$-sided die with sides labeled from $1$ through $5$ rolls an odd number? [b]B5 / G3[/b] Hanfei spent $14$ dollars on chicken nuggets at McDonalds. $4$ nuggets cost $3$ dollars, $6$ nuggets cost $4$ dollars, and $12$ nuggets cost $9$ dollars. How many chicken nuggets did Hanfei buy? [u]Set 2[/u] [b]B6[/b] What is the probability a randomly chosen positive integer less than or equal to $15$ is prime? [b]B7[/b] Andrew flips a fair coin with sides labeled 0 and 1 and also rolls a fair die with sides labeled $1$ through $6$. What is the probability that the sum is greater than $5$? [b]B8 / G4[/b] What is the radius of a circle with area $4$? [b]B9[/b] What is the maximum number of equilateral triangles on a piece of paper that can share the same corner? [b]B10 / G5[/b] Bob likes to make pizzas. Bab also likes to make pizzas. Bob can make a pizza in $20$ minutes. Bab can make a pizza in $30$ minutes. If Bob and Bab want to make $50$ pizzas in total, how many hours would that take them? [u]Set 3[/u] [b]B11 / G6[/b] Find the area of an equilateral rectangle with perimeter $20$. [b]B12 / G7[/b] What is the minimum possible number of divisors that the sum of two prime numbers greater than $2$ can have? [b]B13 / G8[/b] Kwu and Kz play rock-paper-scissors-dynamite, a variant of the classic rock-paperscissors in which dynamite beats rock and paper but loses to scissors. The standard rock-paper-scissors rules apply, where rock beats scissors, paper beats rock, and scissors beats paper. If they throw out the same option, they keep playing until one of them wins. If Kz randomly throws out one of the four options with equal probability, while Kwu only throws out dynamite, what is the probability Kwu wins? [b]B14 / G9[/b] Aven has $4$ distinct baguettes in a bag. He picks three of the bagged baguettes at random and lays them on a table in random order. How many possible orderings of three baguettes are there on the table? [b]B15 / G10[/b] Find the largest $7$-digit palindrome that is divisible by $11$. PS. You should use hide for answers. Rest problems have been posted [url=https://artofproblemsolving.com/community/c3h3132170p28376644]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$(BEL 6)$ Evaluate $\left(\cos\frac{\pi}{4} + i \sin\frac{\pi}{4}\right)^{10}$ in two different ways and prove that $\dbinom{10}{1}-\dbinom{10}{3}+\frac{1}{2}\dbinom{10}{5}=2^4$

In a $ 2\times 7$ board gridded in $1\times 1$ squares, the $24$ points that are vertices of the squares are considered. [img]https://cdn.artofproblemsolving.com/attachments/9/e/841f11ef9d6fc27cdbe7c91bab6d52d12180e8.gif[/img] Juan and Matías play on this board. Juan paints red the same number of points on each of the three horizontal lines. If Matthias can choose three red dots that are vertices of an acute triangle, Matthias wins the game. What is the maximum number of dots Juan can color in to make sure Matías doesn't win? (For the number found, give an example of coloring that prevents Matías from winning and justify why if the number is greater, Matías can always win.)

The Nationwide Basketball Society (NBS) has $8001$ teams, numbered $2000$ through $10000$. For each $n$, team $n$ has $n+1$ players, and in a sheer coincidence, this year each player attempted $n$ shots and on team $n$, exactly one player made $0$ shots, one player made $1$ shot, . . ., one player made $n$ shots. A player's [i]field goal percentage[/i] is defined as the percentage of shots the player made, rounded to the nearest tenth of a percent (For instance, $32.45\%$ rounds to $32.5\%$). A player in the NBS is randomly selected among those whose field goal percentage is $66.6\%$. If this player plays for team $k$, the probability that $k\geq 6000$ can be expressed as $\tfrac{p}{q}$ for relatively prime positive integers $p$ and $q$. Find $p+q$.

An experiment consists of performing $n$ independent tests. The $i$-th test is successful with the probability equal to $p_i$. Let $r_k$ be the probability that exactly $k$ tests succeed. Prove that $$\sum_{i=1}^n p_i =\sum_{k=0}^n kr_k.$$

A [i]lattice point[/i] in the Cartesian plane is a point whose coordinates are both integers. A [i]lattice polygon[/i] is a polygon all of whose vertices are lattice points. Let $\Gamma$ be a convex lattice polygon. Prove that $\Gamma$ is contained in a convex lattice polygon $\Omega$ such that the vertices of $\Gamma$ all lie on the boundary of $\Omega$, and exactly one vertex of $\Omega$ is not a vertex of $\Gamma$.