In a sports competition in which several tests are carried out, only the three athletes $A, B, C$. In each event, the winner receives $x$ points, the second receives $y$ points, and the third receives $z$ points. There are no ties, and the numbers $x, y, z$ are distinct positive integers with $x$ greater than $y$, and $y$ greater than $z$. At the end of the competition it turns out that $A$ has accumulated $20$ points, $B$ has accumulated $10$ points and $C$ has accumulated $9$ points. We know that athlete $A$ was second in the 100-meter event. Determine which of the three athletes he was second in the jumping event.

A graph $G$ with $n$ vertex is called [i]good [/i] if every vertex could be labelled with distinct positive integers which are less than or equal $\lfloor \frac{n^2}{4} \rfloor$ such that there exists a set of nonnegative integers $D$ with the following property: there exists an edge between $2$ vertices if and only if the difference of their labels is in $D$. Show that there exists a positive integer $N$ such that for every $n \ge N$, there exist a not-good graph with $n$ vertices.

In a circle four distinct points are fixed and each of them is assigned with a real number. Let those numbers be $x_1,x_2,x_3,x_4$ such that $x_1+x_2+x_3+x_4>0$. Now we define a game with these numbers: If one of them, i.e. $x_i$, is a negative number, the player makes a move by adding the number $x_i$ to his neighbors and changes the sign of the chosen number. The game ends when all the numbers are negative. Prove that this game ends in a finite number of steps.

Alice, Bob, and Chris each roll $4$ dice. Each only knows the result of their own roll. Alice claims that there are at least $5$ multiples of $3$ among the dice rolled. Bob has $1$ six and no threes, and knows that Alice wouldn’t claim such a thing unless he had at least $2$ multiples of $3$. Bob can call Alice a liar, or claim that there are at least $6$ multiples of $3$, but Chris says that he will immediately call Bob a liar if he makes this claim. Bob wins if he calls Alice a liar and there aren't at least $5$ multiples of $3$, or if he claims there are at least $6$ multiples of $3$, and there are. What is the probability that Bob loses no matter what he does?

Given an $m\times n$ grid with unit squares coloured either black or white, a black square in the grid is [i]stranded [/i]if there is some square to its left in the same row that is white and there is some square above it in the same column that is white. Find a closed formula for the number of $2\times n$ grids with no stranded black square. Note that $n$ is any natural number and the formula must be in terms of $n$ with no other variables.

Let $n$ points be given inside a rectangle $R$ such that no two of them lie on a line parallel to one of the sides of $R$. The rectangle $R$ is to be dissected into smaller rectangles with sides parallel to the sides of $R$ in such a way that none of these rectangles contains any of the given points in its interior. Prove that we have to dissect $R$ into at least $n + 1$ smaller rectangles. [i]Proposed by Serbia[/i]

[b]p1.[/b] Sarah needed a ride home to the farm from town. She telephoned for her father to come and get her with the pickup truck. Being eager to get home, she began walking toward the farm as soon as she hung up the phone. However, her father had to finish milking the cows, so could not leave to get her until fifteen minutes after she called. He drove rapidly to make up for lost time. They met on the road, turned right around and drove back to the farm at two-thirds of the speed her father drove coming. They got to the farm two hours after she had called. She walked and he drove both ways at constant rates of speed. How many minutes did she spend walking? [b]p2.[/b] Let $A = (a,b)$ be any point in a coordinate plane distinct from the origin $O$. Let $M$ be the midpoint of $OA$, and let $P$ be a point such that $MP$ is perpendicular to $OA$ and the lengths $\overline{MP}$ and $\overline{OM}$ are equal. Determine the coordinates $(x,y)$ of $P$ in terms of $a$ and $b$. Give all possible solutions. [b]p3.[/b] Determine the exact sum of the series $$\frac{1}{1 \cdot 2\cdot 3} + \frac{1}{2\cdot 3\cdot 4} + \frac{1}{3\cdot 4\cdot 5} + ... + \frac{1}{98\cdot 99\cdot 100}$$ [b]p4.[/b] A six pound weight is attached to a four foot nylon cord that is looped over two pegs in the manner shown in the drawing. At $B$ the cord passes through a small loop in its end. The two pegs $A$ and $C$ are one foot apart and are on the same level. When the weight is released the system obtains an equilibrium position. Determine angle $ABC$ for this equilibrium position, and verify your answer. (Your verification should assume that friction and the weight of the cord are both negligible, and that the tension throughout the cord is a constant six pounds.) [img]https://cdn.artofproblemsolving.com/attachments/a/1/620c59e678185f01ca8743c39423234d5ba04d.png[/img] [b]p5.[/b] The four corners of a rectangle have the property that when they are taken three at a time, they determine triangles all of which have the same perimeter. We will consider whether a set of five points can have this property. Let $S = \{p_1, p_2, p_3, p_4, p_5\}$ be a set of five points. For each $i$ and $j$, let $d_{ij}$ denote the distance from $p_i$ to $p_j$. Suppose that $S$ has the property that all triangles with vertices in $S$ have the same perimeter. (a) Prove that $d$ must be the same for every pair $(i,j)$ with $i \ne j$. (b) Can such a five-element set be found in three dimensional space? Justify your answer. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In the table $n \times n$ numbers from $1$ to $n$ are written in a spiral way. For which $n$ all the numbers on the main diagonal are distinct?

Suppose $ \,G\,$ is a connected graph with $ \,k\,$ edges. Prove that it is possible to label the edges $ 1,2,\ldots ,k\,$ in such a way that at each vertex which belongs to two or more edges, the greatest common divisor of the integers labeling those edges is equal to 1. [b]Note: Graph-Definition[/b]. A [b]graph[/b] consists of a set of points, called vertices, together with a set of edges joining certain pairs of distinct vertices. Each pair of vertices $ \,u,v\,$ belongs to at most one edge. The graph $ G$ is connected if for each pair of distinct vertices $ \,x,y\,$ there is some sequence of vertices $ \,x \equal{} v_{0},v_{1},v_{2},\cdots ,v_{m} \equal{} y\,$ such that each pair $ \,v_{i},v_{i \plus{} 1}\;(0\leq i < m)\,$ is joined by an edge of $ \,G$.

In the plane we have $16$ lines(not parallel and not concurrents), we have $120$ point(s) of intersections of this lines. Sebastian has to paint this $120$ points such that in each line all the painted points are with colour differents, find the minimum(quantity) of colour(s) that Sebastian needs to paint this points. If we have have $15$ lines(in this situation we have $105$ points), what's the minimum(quantity) of colour(s)?

Let $n\ge 2$ be an integer. Elwyn is given an $n\times n$ table filled with real numbers (each cell of the table contains exactly one number). We define a [i]rook set[/i] as a set of $n$ cells of the table situated in $n$ distinct rows as well as in n distinct columns. Assume that, for every rook set, the sum of $n$ numbers in the cells forming the set is nonnegative.\\ \\ By a move, Elwyn chooses a row, a column, and a real number $a,$ and then he adds $a$ to each number in the chosen row, and subtracts $a$ from each number in the chosen column (thus, the number at the intersection of the chosen row and column does not change). Prove that Elwyn can perform a sequence of moves so that all numbers in the table become nonnegative.

Let $A$ be a non empty subset of positive reals such that for every $a,b,c \in A$, the number $ab+bc+ca$ is rational. Prove that $\frac{a}{b}$ is a rational for every $a,b \in A$.

Consider a binary matrix $M$(all entries are $0$ or $1$) on $r$ rows and $c$ columns, where every row and every column contain at least one entry equal to $1$. Prove that there exists an entry $M(i,j) = 1$, such that the corresponding row-sum $R(i)$ and column-sum $C(j)$ satisfy $r R(i)\ge c C(j)$. (Proposed by Gerhard Woeginger, Austria)

We are given a family of discs in the plane, with pairwise disjoint interiors. Each disc is tangent to at least six other discs of the family. Show that the family is infinite.

Tsrutsuna starts in the bottom left cell of a 7 × 7 square table, while Tsuna is in the upper right cell. The center cell of the table contains cheese. Tsrutsuna wants to reach Tsuna and bring a piece of cheese with him. From a cell Tsrutsuna can only move to the right or the top neighboring cell. Determine the number of different paths Tsrutsuna can take from the lower left cell to the upper right cell, such that he passes through the center cell. [i]Proposed by Giorgi Arabidze, Georgia[/i]

We have placed some red and blue points along a circle. The following operations are permitted: (a) we may add a red point somewhere and switch the color of its neighbors, (b) we may take off a red point from somewhere and switch the color of its neighbors (if there are at least $3$ points on the circle and there is a red one too). Initially, there are two blue points on the circle. Using a number of these operations, can we reach a state with exactly two red point?

Let $a$ and $b$ be distinct positive integers. The following infinite process takes place on an initially empty board. [list=i] [*] If there is at least a pair of equal numbers on the board, we choose such a pair and increase one of its components by $a$ and the other by $b$. [*] If no such pair exists, we write two times the number $0$. [/list] Prove that, no matter how we make the choices in $(i)$, operation $(ii)$ will be performed only finitely many times. Proposed by [I]Serbia[/I].

A $2024$-[i]table [/i]is a table with two rows and $2024$ columns containg all the numbers $1,2,\dots,4048$. Such a table is [i]evenly coloured[/i] if exactly half of the numbers in each row, and one number in each column, is coloured red. The [i]red sum[/i] in an evenly coloured $2024$-table is the sum of all the red numbers in the table. Let $N$ be the largest number such that every $2024$-table has an even colouring with red sum $\ge N$. Determine $N$, and find the number of $2024$-tables such that every even colouring of the table has red sum $\le N$.

In a deck of cards, there are $kn$ cards numbered from $1$ to $n$ and there are $k$ cards of each number. Now, divide this deck into $k$ sub-decks with equal sizes. Prove that if $\gcd(k,n)=1$, then one could always pick $n$ cards, one from each sub-deck, such that the sum of those cards is divisible by $n$.

Let $ n$ and $ k$ be positive integers. Please, find an explicit formula for \[ \sum y_1y_2 \dots y_k,\] where the summation runs through all $ k\minus{}$tuples positive integers $ (y_1,y_2,\dots,y_k)$ satisfying $ y_1\plus{}y_2\plus{}\dots\plus{}y_k\equal{}n$.

Let $n\ge 1$ and $a_1<a_2<\dots<a_n$ be integers. Let $S$ be the set of pairs $1\le i<j\le n$ for which $a_j-a_i$ is a power of $2$, and $T$ be the set of pairs $1\le i<j\le n$ with $j-i$ a power of $2$. (Here, the powers of $2$ are $1,2,4,\dots$.) Prove that $|S|\le |T|$.

Let $a_{1}$, $a_{2}$, …, $a_{6}$; $b_{1}$, $b_{2}$, …, $b_{6}$ and $c_{1}$, $c_{2}$, …, $c_{6}$ are all permutations of $1$, $2$, …, $6$, respectively. Find the minimum value of $\sum_{i=1}^{6}a_{i}b_{i}c_{i}$.

In a faraway place in the Universe, a villain has a medal with special powers and wants to hide it so that no one else can use it. For this, the villain hides it in a vertex of a regular polygon with $2019$ sides. Olcoman, the savior of the Olcomita people, wants to get the medal to restore peace in the Universe, for which you have to pay $1000$ olcolones for each time he makes the following move: on each turn he chooses a vertex of the polygon, which turns green if the medal is on it or in one of the four vertices closest to it, or otherwise red. Find the fewest olcolones Olcoman needs to determine with certainty the position of the medal.

Prove that for any finite set $A$ of positive integers, there exists a subset $B$ of $A$ satisfying the following conditions: [list][*]if $b_1,b_2\in B$ are distinct, then neither $b_1$ and $b_2$ nor $b_1+1$ and $b_2+1$ are multiples of each other, and [*] for any $a\in A$, we can find a $b\in B$ such that $a$ divides $b$ or $b+1$ divides $a+1$.[/list]

The Bank of Oslo issues two types of coin: aluminum (denoted A) and bronze (denoted B). Marianne has $n$ aluminum coins and $n$ bronze coins arranged in a row in some arbitrary initial order. A chain is any subsequence of consecutive coins of the same type. Given a fixed positive integer $k \leq 2n$, Gilberty repeatedly performs the following operation: he identifies the longest chain containing the $k^{th}$ coin from the left and moves all coins in that chain to the left end of the row. For example, if $n=4$ and $k=4$, the process starting from the ordering $AABBBABA$ would be $AABBBABA \to BBBAAABA \to AAABBBBA \to BBBBAAAA \to ...$ Find all pairs $(n,k)$ with $1 \leq k \leq 2n$ such that for every initial ordering, at some moment during the process, the leftmost $n$ coins will all be of the same type.