Fix $2n$ distinct reals $x_1,y_1,...,x_n,y_n$ and dene the $n\times n$ matrix where its $(i, j)$-th element is $x_i + y_j$ for all $i, j = 1,..., n$. Show that if the products of the numbers in each column is always the same, then also the products of the numbers in each row is always the same. ( Alberto Alfarano)

There are $n$ people arranged in a circle, and $n^{n^n}$ coins are distributed among them, where each person has at least $n^n$ coins. Each person is then assigned a random index number in $\{1,2,...n\}$ such that no two people have the same number. Then every minute, if $i$ is the number of minutes passed, the person with index number congruent to $i$ mod $n$ will give a coin to the person on his left or right. After some time, everyone has the same number of coins. For what $n$ is this always possible, regardless of the original distribution of coins and index numbers? [i](Proposed by Ho Janson)[/i]

Is it possible for some natural number $k$ to divide all natural numbers from $1$ to $k$ into two groups and write down the numbers in each group in a row in some order so that you get two the same numbers? [hide=original wording beacuse it doesn't make much sense]Можно ли при каком-то натуральном k разбить все натуральные числа от 1 до k на две группы и выписать числа в каждой группе подряд в некотором порядке так, чтобы получились два одинаковых числа?[/hide]

In a country, there are $28$ cities and between some cities there are two-way flights. In every city there is exactly one airport and this airport is either small or medium or big. For every route which contains more than two cities, doesn't contain a city twice and ends where it begins; has all types of airports. What is the maximum number of flights in this country?

Consider $n$ cards with marked numbers $1$ through $n$. No number have repeted, namely, each number has marked exactly at one card. They are distributed on $n$ boxes so that each box contains exactly one card initially. We want to move all the cards into one box all together according to the following instructions The instruction: Choose an integer $k(1\le k\le n)$, and move a card with number $k$ to the other box such that sum of the number of the card in that box is multiple of $k$. Find all positive integer $n$ so that there exists a way to gather all the cards in one box. Thanks to @scnwust for correcting wrong translation.

A safe is protected with a number of locks. Eleven members of the committee have keys for some of the locks. What is the smallest number of locks necessary so that every six members of the committee can open the safe, but no five members can do it? How should the keys be distributed among the committee members if the number of locks is the smallest?

There are 52 cards in the deck, 13 of each suit. Vanya draws from the deck one card at a time. Removed cards are not returned to the deck. Every time Before taking out the card, Vanya makes a wish for some suit.Prove that if Vanya makes a wish every time, , the cards of which are in the deck has no less cards left than cards of any other suit, then the hidden suit will fall with the suit of the card drawn at least 13 times.

Let $ k,m,n$ be integers such that $ 1 < n \leq m \minus{} 1 \leq k.$ Determine the maximum size of a subset $ S$ of the set $ \{1,2,3, \ldots, k\minus{}1,k\}$ such that no $ n$ distinct elements of $ S$ add up to $ m.$

Let $N$ be the number of tuples $(a_1, a_2,..., a_{150})$ satisfying: $\bullet$ $a_i \in \{2, 3, 5, 7, 11\}$ for all $1 \le i \le 99$. $\bullet$ $a_i \in \{2, 4, 6, 8\}$ for all $100 \le i \le 150$. $\bullet$ $\sum^{150}_{i=1}a_i$ is divisible by $8$. Compute the last three digits of $N$.

Suppose that $ T$ is a tree with $ k$ edges. Prove that the $ k$-dimensional cube can be partitioned to graphs isomorphic to $ T$.

Several squares on a $15 \times 15$ chessboard are marked so that a bishop placed on any square of the board attacks at least two of marked squares. Find the minimal number of marked squares.

To date, in each Mathematics Olympiad Final, no participant has been able to solve all the problems, but every problem has been solved by at least one participant. Prove that in each Final, there was a participant $A$ who solved a problem $P_A$ and another participant $B$ who solved a problem $P_B$ such that $A$ did not solve $P_B$ and $B$ did not solve $P_A$.

$22$ mathematicians are meeting together. Each mathematician has at least $3$ friends (friends are mutual). And each mathematician can pass his or her information to any mathematician through the transfer between friends. Is it possible to divide these $22$ mathematicians into $2$-person groups (that is, two people in each group, a total of $11$ groups), so that the mathematicians in each group are friends? [hide=original wording in Chinese]仃22位数学家一起开会.每位数学家都至少有3个朋友(朋友是相互的).而且每 位数学家都可以通过朋友之间的传递.将门已的资料传给任意一位数学家.问：是否一定可 以将这22位数学家两两分组(即每组两人,共11组),使得每组的数学家都是朋友？[/hide]

Given a circle and $2006$ points lying on this circle. Albatross colors these $2006$ points in $17$ colors. After that, Frankinfueter joins some of the points by chords such that the endpoints of each chord have the same color and two different chords have no common points (not even a common endpoint). Hereby, Frankinfueter intends to draw as many chords as possible, while Albatross is trying to hinder him as much as he can. What is the maximal number of chords Frankinfueter will always be able to draw?

In La-La-Land there are 5784 cities. Alpaca chooses for each pair of cities to either build a road or a river between them, and additionally she places a fish in each city to defend it. Subsequently Bear chooses a city to start his trip. At first, he chooses whether to take his trip in a car or in a boat. A boat can sail through rivers but not drive on roads, and a car can drive on roads but not sail through rivers. When Bear enters a city he takes the fish defending it, and consequently the city collapses and he can't return to it again. What is the maximum number of fish Bear can guarantee himself, regardless of the construction of the paths? Remarks: Bear takes a fish also from the city he begins his trip from (and the city collapses). All roads and rivers are two-way.

[b]p1.[/b] In rectangle $ABMC$, $AB= 5$ and $BM= 8$. If point $X$ is the midpoint of side $AC$, what is the area of triangle $XCM$? [b]p2.[/b] Find the sum of all possible values of $a+b+c+d$ such that $(a, b, c, d)$ are quadruplets of (not necessarily distinct) prime numbers satisfying $a \cdot b \cdot c \cdot d = 4792$. [b]p3.[/b] How many integers from $1$ to $2022$ inclusive are divisible by $6$ or $24$, but not by both? [b]p4.[/b] Jerry begins his English homework at $07:39$ a.m. At $07:44$ a.m., he has finished $2.5\%$ of his homework. Subsequently, for every five minutes that pass, he completes three times as much homework as he did in the previous five minute interval. If Jerry finishes his homework at $AB : CD$ a.m., what is $A + B + C + D$? For example, if he finishes at $03:14$ a.m., $A + B + C + D = 0 + 3 + 1 + 4$. [b]p5.[/b] Advay the frog jumps $10$ times on Mondays, Wednesdays and Fridays. He jumps $7$ times on Tuesdays and Saturdays. He jumps $5$ times on Thursdays and Sundays. How many times in total did Advay jump in November if November $17$th falls on a Thursday? (There are $30$ days in November). [b]p6.[/b] In the following diagram, $\angle BAD\cong \angle DAC$, $\overline{CD} = 2\overline{BD}$, and $ \angle AEC$ and $\angle ACE$ are complementary. Given that $\overline{BA} = 210$ and $\overline{EC} = 525$, find $\overline{AE}$. [img]https://cdn.artofproblemsolving.com/attachments/5/3/8e11caf2d7dbb143a296573f265e696b4ab27e.png[/img] [b]p7.[/b] How many trailing zeros are there when $2021!$ is expressed in base $2021$? [b]p8.[/b] When two circular rings of diameter $12$ on the Olympic Games Logo intersect, they meet at two points, creating a $60^o$ arc on each circle. If four such intersections exist on the logo, and no region is in $3$ circles, the area of the regions of the logo that exist in exactly two circles is $a\pi - b\sqrt{c}$ where $a$, $b$, $c$ are positive integers and $\sqrt{c}$ is fully simplified find $a + b + c$. [b]p9.[/b] If $x^2 + ax - 3$ is a factor of $x^4 - x^3 + bx^2 - 5x - 3$, then what is $|a + b|$? [b]p10.[/b] Let $(x, y, z)$ be the point on the graph of $x^4 +2x^2y^2 +y^4 -2x^2 -2y^2 +z^2 +1 = 0$ such that $x+y +z$ is maximized. Find $a+b$ if $xy +xz +yz$ can be expressed as $\frac{a}{b}$ where $a$, $b$ are relatively prime positive integers. [b]p11.[/b] Andy starts driving from Pittsburgh to Columbus and back at a random time from $12$ pm to $3$ pm. Brendan starts driving from Pittsburgh to Columbus and back at a random time from $1$ pm to $4$ pm. Both Andy and Brendan take $3$ hours for the round trip, and they travel at constant speeds. The probability that they pass each other closer to Pittsburgh than Columbus is$ m/n$, for relatively prime positive integers $m$ and $n$. What is $m + n$? [b]p12.[/b] Consider trapezoid $ABCD$ with $AB$ parallel to $CD$ and $AB < CD$. Let $AD \cap BC = O$, $BO = 5$, and $BC = 11$. Drop perpendicular $AH$ and $BI$ onto $CD$. Given that $AH : AD = \frac23$ and $BI : BC = \frac56$ , calculate $a + b + c + d - e$ if $AB + CD$ can be expressed as $\frac{a\sqrt{b} + c\sqrt{d}}{e}$ where $a$, $b$, $c$, $d$, $e$ are integers with $gcd(a, c, e) = 1$ and $\sqrt{b}$, $\sqrt{d}$ are fully simplified. [b]p13.[/b] The polynomials $p(x)$ and $q(x)$ are of the same degree and have the same set of integer coefficients but the order of the coefficients is different. What is the smallest possible positive difference between $p(2021)$ and $q(2021)$? [b]p14.[/b] Let $ABCD$ be a square with side length $12$, and $P$ be a point inside $ABCD$. Let line $AP$ intersect $DC$ at $E$. Let line $DE$ intersect the circumcircle of $ADP$ at $F \ne D$. Given that line $EB$ is tangent to the circumcircle of $ABP$ at $B$, and $FD = 8$, find $m + n$ if $AP$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$, $n$. [b]p15.[/b] A three digit number $m$ is chosen such that its hundreds digit is the sum of the tens and units digits. What is the smallest positive integer $n$ such that $n$ cannot divide $m$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

How many sequences of integers $(a_1, ... , a_7)$ are there for which $-1 \le a_i \le 1$ for every $i$, and $$a_1a_2 + a_2a_3 + a_3a_4 + a_4a_5 + a_5a_6 + a_6a_7 = 4 ?$$

A chess piece is placed on one of the squares of an $8\times 8$ chessboard where it begins a tour of the board: it moves from square to square, only moving horizontally or vertically. It visits every square precisely once, and ends up exactly where it started. What is the maximum number of times the piece can change direction along its tour?

A circle is divided by $2N$ points into $2N$ arcs of length $1$. These points are joined in pairs to form $N$ chords. Each chord divides the circle into two arcs, the length of each being an even integer. Prove that $N$ is even.

[b]p1.[/b] How many subsets of $\{D,U,K,E\}$ have an odd number of elements? [b]p2.[/b] Find the coefficient of $x^{12}$ in $(1 + x^2 + x^4 +... + x^{28})(1 + x + x^2 + ...+ x^{14})^2$. [b]p3.[/b] How many $4$-digit numbers have their digits in non-decreasing order from left to right? [b]p4.[/b] A dodecahedron (a polyhedron with $12$ faces, each a regular pentagon) is projected orthogonally onto a plane parallel to one of its faces to form a polygon. Find the measure (in degrees) of the largest interior angle of this polygon. [b]p5.[/b] Justin is back with a $6\times 6$ grid made of $36$ colorless squares. Dr. Kraines wants him to color some squares such that $\bullet$ Each row and column of the grid must have at least one colored square $\bullet$ For each colored square, there must be another colored square on the same row or column What is the minimum number of squares that Justin will have to color? [b]p6.[/b] Inside a circle $C$, we have three equal circles $C_1$, $C_2$, $C_3$, which are pairwise externally tangent to each other and all internally tangent to $C$. What is the ratio of the area of $C_1$ to the area of $C$? [b]p7.[/b] There are $3$ different paths between the Duke Chapel and the Physics building. $6$ students are heading towards the Physics building for a class, so they split into $3$ pairs and each pair takes a separate path from the Chapel. After class, they again split into $3$ pairs and take separate paths back. Find the number of possible scenarios where each student's companion on the way there is different from their companion on the way back. [b]p8.[/b] Let $a_n$ be a sequence that satisfies the recurrence relation $$a_na_{n+2} =\frac{\cos (3a_{n+1})}{\cos (a_{n+1})[2 \cos(2a_{n+1}) - 1]}a_{n+1}$$ with $a_1 = 2$ and $a_2 = 3$. Find the value of $2018a_{2017}$. [b]p9.[/b] Let $f(x)$ be a polynomial with minimum degree, integer coefficients, and leading coefficient of $1$ that satisfies $f(\sqrt7 +\sqrt{13})= 0$. What is the value of $f(10)$? [b]p10.[/b] $1024$ Duke students, indexed $1$ to $1024$, are having a chat. For each $1 \le i \le 1023$, student $i$ claims that student $2^{\lfloor \log_2 i\rfloor +1}$ has a girlfriend. ($\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.) Given that exactly $201$ people are lying, find the index of the $61$st liar (ordered by index from smallest to largest). PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that there exists a partition of the set $A = \{1^3, 2^3, \ldots , 2000^3\}$ into $19$ nonempty subsets such that the sum of elements of each subset is divisible by $2001^2$.

There is a population $P$ of $10000$ bacteria, some of which are friends (friendship is mutual), so that each bacterion has at least one friend and if we wish to assign to each bacterion a coloured membrane so that no two friends have the same colour, then there is a way to do it with $2021$ colours, but not with $2020$ or less. Two friends $A$ and $B$ can decide to merge in which case they become a single bacterion whose friends are precisely the union of friends of $A$ and $B$. (Merging is not allowed if $A$ and $B$ are not friends.) It turns out that no matter how we perform one merge or two consecutive merges, in the resulting population it would be possible to assign $2020$ colours or less so that no two friends have the same colour. Is it true that in any such population $P$ every bacterium has at least $2021$ friends?

In a class with $n$ students in the span of $k$ days, each day are chosen three to be tested. Each two students can be taken in such triple only once. Prove that for the greatest $k$ satisfying these conditions, the following inequalities are true: $\frac{n(n-3)}{6}\leq k\leq \frac{n(n-1)}{6}$.

It is known that each vertex of the convex polyhedron $P$ belongs to three different faces, and each vertex of $P$ can be dyed black and white, so that the two endpoints of each edge of $P$ are different colors. Proof: The interior of each edge of $P$ can be dyed red, yellow, and blue, so that the colors of the three edges connected to each vertex are different, and each face contains two colors of edges. [i]Created by Liang Xiao[/i]

For a triple $(m,n,r)$ of integers with $0 \le r \le n \le m-2$, define $p(m,n,r)=\sum^r_{k=0} (-1)^k \dbinom{m+n-2(k+1)}{n} \dbinom{r}{k}$. Prove that $p(m,n,r)$ is positive and that $\sum^n_{r=0} p(m,n,r)=\dbinom{m+n}{n}$.