Let $n$ be a positive integer not divisible by $3$. A triangular grid of length $n$ is obtained by dissecting a regular triangle with length $n$ into $n^2$ unit regular triangles. There is an orange at each vertex of the grid, which sums up to \[\frac{(n+1)(n+2)}{2}\] oranges. A triple of oranges $A,B,C$ is [i]good[/i] if each $AB,AC$ is some side of some unit regular triangles, and $\angle BAC = 120^{\circ}$. Each time, Yen can take away a good triple of oranges from the grid. Determine the maximum number of oranges Yen can take.

Let be given integers k and n such that 1<=k<=n. Find the number of ordered k-tuples (a_1,a_2,...,a_n), where a_1, a_2, ..., a_k are different and in the set {1,2,...,n}, satisfying 1) There exist s, t such that 1<=s<t<=k and a_s>a_t. 2) There exists s such that 1<=s<=k and a_s is not congruent to s mod 2. P.S. This is the only problem from VMO 1996 I cannot find a solution or I cannot solve. But I'm not good at all in combinatoric...

Viktor and Natalia bought $2020$ buckets of ice-cream and want to organize a degustation schedule with $2020$ rounds such that: - In every round, both of them try $1$ ice-cream, and those $2$ ice-creams tried in a single round are different from each other. - At the end of the $2020$ rounds, both of them have tried each ice-cream exactly once. We will call a degustation schedule fair if the number of ice-creams that were tried by Viktor before Natalia is equal to the number of ice creams tried by Natalia before Viktor. Prove that the number of fair schedules is strictly larger than $2020!(2^{1010} + (1010!)^2)$. [i]Proposed by Viktor Simjanoski, Macedonia [/i]

Two people, $A$ and $B$, play the game of blowing up a balloon. The balloon will explode only when the volume of the balloon $V>2014$ mL. $A$ blows in $1$ mL first, and then they takes turns blowing. It is agreed that the gas blown by each person must not be less than the gas blown by the other party last time and should not be more than twice the amount of gas the other party blew last time. The agreement is that the person who blows up the balloon loses. Who has a winning strategy ? Briefly explain it. (Do not consider the change in volume caused by the change in tension when the balloon is inflated).

You have a collection of at least two tokens where each one has a number less than or equal to 10 written on it. The sum of the numbers on the tokens is \( S \). Find all possible values of \( S \) that guarantee that the tokens can be separated into two groups such that the sum of each group does not exceed 80.

This problem is generalization of [url=http://www.mathlinks.ro/Forum/viewtopic.php?t=5918]this one[/url]. Suppose $G$ is a graph and $S\subset V(G)$. Suppose we have arbitrarily assign real numbers to each element of $S$. Prove that we can assign numbers to each vertex in $G\backslash S$ that for each $v\in G\backslash S$ number assigned to $v$ is average of its neighbors.

Let \( m \) and \( n \) be positive integers. Kellem and Carmen play the following game: initially, the number $0$ is on the board. Starting with Kellem and alternating turns, they add powers of \( m \) to the previous number on the board, such that the new value on the board does not exceed \( n \). The player who writes \( n \) wins. Determine, for each pair \( (m, n) \), who has the winning strategy. [b]Note:[/b] A power of \( m \) is a number of the form \( m^k \), where \( k \) is a non-negative integer.

a tournament is playing between n persons. Everybody plays with everybody one time. There is no draw here. A number $k$ is called $n$ good if there is any tournament such that in that tournament they have any player in the tournament that has lost all of $k$'s. prove that 1. $n$ is greater than or equal to $2^{k+1}-1$ 2.Find all $n$ such that $2$ is a n-good

Find all permutations $a_1, a_2, \ldots, a_9$ of $1, 2, \ldots, 9$ such that \[ a_1+a_2+a_3+a_4=a_4+a_5+a_6+a_7= a_7+a_8+a_9+a_1 \] and \[ a_1^2+a_2^2+a_3^2+a_4^2=a_4^2+a_5^2+a_6^2+a_7^2= a_7^2+a_8^2+a_9^2+a_1^2 \]

Let $ A\equal{}\{1,2,\ldots, 2008\}$. We will say that set $ X$ is an $ r$-set if $ \emptyset \neq X \subset A$, and $ \sum_{x\in X} x \equiv r \pmod 3$. Let $ X_r$, $ r\in\{0,1,2\}$ be the set of $ r$-sets. Find which one of $ X_r$ has the most elements.

There are some people in a meeting; each doesn't know at least 56 others, and for any pair, there exist a third one who knows both of them. Can the number of people be 65?

Given are $50$ distinct sets of positive integers, each of size $30$, such that every $30$ of them have a common element. Prove that all of them have a common element.

Show how to divide space into (a) congruent tetrahedra, (b) congruent “equifaced” tetrahedra. (A tetrahedron is called equifaced if all its faces are congruent triangles.) (NB Vassiliev)

$n$ symbols line up in a row, numbered as $1,2,...,n$ from left to right. Delete every symbol with squared numbers. Renumber the rest from left to right. Repeat the process until all $n$ symbols are deleted. Let $f(n)$ be the initial number of the last symbol deleted. Find $f(n)$ in terms of $n$ and find $f(2019)$.

We are given a certain number of identical sets of weights; each set consists of four different weights expressed by natural numbers (of weight units). Using these weights we are able to weigh out every integer mass up to $1985$ (inclusive). How many ways are there to compose such a set of weight sets given that the joint mass of all weights is the least possible?

Ezzie is walking around the perimeter of a regular hexagon. Each vertex of the hexagon has an instruction telling him to move clockwise or counterclockwise around the hexagon. However, when he leaves a vertex the instruction switches from clockwise to counterclockwise on that vertex, or vice versa. We say that a configuration $C$ of Ezzie’s position and the instructions on the vertices is [I]irrepeatable[/I] if, when starting from configuration $C,$ configuration $C$ only appears finitely many more times. Find the number of irrepeatable configurations.

Let $A{}$ be a point in the Cartesian plane. At each step, Ann tells Bob a number $0\leqslant a\leqslant 1$ and he then moves $A{}$ in one of the four cardinal directions, at his choice, by a distance of $a{}.$ This process cotinues as long as Ann wishes. Amongst every 100 consecutive moves, each of the four possible moves should have been made at least once. Ann's goal is to force Bob to eventually choose a point at a distance greater than 100 from the initial position of $A.{}$ Can Ann achieve her goal? [i]Selected from an Argentine Olympiad[/i]

On an infinite chessboard, a solitaire game is played as follows: at the start, we have $n^2$ pieces occupying a square of side $n.$ The only allowed move is to jump over an occupied square to an unoccupied one, and the piece which has been jumped over is removed. For which $n$ can the game end with only one piece remaining on the board?

There are $ n$ markers, each with one side white and the other side black. In the beginning, these $ n$ markers are aligned in a row so that their white sides are all up. In each step, if possible, we choose a marker whose white side is up (but not one of the outermost markers), remove it, and reverse the closest marker to the left of it and also reverse the closest marker to the right of it. Prove that, by a finite sequence of such steps, one can achieve a state with only two markers remaining if and only if $ n \minus{} 1$ is not divisible by $ 3$. [i]Proposed by Dusan Dukic, Serbia[/i]

Two infinite rows of evenly-spaced dots are aligned as in the figure below. Arrows point from every dot in the top row to some dot in the lower row in such a way that: [list][*]No two arrows point at the same dot. [*]Now arrow can extend right or left by more than 1006 positions.[/list] [img]https://cdn.artofproblemsolving.com/attachments/7/6/47abf37771176fce21bce057edf0429d0181fb.png[/img] Show that at most 2012 dots in the lower row could have no arrow pointing to them.

Among 6 coins one is counterfeit (its weight differs from that real one and neither weights is known). Using scales that show the total weight of coins placed on the cup, find the counterfeit coin in 3 weighings. [i](5 points)[/i]

[u]Round 1[/u] [b]p1.[/b] Ravi has a bag with $100$ slips of paper in it. Each slip has one of the numbers $3, 5$, or $7$ written on it. Given that half of the slips have the number $3$ written on them, and the average of the values on all the slips is $4.4$, how many slips have $7$ written on them? [b]p2.[/b] In triangle $ABC$, point $D$ lies on side $AB$ such that $AB \perp CD$. It is given that $\frac{CD}{BD}=\frac12$, $AC = 29$, and $AD = 20$. Find the area of triangle $BCD$. [b]p3.[/b] Compute $(123 + 4)(123 + 5) - 123\cdot 132$. [u]Round 2[/u] [b]p4. [/b] David is evaluating the terms in the sequence $a_n = (n + 1)^3 - n^3$ for $n = 1, 2, 3,....$ (that is, $a_1 = 2^3 - 1^3$ , $a_2 = 3^3 - 2^3$, $a_3 = 4^3 - 3^3$, and so on). Find the first composite number in the sequence. (An positive integer is composite if it has a divisor other than 1 and itself.) [b]p5.[/b] Find the sum of all positive integers strictly less than $100$ that are not divisible by $3$. [b]p6.[/b] In how many ways can Alex draw the diagram below without lifting his pencil or retracing a line? (Two drawings are different if the order in which he draws the edges is different, or the direction in which he draws an edge is different). [img]https://cdn.artofproblemsolving.com/attachments/9/6/9d29c23b3ca64e787e717ceff22d45851ae503.png[/img] [u]Round 3[/u] [b]p7.[/b] Fresh Mann is a $9$th grader at Euclid High School. Fresh Mann thinks that the word vertices is the plural of the word vertice. Indeed, vertices is the plural of the word vertex. Using all the letters in the word vertice, he can make $m$ $7$-letter sequences. Using all the letters in the word vertex, he can make $n$ $6$-letter sequences. Find $m - n$. [b]p8.[/b] Fresh Mann is given the following expression in his Algebra $1$ class: $101 - 102 = 1$. Fresh Mann is allowed to move some of the digits in this (incorrect) equation to make it into a correct equation. What is the minimal number of digits Fresh Mann needs to move? [b]p9.[/b] Fresh Mann said, “The function $f(x) = ax^2+bx+c$ passes through $6$ points. Their $x$-coordinates are consecutive positive integers, and their y-coordinates are $34$, $55$, $84$, $119$, $160$, and $207$, respectively.” Sophy Moore replied, “You’ve made an error in your list,” and replaced one of Fresh Mann’s numbers with the correct y-coordinate. Find the corrected value. [u]Round 4[/u] [b]p10.[/b] An assassin is trying to find his target’s hotel room number, which is a three-digit positive integer. He knows the following clues about the number: (a) The sum of any two digits of the number is divisible by the remaining digit. (b) The number is divisible by $3$, but if the first digit is removed, the remaining two-digit number is not. (c) The middle digit is the only digit that is a perfect square. Given these clues, what is a possible value for the room number? [b]p11.[/b] Find a positive real number $r$ that satisfies $$\frac{4 + r^3}{9 + r^6}=\frac{1}{5 - r^3}- \frac{1}{9 + r^6}.$$ [b]p12.[/b] Find the largest integer $n$ such that there exist integers $x$ and $y$ between $1$ and $20$ inclusive with $$\left|\frac{21}{19} -\frac{x}{y} \right|<\frac{1}{n}.$$ PS. You had better use hide for answers. Last rounds have been posted [url=https://artofproblemsolving.com/community/c4h2784267p24464980]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Each cell of a $1000\times 1000$ table contains $0$ or $1$. Prove that one can either cut out $990$ rows so that at least one $1$ remains in each column, or cut out $990$ columns so that at least one $0$ remains in each row.

A staircase-brick with 3 steps of width 2 is made of 12 unit cubes. Determine all integers $ n$ for which it is possible to build a cube of side $ n$ using such bricks.

Let $S$ be a subset with $673$ elements of the set $\{1,2,\ldots ,2010\}$. Prove that one can find two distinct elements of $S$, say $a$ and $b$, such that $6$ divides $a+b$.