The $25$ member states of the European Union set up a committee with the following rules: 1) the committee should meet daily; 2) at each meeting, at least one member should be represented; 3) at any two different meetings, a different set of member states should be represented; 4) at $n^{th}$ meeting, for every $k<n$, the set of states represented should include at least one state that was represented at the $k^{th}$ meeting. For how many days can the committee have its meetings?

Three lights are placed horizontally on a line on the ceiling. All the lights are initially off. Every second, Neil picks one of the three lights uniformly at random to switch: if it is off, he switches it on; if it is on, he switches it off. When a light is switched, any lights directly to the left or right of that light also get turned on (if they were off) or off (if they were on). The expected number of lights that are on after Neil has flipped switches three times can be expressed in the form $m/ n$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.

We call a set of points [i]free[/i] if there is no equilateral triangle with the vertices among the points of the set. Prove that every set of $n$ points in the plane contains a [i]free[/i] subset with at least $\sqrt{n}$ elements.

[b]a)[/b] Among the $21$ pairwise distances between the $7$ points of the plane, prove that one and the same number occurs not more than $12$ times. [b]b)[/b] Find a maximum number of times may meet the same number among the $15$ pairwise distances between $6$ points of the plane.

Let $A{}$ be a subset formed of $16$ elements of the set $B=\{1, 2, 3, \ldots, 105, 106\}$ such that the difference between every two elements from $A$ is different from $6, 9, 12, 15, 18, 21$. Prove that there are two elements in $A{}$ whose difference is $3$.

Let $N$ be an odd number, $N\geq 3$. $N$ tennis players take part in a championship. Before starting the championship, a commission puts the players in a row depending on how good they think the players are. During the championship, every player plays with every other player exactly once, and each match has a winner. A match is called [i]suprising[/i] if the winner was rated lower by the commission. At the end of the tournament, players are arranged in a line based on the number of victories they have achieved. In the event of a tie, the commission's initial order is used to decide which player will be higher. It turns out that the final order is exactly the same as the commission's initial order. What is the maximal number of suprising matches that could have happened.

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 of these numbers. One by one, Freyja asks Tsvety about some cell in the grid, and Tsvety truthfully reveals what number is written in it. Freyja wins if, at any point, Freyja can simultaneously deduce the number written in every cell of the entire infinite grid (If this never occurs, Freyja has lost the game and Tsvety wins). In terms of $m$ and $n$, find the smallest number of questions that Freyja must ask to win, or show that no finite number of questions suffice. [i]Nikolai Beluhov[/i]

[b]p1.[/b] Find the number of ordered triples $(a, b, c)$ satisfying $\bullet$ $a, b, c$ are are single-digit positive integers, and $\bullet$ $a \cdot b + c = a + b \cdot c$. [b]p2.[/b] In their class Introduction to Ladders at Greendale Community College, Jan takes four tests. They realize that their test scores in chronological order form an increasing arithmetic progression with integer terms, and that the average of those scores is an integer greater than or equal to $94$. How many possible combinations of test scores could they have had? (Test scores at Greendale range between $0$ and $100$, inclusive.) [b]p3.[/b] Suppose that $a + \frac{1}{b} = 2$ and $b +\frac{1}{a} = 3$. If$ \frac{a}{b} + \frac{b}{a}$ can be expressed as $\frac{p}{q}$ in simplest terms, find $p + q$. [b]p4.[/b] Suppose that $A$ and $B$ are digits between $1$ and $9$ such that $$0.\overline{ABABAB...}+ B \cdot (0.\overline{AAA...}) = A \cdot (0.\overline{B_1B_1B_1...}) + 1$$ Find the sum of all possible values of $10A + B$. [b]p5.[/b] Let $ABC$ be an isosceles right triangle with $m\angle ABC = 90^o$. Let $D$ and $E$ lie on segments $AC$ and $BC$, respectively, such that triangles $\vartriangle ADB$ and $\vartriangle CDE$ are similar and $DE = EB$. If $\frac{AC}{AD} = 1 +\frac{\sqrt{a}}{b}$ with $a, b$ positive integers and a squarefree, then find $a + b$. [b]p6.[/b] Five bowling pins $P_1$, $P_2$,..., $P_5$ are lined up in a row. Each turn, Jemma picks a pin at random from the standing pins, and throws a bowling ball at that pin; that pin and each pin directly adjacent to it are knocked down. If the expected value of the number of turns Jemma will take to knock down all the pins is a b where a and b are relatively prime, find $a + b$. (Pins $P_i$ and $P_j$ are adjacent if and only if $|i -j| = 1$.) [b]p7.[/b] Let triangle $ABC$ have side lengths $AB = 10$, $BC = 24$, and $AC = 26$. Let $I$ be the incenter of $ABC$. If the maximum possible distance between $I$ and a point on the circumcircle of $ABC$ can be expressed as $a +\sqrt{b}$ for integers $a$ and $b$ with $b$ squarefree, find $a + b$. (The incenter of any triangle $XY Z$ is the intersection of the angle bisectors of $\angle Y XZ$, $\angle XZY$, and $\angle ZY X$.) [b]p8.[/b] How many terms in the expansion of $$(1 + x + x^2 + x^3 +... + x^{2021})(1 + x^2 + x^4 + x^6 + ... + x^{4042})$$ have coefficients equal to $1011$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In Happy City there are $2014$ citizens called $A_1, A_2, \dots , A_{2014}$. Each of them is either [i]happy[/i] or [i]unhappy[/i] at any moment in time. The mood of any citizen $A$ changes (from being unhappy to being happy or vice versa) if and only if some other happy citizen smiles at $A$. On Monday morning there were $N$ happy citizens in the city. The following happened on Monday during the day: the citizen $A_1$ smiled at citizen $A_2$, then $A_2$ smiled at $A_3$, etc., and, finally, $A_{2013}$ smiled at $A_{2014}$. Nobody smiled at anyone else apart from this. Exactly the same repeated on Tuesday, Wednesday and Thursday. There were exactly $2000$ happy citizens on Thursday evening. Determine the largest possible value of $N$.

In a tennis ball factory there are $4$ machines $m_1 , m_2 , m_3 , m_4$, which produce, respectively, $10\%$, $20\%$, $30\%$ and $40\%$ of the balls that come out of the factory. The machine $m_1$ introduces defects in $1\%$ of the balls it manufactures, the machine $m_2$ in $2\%$, $m_3$ in $4\%$ and $m_4$ in $15\%$. Of the balls manufactured In one day, one is chosen at random and it turns out to be defective. What is the probability that Has this ball been made by the machine $ m_3$ ?

A finite set $S$ of points in the coordinate plane is called [i]overdetermined[/i] if $|S|\ge 2$ and there exists a nonzero polynomial $P(t)$, with real coefficients and of degree at most $|S|-2$, satisfying $P(x)=y$ for every point $(x,y)\in S$. For each integer $n\ge 2$, find the largest integer $k$ (in terms of $n$) such that there exists a set of $n$ distinct points that is [i]not[/i] overdetermined, but has $k$ overdetermined subsets. [i]Proposed by Carl Schildkraut[/i]

For a sequence $a_1,a_2,...,a_m$ of real numbers, define the following sets \[A=\{a_i | 1\leq i\leq m\}\ \text{and} \ B=\{a_i+2a_j | 1\leq i,j\leq m, i\neq j\}\] Let $n$ be a given integer, and $n>2$. For any strictly increasing arithmetic sequence of positive integers, determine, with proof, the minimum number of elements of set $A\triangle B$, where $A\triangle B$ $= \left(A\cup B\right) \setminus \left(A\cap B\right).$

Given an $8\times 8$ chess board, in how many ways can we select $56$ squares on the board while satisfying both of the following requirements: (a) All black squares are selected. (b) Exactly seven squares are selected in each column and in each row.

Let there be $2004$ be bicolor tiles, white on one side and black on the other, placed in a circle. A move consists of choosing a black piece and turning over three pieces: the chosen one, the one on its left and the one on its right. If at the beginning there is only one black piece, will it be possible, repeating the movement described, to make all the pieces have the white face up?

We are given an arbitrary $\bigtriangleup ABC$. a) Can we dissect $\bigtriangleup ABC$ in $4$ pieces, from which we can make two triangle similar to $\bigtriangleup ABC$ (each piece can be used only once)? Justify your answer! b) Is it possible that for every positive integer $n \ge 2$ , we are able to dissect $\bigtriangleup ABC$ in $2n$ pieces, from which we can make two triangles similar to $\bigtriangleup ABC$ (each piece can be used only once)? Justify your answer!

You are traveling in a foreign country whose currency consists of five different-looking kinds of coins. You have several of each coin in your pocket. You remember that the coins are worth $1, 2, 5, 10$, and $20$ florins, but you have no idea which coin is which and you don’t speak the local language. You find a vending machine where a single candy can be bought for $1$ florin: you insert any kind of coin, and receive $1$ candy plus any change owed. You can only buy one candy at a time, but you can buy as many as you want, one after the other. What is the least number of candies that you must buy to ensure that you can determine the values of all the coins? Prove that your answer is correct.

Towa has a hand of three different red cards and three different black cards. How many ways can Towa pick a set of three cards from her hand that uses at least one card of each color?

Let $n$ be a fixed positive integer. Initially, $n$ 1's are written on a blackboard. Every minute, David picks two numbers $x$ and $y$ written on the blackboard, erases them, and writes the number $(x+y)^4$ on the blackboard. Show that after $n-1$ minutes, the number written on the blackboard is at least $2^{\frac{4n^2-4}{3}}$. [i]Proposed by Calvin Deng[/i]

The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

$n^2$ real numbers are written in a square $n \times n$ table so that the sum of the numbers in each row and column equals zero. A move is to add a row to one column and subtract it from another (so if the entries are $a_{ij}$ and we select row $i$, column $h$ and column $k$, then column h becomes $a_{1h} + a_{i1}, a_{2h} + a_{i2}, ... , a_{nh} + a_{in}$, column $k$ becomes $a_{1k} - a_{i1}, a_{2k} - a_{i2}, ... , a_{nk} - a_{in}$, and the other entries are unchanged). Show that we can make all the entries zero by a series of moves.

Write a positive integer in each box so that: All six numbers are different. The sum of the six numbers is $100$. If each number is multiplied by its neighbor (in a clockwise direction) and the six results of those six multiplications are added, the smallest possible value is obtained. Explain why a lower value cannot be obtained. [img]https://cdn.artofproblemsolving.com/attachments/7/1/6fdadd6618f91aa03cdd6720cc2d6ee296f82b.gif[/img]

It is possible to place the $2014$ points in the plane so that we can construct $1006^2$ parralelograms with vertices among these points, so that the parralelograms have area 1?

A switch has two inputs $1, 2$ and two outputs $1, 2$. It either connects $1$ to $1$ and $2$ to $2$, or $1$ to $2$ and $2$ to 1. If you have three inputs $1, 2, 3$ and three outputs $1, 2, 3$, then you can use three switches, the first across $1$ and $2$, then the second across $2$ and $3$, and finally the third across $1$ and $2$. It is easy to check that this allows the output to be any permutation of the inputs and that at least three switches are required to achieve this. What is the minimum number of switches required for $4$ inputs, so that by suitably setting the switches the output can be any permutation of the inputs?

The set of all $10$-digit numbers may be represented as a union of two subsets: the subset $M$ consisting of all $10$-digit numbers, each of which may be represented as a product of two $5$-digit numbers, and the subset $N$ , containing the remaining $10$-digit numbers . Which of the sets $M$ and $N$ contains more elements? (S. Fomin , Leningrad)

Prove that there exists a set of infinitely many positive integers such that the elements of no finite subset of this set add up to a perfect square.