Attached to each of a number of objects is a tag which states the correct mass of the object. The tags have fallen off and have been replaced on the objects at random. We wish to determine if by chance all tags are in fact correct. We may use exactly once a horizontal lever which is supported at its middle. The objects can be hung from the lever at any point on either side of the support. The lever either stays horizontal or tilts to one side. Is this task always possible?

Prove that in the set $ \{1,2, \ldots, 1989\}$ can be expressed as the disjoint union of subsets $ A_i, \{i \equal{} 1,2, \ldots, 117\}$ such that [b]i.)[/b] each $ A_i$ contains 17 elements [b]ii.)[/b] the sum of all the elements in each $ A_i$ is the same.

In each one of the given $2019$ boxes, there are $2019$ stones numbered as $1,2,...,2019$ with total mass of $1$ kilogram. In all situations satisfying these conditions, if one can pick stones from different boxes with different numbers, with total mass of at least 1 kilogram, in $k$ different ways, what is the maximal of $k$?

A sleeping rabbit lies in the interior of a convex $2024$-gon. A hunter picks three vertices of the polygon and he lays a trap which covers the interior and the boundary of the triangular region determined by them. Determine the minimum number of times he needs to do this to guarantee that the rabbit will be trapped. [i]Proposed by Anant Mudgal and Rohan Goyal[/i]

Find all pairs \((m,n)\) of positive integers such that there exists a polyhedron, with all faces being regular polygons, such that each vertex of the polyhedron is the vertex of exactly three faces, two of them having \(m\) sides, and the other having \(n\) sides.

In an election, there are a total of $12$ candidates. An election committee has $6$ members voting. It is known that at most two candidates voted by any two committee members are the same. Find the maximum number of committee members.

A table of the type $~$ $ (n_1, n_2, ... , n_m) ,\ n_1 \ge n_2 \ge ... \ge n_m $ $~$ is defined in the following way: $~$ $n_1$ $~$ squares are ordered horizontally one next to another, then $~$ $n_2$ $~$ squares are ordered horizontally beneath the already ordered $~$ $n_1$ $~$ squares. The procedure continues until a net composed of $~$ $n_1$ $~$ squares in the first row, $~$ $n_2$ $~$ in the second, $~$ $n_i$ $~$ in the $~$ $i$-th row is obtained, such that there are totally $~$ $n=n_1+n_2+...+n_m$ $~$ squares in the net. The ordered rows form a straight line on the left, as shown in the example. The obtained table is filled with the numbers from $~$ $1$ $~$ till $~$ $n$ $~$ in a way that the numbers in each row and column become greater from left to right and from top to bottom, respectively. An example of a table of the type $~$ $(5,4,2,1)$ $~$ and one possible way of filling it is attached to the post. Find the number of ways the table of type $~$ $(4,3,2)$ $~$ can be filled.

From three boys and three girls, every boy knows exactly two girls and every girl knows exactly two boys. Prove that we can arrange boys and girls in pairs such that in every pair people know each other

Call an $n$-gon to be [i]lattice[/i] if its vertices are lattice points. Prove that inside every lattice convex pentagon there exists a lattice point.

[b]p1.[/b] Calculate $A \cdot B +M \cdot C$, where $A = 1$, $B = 2$, $C = 3$, $M = 13$. [b]p2.[/b] What is the remainder of $\frac{2022\cdot2023}{10}$ ? [b]p3.[/b] Daniel and Bryan are rolling fair $7$-sided dice. If the probability that the sum of the numbers that Daniel and Bryan roll is greater than $11$ can be represented as the fraction $\frac{a}{b}$ where $a$, $b$ are relatively prime positive integers, what is $a + b$? [b]p4.[/b] Billy can swim the breaststroke at $25$ meters per minute, the butterfly at $30$ meters per minute, and the front crawl at $40$ meters per minute. One day, he swam without stopping or slowing down, swimming $1130$ meters. If he swam the butterfly for twice as long as the breaststroke, plus one additional minute, and the front crawl for three times as long as the butterfly, minus eight minutes, for how many minutes did he swim? [b]p5.[/b] Elon Musk is walking around the circumference of Mars trying to find aliens. If the radius of Mars is $3396.2$ km and Elon Musk is $73$ inches tall, the difference in distance traveled between the top of his head and the bottom of his feet in inches can be expressed as $a\pi$ for an integer $a$. Find $a$. ($1$ yard is exactly $0.9144$ meters). [b]p6.[/b] Lukas is picking balls out of his five baskets labeled $1$,$2$,$3$,$4$,$5$. Each basket has $27$ balls, each labeled with the number of its respective basket. What is the least number of times Lukas must take one ball out of a random basket to guarantee that he has chosen at least $5$ balls labeled ”$1$”? If there are no balls in a chosen basket, Lukas will choose another random basket. [b]p7.[/b] Given $35_a = 42_b$, where positive integers $a$, $b$ are bases, find the minimum possible value of the sum $a + b$ in base $10$. [b]p8.[/b] Jason is playing golf. If he misses a shot, he has a $50$ percent chance of slamming his club into the ground. If a club is slammed into the ground, there is an $80$ percent chance that it breaks. Jason has a $40$ percent chance of hitting each shot. Given Jason must successfully hit five shots to win a prize, what is the expected number of clubs Jason will break before he wins a prize? [b]p9.[/b] Circle $O$ with radius $1$ is rolling around the inside of a rectangle with side lengths $5$ and $6$. Given the total area swept out by the circle can be represented as $a + b\pi$ for positive integers $a$, $b$ find $a + b$. [b]p10.[/b] Quadrilateral $ABCD$ has $\angle ABC = 90^o$, $\angle ADC = 120^o$, $AB = 5$, $BC = 18$, and $CD = 3$. Find $AD$. [b]p11.[/b] Raymond is eating huge burgers. He has been trained in the art of burger consumption, so he can eat one every minute. There are $100$ burgers to start with. However, at the end of every $20$ minutes, one of Raymond’s friends comes over and starts making burgers. Raymond starts with $1$ friend. If each of his friends makes $1$ burger every $20$ minutes, after how long in minutes will there be $0$ burgers left for the first time? [b]p12.[/b] Find the number of pairs of positive integers $(a, b)$ and $b\le a \le 2022$ such that $a\cdot lcm(a, b) = b \cdot gcd(a, b)^2$. [b]p13.[/b] Triangle $ABC$ has sides $AB = 6$, $BC = 10$, and $CA = 14$. If a point $D$ is placed on the opposite side of $AC$ from $B$ such that $\vartriangle ADC$ is equilateral, find the length of $BD$. [b]p14.[/b] If the product of all real solutions to the equation $(x-1)(x-2)(x-4)(x-5)(x-7)(x-8) = -x^2+9x-64$ can be written as $\frac{a-b\sqrt{c}}{d}$ for positive integers $a$, $b$, $c$, $d$ where $gcd(a, b, d) = 1$ and $c$ is squarefree, compute $a + b + c + d$. [b]p15.[/b] Joe has a calculator with the keys $1, 2, 3, 4, 5, 6, 7, 8, 9,+,-$. However, Joe is blind. If he presses $4$ keys at random, and the expected value of the result can be written as $\frac{x}{11^4}$ , compute the last $3$ digits of $x$ when $x$ divided by $1000$. (If there are consecutive signs, they are interpreted as the sign obtained when multiplying the two signs values together, e.g $3$,$+$,$-$,$-$, $2$ would return $3 + (-(-(2))) = 3 + 2 = 5$. Also, if a sign is pressed last, it is ignored.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In a tennis tournament where $ n$ players $ A_1,A_2,\dots,A_n$ take part, any two players play at most one match, and $ k \leq \frac {n(n \minus{} 1)}{2}$ $ 2$ matches are played. The winner of a match gets $ 1$ point while the loser gets $ 0$. Prove that a sequence $ d_1,d_2,\dots,d_n$ of nonnegative integers can be the sequence of scores of the players ($ d_i$ being the score of$ A_i$) if and only if $ (i)\ \ d_1 \plus{} d_2 \plus{} \dots \plus{} d_n \equal{} k$, and $ (ii)\ \text{for any} X\subset\{A_1,\dots,A_n\}$, the number of matches between the players in $ X$ is at most $ \sum_{A_j\in X}d_j$

A card deck consists of $1024$ cards. On each card, a set of distinct decimal digits is written in such a way that no two of these sets coincide (thus, one of the cards is empty). Two players alternately take cards from the deck, one card per turn. After the deck is empty, each player checks if he can throw out one of his cards so that each of the ten digits occurs on an even number of his remaining cards. If one player can do this but the other one cannot, the one who can is the winner; otherwise a draw is declared. Determine all possible first moves of the first player after which he has a winning strategy. [i]Proposed by Ilya Bogdanov & Vladimir Bragin, Russia[/i]

A square $ABCD$ is divided into $n^2$ equal small (fundamental) squares by drawing lines parallel to its sides.The vertices of the fundamental squares are called vertices of the grid.A rhombus is called [i]nice[/i] when: $\bullet$ It is not a square $\bullet$ Its vertices are points of the grid $\bullet$ Its diagonals are parallel to the sides of the square $ABCD$ Find (as a function of $n$) the number of the [i]nice[/i] rhombuses ($n$ is a positive integer greater than $2$).

Let $P$ be a regular $2n$-sided polygon. A [b]rhombus-ulation[/b] of $P$ is dividing $P$ into rhombuses such that no two intersect and no vertex of any rhombus is on the edge of other rhombuses or $P$. (a) Prove that number of rhombuses is a function of $n$. Find the value of this function. Also find the number of vertices and edges of the rhombuses as a function of $n$. (b) Prove or disprove that there always exists an edge $e$ of $P$ such that by erasing all the segments parallel to $e$ the remaining rhombuses are connected. (c) Is it true that each two rhombus-ulations can turn into each other using the following algorithm multiple times? Algorithm: Take a hexagon -not necessarily regular- consisting of 3 rhombuses and re-rhombus-ulate the hexagon. (d) Let $f(n)$ be the number of ways to rhombus-ulate $P$. Prove that:\[\Pi_{k=1}^{n-1} ( \binom{k}{2} +1) \leq f(n) \leq \Pi_{k=1}^{n-1} k^{n-k} \]

Is it possible to cover the plane with (infinite) circles so that exactly $2020$ circles pass through each point on the plane?

In each cell of a table $8\times 8$ lives a knight or a liar. By the tradition, the knights always say the truth and the liars always lie. All the inhabitants of the table say the following statement "The number of liars in my column is (strictly) greater than the number of liars in my row". Determine how many possible configurations are compatible with the statement.

At a party there were some couples attending. As they arrive each person gets to talk with all the other persons which are [i]already [/i] in the room. During the party, after all the guests arrive, groups of persons form, such that no two persons forming a couple belong to the same group, and for each two persons that do not form a couple, there is one and only one group to which both belong. Find the number of couples attending the party, knowing that there are less groups than persons at the party.

Three integers are written on a blackboard. At every step one of them is erased and the sum of the other two decreased by $1$ is written instead. Is it possible to obtain the numbers $17,75,91$ if the three initial numbers were: $\textbf{(a)}~2,2,2$; $\textbf{(b)}~3,3,3$?

Find the smallest integer $b$ with the following property: For each way of colouring exactly $b$ squares of an $8 \times 8$ chessboard green, one can place $7$ bishops on $7$ green squares so that no two bishops attack each other.

Let $k$ be a fixed positive integer, $k \le 10$. Given a list of ten numbers, the allowed operation is: choose $k$ numbers from the list, and add $1$ to each of them. Thus, a new list of ten numbers is obtained. If you initially have the list $1,2,3,4,5,6,7,8,9,10$, determine the values of $k$ for which it is possible, through a sequence of allowed operations, to obtain a list that has the ten equal numbers. In each case indicate the sequence.

In a school six different courses are taught: mathematics, physics, biology, music, history, geography. The students were required to rank these courses according to their preferences, where equal preferences were allowed. It turned out that: [list] [*][b](i)[/b] mathematics was ranked among the most preferred courses by all students; [*][b](ii)[/b] no student ranked music among the least preferred ones; [*][b](iii) [/b]all students preferred history to geography and physics to biology; and [*][b](iv)[/b] no two rankings were the same. [/list] Find the greatest possible value for the number of students in this school.

[b]Problem Section #4 c) A special deck of cards contains $49$ cards, each labeled with a number from $1$ to $7$ and colored with one of seven colors. Each number-color combination appears on exactly one card. John will select a set of eight cards from the deck at random. Given that he gets at least one card of each color and at least one card with each number, the probability that John can discard one of his cards and still have at least one card of each color and at least one card with each number is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

How many dominoes can be placed on a at least $3 \times 12$ board, such so that it is impossible to place a $1\times 3$, $3 \times 1$, or $ 2 \times 2$ tile on what remains of the board? Clarification: Each domino covers exactly two squares on the board. The chips cannot overlap.

Let $s$ and $t$ be two parallel lines. We have marked $k$ points on line $s$ and $n$ points on line $t$ ($k\geq n$). If it is known that the total number of triangles that have their three vertices at marked points is $220$, find all possible values of $k$ and $n$.

In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements. [i]Proposed by Jorge Tipe, Peru[/i]