Mom brought Andriy and Olesya $4$ balls with the numbers $1, 2, 3$ and $4$ written on them (one on each ball). She held $2$ balls in each hand and did not know which numbers were written on the balls in each hand. The mother asked Andriy to take a ball with a higher number from each hand, and then to keep the ball with the lower number from the two balls he took. After that, she asked Olesya to take two other balls, and out of these two, keep the ball with the higher number. Does the mother know with certainty, which child has the ball with the higher number? [i]Proposed by Bogdan Rublov[/i]

Let $k$ be an integer in the interval $[1,99]$. A fair coin is to be flipped $100$ times. Let $$\varepsilon_j =\begin{cases} 1, \text{if the j-th flip is a head} \\ 2, \text{f the j-th flip is a tail}\end{cases}$$ Let $M_k$ denote the probability that there exists a number $i$ such that $k+\varepsilon_1 +...+\varepsilon_i = 100$. How to choose $k$ so as to maximize the probability $M_k$?

Let $n \ge 2$ be a positive integer and $\mathcal{F}$ the set of functions $f:\{1,2,\ldots,n\} \to \{1,2,\ldots,n\}$ that satisfy $f(k) \le f(k+1) \le f(k)+1,$ for all $k \in \{1,2,\ldots,n-1\}.$ a) Find the cardinal of the set $\mathcal{F}.$ b) Find the total number of fixed points of the functions in $\mathcal{F}.$

Given a permutation ($a_0, a_1, \ldots, a_n$) of the sequence $0, 1,\ldots, n$. A transportation of $a_i$ with $a_j$ is called legal if $a_i=0$ for $i>0$, and $a_{i-1}+1=a_j$. The permutation ($a_0, a_1, \ldots, a_n$) is called regular if after a number of legal transportations it becomes ($1,2, \ldots, n,0$). For which numbers $n$ is the permutation ($1, n, n-1, \ldots, 3, 2, 0$) regular?

A subsum of $n$ real numbers $a_1,\dots,a_n$ is a sum of elements of a subset of the set $\{a_1,\dots,a_n\}$. In other words a subsum is $\epsilon_1a_1+\dots+\epsilon_na_n$ in which for each $1\leq i \leq n$ ,$\epsilon_i$ is either $0$ or $1$. Years ago, there was a valuable list containing $n$ real not necessarily distinct numbers and their $2^n-1$ subsums. Some mysterious creatures from planet Tarator has stolen the list, but we still have the subsums. (a) Prove that we can recover the numbers uniquely if all of the subsums are positive. (b) Prove that we can recover the numbers uniquely if all of the subsums are non-zero. (c) Prove that there's an example of the subsums for $n=1392$ such that we can not recover the numbers uniquely. Note: If a subsum is sum of element of two different subsets, it appears twice. Time allowed for this question was 75 minutes.

Find all positive integers $n\geq 3$ such that it is possible to triangulate a convex $n$-gon such that all vertices of the $n$-gon have even degree.

A regular 60-gon is given. What is the maximum size of a subset of its vertices containing no isosceles triangles?

Indicate whether it is possible to write the integers $1, 2, 3, 4, 5, 6, 7, 8$ at the vertices of an regular octagon such that the sum of the numbers of any $3$ consecutive vertices is greater than: a) $11$. b) $13$.

International Mathematical Olympiad National Selection Test Malaysia 2021 Round 1 Primary Time: 2.5 hours [hide=Rules] $\bullet$ For each problem you have to submit the answer only. The answer to each problem is a non-negative integer. $\bullet$ No mark is deducted for a wrong answer. $\bullet$ The maximum number of points is (1 + 2 + 3 + 4) x 5 = 50 points.[/hide] [b]Part A[/b] (1 point each) p1. Faris has six cubes on his table. The cubes have a total volume of $2021$ cm$^3$. Five of the cubes have side lengths $5$ cm, $5$ cm, $6$ cm, $6$ cm, and $11$ cm. What is the side length of the sixth cube (in cm)? p2. What is the sum of the first $200$ even positive integers? p3. Anushri writes down five positive integers on a paper. The numbers are all different, and are all smaller than $10$. If we add any two of the numbers on the paper, then the result is never $10$. What is the number that Anushri writes down for certain? p4. If the time now is $10.00$ AM, what is the time $1,000$ hours from now? Note: Enter the answer in a $12$-hour system, without minutes and AM/PM. For example, if the answer is $9.00$ PM, just enter $9$. p5. Aminah owns a car worth $10,000$ RM. She sells it to Neesha at a $10\%$ profit. Neesha sells the car back to Aminah at a $10\%$ loss. How much money did Aminah make from the two transactions, in RM? [b]Part B[/b] (2 points each) p6. Alvin takes 250 small cubes of side length $1$ cm and glues them together to make a cuboid of size $5$ cm  $\times 5$ cm  $\times 10$ cm. He paints all the faces of the large cuboid with the color green. How many of the small cubes are painted by Alvin? p7. Cikgu Emma and Cikgu Tan select one integer each (the integers do not have to be positive). The product of the two integers they selected is $2021$. How many possible integers could have been selected by Cikgu Emma? p8. A three-digit number is called [i]superb[/i] if the first digit is equal to the sum of the other two digits. For example, $431$ and $909$ are superb numbers. How many superb numbers are there? p9. Given positive integers $a, b, c$, and $d$ that satisfy the equation $4a = 5b =6c = 7d$. What is the smallest possible value of $ b$? p10. Find the smallest positive integer n such that the digit sum of n is divisible by $5$, and the digit sum of $n + 1$ is also divisible by $5$. Note: The digit sum of $1440$ is $1 + 4 + 4 + 0 = 9$. [b]Part C[/b] (3 points each) p11. Adam draws $7$ circles on a paper, with radii $ 1$ cm, $2$ cm, $3$ cm, $4$ cm, $5$ cm, $6$ cm, and $7$ cm. The circles do not intersect each other. He colors some circles completely red, and the rest of the circles completely blue. What is the minimum possible difference (in cm$^2$) between the total area of the red circles and the total area of the blue circles? p12. The number $2021$ has a special property that the sum of any two neighboring digits in the number is a prime number ($2 + 0 = 2$, $0 + 2 = 2$, and $2 + 1 = 3$ are all prime numbers). Among numbers from $2021$ to $2041$, how many of them have this property? p13. Clarissa opens a pet shop that sells three types of pets: goldshes, hamsters, and parrots. The pets inside the shop together have a total of $14$ wings, $24$ heads, and $62$ legs. How many goldshes are there inside Clarissa's shop? p14. A positive integer $n$ is called [i]special [/i] if $n$ is divisible by $4$, $n+1$ is divisible by $5$, and $n + 2$ is divisible by $6$. How many special integers smaller than $1000$ are there? p15. Suppose that this decade begins on $ 1$ January $2020$ (which is a Wednesday) and the next decade begins on $ 1$ January $2030$. How many Wednesdays are there in this decade? [b]Part D[/b] (4 points each) p16. Given an isosceles triangle $ABC$ with $AB = AC$. Let D be a point on $AB$ such that $CD$ is the bisector of $\angle ACB$. If $CB = CD$, what is $\angle ADC$, in degrees? p17. Determine the number of isosceles triangles with the following properties: all the sides have integer lengths (in cm), and the longest side has length $21$ cm. p18. Haz marks $k$ points on the circumference of a circle. He connects every point to every other point with straight lines. If there are $210$ lines formed, what is $k$? p19. What is the smallest positive multiple of $24$ that can be written using digits $4$ and $5$ only? p20. In a mathematical competition, there are $2021$ participants. Gold, silver, and bronze medals are awarded to the winners as follows: (i) the number of silver medals is at least twice the number of gold medals, (ii) the number of bronze medals is at least twice the number of silver medals, (iii) the number of all medals is not more than $40\%$ of the number of participants. The competition director wants to maximize the number of gold medals to be awarded based on the given conditions. In this case, what is the maximum number of bronze medals that can be awarded? PS. Problems 11-20 were also used in [url=https://artofproblemsolving.com/community/c4h2676837p23203256]Juniors [/url]as 1-10.

Each of the small squares of a $50\times 50$ table is coloured in red or blue. Initially all squares are red. A [i]step[/i] means changing the colour of all squares on a row or on a column. a) Prove that there exists no sequence of steps, such that at the end there are exactly $2011$ blue squares. b) Describe a sequence of steps, such that at the end exactly $2010$ squares are blue. [i]Adriana & Lucian Dragomir[/i]

Establish if we can rewrite the numbers $1,2,3,4,5,6,7,8,9,10$ in a row in such a way that: (a) The sum of any three consecutive numbers (in the new order) does not exceed $16$. (b) The sum of any three consecutive numbers (in the new order) does not exceed $15$.

In a club, some pairs of members are friends. Given an integer $k \geqslant 3$, we say a club is $k$-[i]friendly[/i] if, in any group of $k$ members, they can be seated at a round table such that each pair of neighbors are friends. [list=a] [*]Prove that if a club is $6$-friendly, then it is also $7$-friendly. [*]Is it true that if a club is $9$-friendly, then it is also $10$-friendly? [/list]

The NIMO problem writers have invented a new chess piece called the [i]Oriented Knight[/i]. This new chess piece has a limited number of moves: it can either move two squares to the right and one square upward or two squares upward and one square to the right. How many ways can the knight move from the bottom-left square to the top-right square of a $16\times 16$ chess board? [i] Proposed by Tony Kim and David Altizio [/i]

Natural numbers $1, 2, 3,.., 100$ are contained in the union of $N$ geometric progressions (not necessarily with integer denominations). Prove that $N \ge 31$

The pupil is training in the square equation solution. Having the recurrent equation solved, he stops, if it doesn't have two roots, or solves the next equation, with the free coefficient equal to the greatest root, the coefficient at $x$ equal to the least root, and the coefficient at $x^2$ equal to $1$. Prove that the process cannot be infinite. What maximal number of the equations he will have to solve?

For each positive integer $k$, define $r(k)$ as the number of runs of $k$ in base-$2$, where a run is a collection of consecutive $0$s or consecutive $1$s without a larger one containing it. For example, $(11100100)_2$ has $4$ runs, namely $111-00-1-00$. Also, $r(0) = 0$. Given a positive integer $n$, find all functions $f : \mathbb{Z} \rightarrow\mathbb{Z}$ such that \[\sum_{k=0}^{2^n-1} 2^{r(k)}f(k+(-1)^{k} x)=(-1)^{x+n}\text{ for all integer $x$.}\] [i]Proposed by YaWNeeT[/i]

There are $n$ ($n \ge 4$) straight lines on the plane. For two straight lines $a$ and $b$, if there are at least two straight lines among the remaining $n-2$ lines that intersect both straight lines $a$ and $b$, then $a$ and $b$ are called a [i]congruent [/i] pair of staight lines, otherwise it is called a [i]separated[/i] pair of straight lines. If the number of [i]congruent [/i] pairs of straight line among $n$ straight lines is $2012$ more than the number of [i]separated[/i] pairs of straight line , find the smallest possible value of $n$ (the order of the two straight lines in a pair is not counted).

A Haiku is a Japanese poem of seventeen syllables, in three lines of five, seven, and five. Using the four words “Hi”, “hey”, “hello”, and “haiku”, How many haikus Can somebody make? (Repetition is allowed, Order does matter.) [i]Proposed by Jeff Lin[/i]

Find the number of permutations of the letters $AAAABBBCC$ where no letter is next to another letter of the same type. For example, count $ABCABCABA$ and $ABABCABCA$ but not $ABCCBABAA$.

Consider a convex polygon having $n$ vertices, $n\geq 4$. We arbitrarily decompose the polygon into triangles having all the vertices among the vertices of the polygon, such that no two of the triangles have interior points in common. We paint in black the triangles that have two sides that are also sides of the polygon, in red if only one side of the triangle is also a side of the polygon and in white those triangles that have no sides that are sides of the polygon. Prove that there are two more black triangles that white ones.

Several napkins of equal size and of shape of a unit disc were placed on a table (with overlappings). Is it always possible to hammer several point-sized nails so that all the napkins will be thus attached to the table with the same number of nails? (The nails cannot be hammered into the borders of the discs). Vladimir Dolnikov, Pavel Kozhevnikov

[b]p1.[/b] Compute $2017 + 7201 + 1720 + 172$. [b]p2. [/b]A number is called [i]downhill [/i]if its digits are distinct and in descending order. (For example, $653$ and $8762$ are downhill numbers, but $97721$ is not.) What is the smallest downhill number greater than 86432? [b]p3.[/b] Each vertex of a unit cube is sliced off by a planar cut passing through the midpoints of the three edges containing that vertex. What is the ratio of the number of edges to the number of faces of the resulting solid? [b]p4.[/b] In a square with side length $5$, the four points that divide each side into five equal segments are marked. Including the vertices, there are $20$ marked points in total on the boundary of the square. A pair of distinct points $A$ and $B$ are chosen randomly among the $20$ points. Compute the probability that $AB = 5$. [b]p5.[/b] A positive two-digit integer is one less than five times the sum of its digits. Find the sum of all possible such integers. [b]p6.[/b] Let $$f(x) = 5^{4^{3^{2^{x}}}}.$$ Determine the greatest possible value of $L$ such that $f(x) > L$ for all real numbers $x$. [b]p7.[/b] If $\overline{AAAA}+\overline{BB} = \overline{ABCD}$ for some distinct base-$10$ digits $A, B, C, D$ that are consecutive in some order, determine the value of $ABCD$. (The notation $\overline{ABCD}$ refers to the four-digit integer with thousands digit $A$, hundreds digit $B$, tens digit $C$, and units digit $D$.) [b]p8.[/b] A regular tetrahedron and a cube share an inscribed sphere. What is the ratio of the volume of the tetrahedron to the volume of the cube? [b]p9.[/b] Define $\lfloor x \rfloor$ as the greatest integer less than or equal to x, and ${x} = x - \lfloor x \rfloor$ as the fractional part of $x$. If $\lfloor x^2 \rfloor =2 \lfloor x \rfloor$ and $\{x^2\} =\frac12 \{x\}$, determine all possible values of $x$. [b]p10.[/b] Find the largest integer $N > 1$ such that it is impossible to divide an equilateral triangle of side length $ 1$ into $N$ smaller equilateral triangles (of possibly different sizes). [b]p11.[/b] Let $f$ and $g$ be two quadratic polynomials. Suppose that $f$ has zeroes $2$ and $7$, $g$ has zeroes $1$ and $ 8$, and $f - g$ has zeroes $4$ and $5$. What is the product of the zeroes of the polynomial $f + g$? [b]p12.[/b] In square $PQRS$, points $A, B, C, D, E$, and $F$ are chosen on segments $PQ$, $QR$, $PR$, $RS$, $SP$, and $PR$, respectively, such that $ABCDEF$ is a regular hexagon. Find the ratio of the area of $ABCDEF$ to the area of $PQRS$. [b]p13.[/b] For positive integers $m$ and $n$, define $f(m, n)$ to be the number of ways to distribute $m$ identical candies to $n$ distinct children so that the number of candies that any two children receive differ by at most $1$. Find the number of positive integers n satisfying the equation $f(2017, n) = f(7102, n)$. [b]p14.[/b] Suppose that real numbers $x$ and $y$ satisfy the equation $$x^4 + 2x^2y^2 + y^4 - 2x^2 + 32xy - 2y^2 + 49 = 0.$$ Find the maximum possible value of $\frac{y}{x}$. [b]p15.[/b] A point $P$ lies inside equilateral triangle $ABC$. Let $A'$, $B'$, $C'$ be the feet of the perpendiculars from $P$ to $BC, AC, AB$, respectively. Suppose that $PA = 13$, $PB = 14$, and $PC = 15$. Find the area of $A'B'C'$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Compute the number of nonempty subsets $S$ of $\{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}$ such that $\frac{\max \,\, S + \min \,\,S}{2}$ is an element of $S$.

What is the largest integer $n$ such that one can find $n$ points on the surface of a cube, not all lying on one face and being the vertices of a regular $n$-gon? (A Shapovalov)

3. A 6×6 square has been tiled by 18 dominoes. Show that there exists a line that divides the square into two parts, each of which is also tiled by dominoes