IMONST = [b]I[/b]nternational [b]M[/b]athematical [b]O[/b]lympiad [b]N[/b]ational [b]S[/b]election [b]T[/b]est Malaysia 2020 Round 1 Juniors 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. The number $N$ is the smallest positive integer with the sum of its digits equal to $2020$. What is the first (leftmost) digit of $N$? p2. At a food stall, the price of $16$ banana fritters is $k$ RM , and the price of $k$ banana fritters is $ 1$ RM . What is the price of one banana fritter, in sen? Note: $1$ RM is equal to $100$ sen. p3. Given a trapezium $ABCD$ with $AD \parallel$ to $BC$, and $\angle A = \angle B = 90^o$. It is known that the area of the trapezium is 3 times the area of $\vartriangle ABD$. Find $$\frac{area \,\, of \,\, \vartriangle ABC}{area \,\, of \,\, \vartriangle ABD}.$$ p4. Each $\vartriangle$ symbol in the expression below can be substituted either with $+$ or $-$: $$\vartriangle 1 \vartriangle 2 \vartriangle 3 \vartriangle 4.$$ How many possible values are there for the resulting arithmetic expression? Note: One possible value is $-2$, which equals $-1 - 2 - 3 + 4$. p5. How many $3$-digit numbers have its sum of digits equal to $4$? [b]Part B[/b] (2 points each) p6. Find the value of $$+1 + 2 + 3 - 4 - 5 - 6 + 7 + 8 + 9 - 10 - 11 - 12 +... - 2020$$ where the sign alternates between $+$ and $-$ after every three numbers. p7. If Natalie cuts a round pizza with $4$ straight cuts, what is the maximum number of pieces that she can get? Note: Assume that all the cuts are vertical (perpendicular to the surface of the pizza). She cannot move the pizza pieces until she finishes cutting. p8. Given a square with area $ A$. A circle lies inside the square, such that the circle touches all sides of the square. Another square with area $ B$ lies inside the circle, such that all its vertices lie on the circle. Find the value of $A/B$. p9. This sequence lists the perfect squares in increasing order: $$0, 1, 4, 9, 16, ... ,a, 10^8, b, ...$$ Determine the value of $b - a$. p10. Determine the last digit of $5^5 + 6^6 + 7^7 + 8^8 + 9^9$. [b]Part C[/b] (3 points each) p11. Find the sum of all integers between $-\sqrt{1442}$ and $\sqrt{2020}$. p12. Three brothers own a painting company called Tiga Abdul Enterprise. They are hired to paint a building. Wahab says, "I can paint this building in $3$ months if I work alone". Wahib says, "I can paint this building in $2$ months if I work alone". Wahub says, "I can paint this building in $k$ months if I work alone". If they work together, they can finish painting the building in $1$ month only. What is $k$? p13. Given a rectangle $ABCD$ with a point $P$ inside it. It is known that $PA = 17$, $PB = 15$, and $PC = 6$. What is the length of $PD$? p14. What is the smallest positive multiple of $225$ that can be written using digits $0$ and $ 1$ only? p15. Given positive integers $a, b$, and $c$ with $a + b + c = 20$. Determine the number of possible integer values for $\frac{a + b}{c}$. [b]Part D[/b] (4 points each) p16. If we divide $2020$ by a prime $p$, the remainder is $6$. Determine the largest possible value of $p$. p17. A football is made by sewing together some black and white leather patches. The black patches are regular pentagons of the same size. The white patches are regular hexagons of the same size. Each pentagon is bordered by $5$ hexagons. Each hexagons is bordered by $3$ pentagons and $3$ hexagons. We need $12$ pentagons to make one football. How many hexagons are needed to make one football? p18. Given a right-angled triangle with perimeter $18$. The sum of the squares of the three side lengths is $128$. What is the area of the triangle? p19. A perfect square ends with the same two digits. How many possible values of this digit are there? p20. Find the sum of all integers $n$ that fulfill the equation $2^n(6 - n) = 8n$.

Given $30$ students such that each student has at most $5$ friends and for every $5$ students there is a pair of students that are not friends, determine the maximum $k$ such that for all such possible configurations, there exists $k$ students who are all not friends.

In a park there are 23 trees $t_0,t_1,\dots,t_{22}$ in a circle and 22 birds $b_1,n_2,\dots,b_{22}.$ Initially, each bird is in a tree. Every minute, the bird $b_i, 1\leqslant i\leqslant 22$ flies from the tree $t_j{}$ to the tree $t_{i+j}$ in clockwise order, indices taken modulo 23. Prove that there exists a moment when at least 6 trees are empty.

A game consists of a grid of $4\times 4$ and tiles of two colors (Yellow and White). A player chooses a type of token and gives it to the second player who places it where he wants, then the second player chooses a type of token and gives it to the first who places it where he wants, They continue in this way and the one who manages to form a line with three tiles of the same color wins (horizontal, vertical or diagonal and regardless of whether it is the tile you started with or not). Before starting the game, two yellow and two white pieces are already placed as shows the figure below. [img]https://cdn.artofproblemsolving.com/attachments/b/5/ba11377252c278c4154a8c3257faf363430ef7.png[/img] Yolanda and Xinia play a game. If Yolanda starts (choosing the token and giving it to Xinia for this to place) indicate if there is a winning strategy for either of the two players and, if any, describe the strategy.

Let $n$ and $k$ be positive integers, and let be the sets $X=\{1,2,3,...,n\}$ and $Y=\{1,2,3,...,k\}$. Let $P$ be the set of all the subsets of the set $X$. Find the number of functions $ f: P \to Y$ that satisfy $f(A \cap B)=\min(f(A),f(B))$ for all $A,B \in P$.

On a $ 50 \times 50$ board, the centers of several unit squares are colored black. Find the maximum number of centers that can be colored black in such a way that no three black points form a right-angled triangle.

At a tourist camp, each person has at least $50$ and at most $100$ friends among the other persons at the camp. Show that one can hand out a t-shirt to every person such that the t-shirts have (at most) $1331$ different colors, and any person has $20$ friends whose t-shirts all have pairwisely different colors.

In a summer camp about Applied Maths, there are $8m+1$ boys (with $m > 5$) and some girls. Every girl is friend with exactly $3$ boys and for any $2$ boys, there is exactly $1$ girl who is their common friend. Let $n$ be the greatest number of girls that can be chosen from the camp to form a group such that every boy is friend with at most $1$ girl in the group. Prove that $n \geq 2m+1$.

Find the maximum number of sets which simultaneously satisfy the following conditions: [b]i)[/b] any of the sets consists of $4$ elements, [b]ii)[/b] any two different sets have exactly $2$ common elements, [b]iii)[/b] no two elements are common to all the sets.

A square $ABCD$ is divided into $(n - 1)^2$ congruent squares, with sides parallel to the sides of the given square. Consider the grid of all $n^2$ corners obtained in this manner. Determine all integers $n$ for which it is possible to construct a non-degenerate parabola with its axis parallel to one side of the square and that passes through exactly $n$ points of the grid.

Let $S=\{A_1,A_2,\ldots ,A_n\}$, where $A_1,A_2,\ldots ,A_n$ are $n$ pairwise distinct finite sets $(n\ge 2)$, such that for any $A_i,A_j\in S$, $A_i\cup A_j\in S$. If $k= \min_{1\le i\le n}|A_i|\ge 2$, prove that there exist $x\in \bigcup_{i=1}^n A_i$, such that $x$ is in at least $\frac{n}{k}$ of the sets $A_1,A_2,\ldots ,A_n$ (Here $|X|$ denotes the number of elements in finite set $X$).

You want to color the side faces of a cube in such a way that each face is colored evenly. Six colors are available: [i]red, white, blue, yellow, purple, orange[/i]. Two cube colors are called the same if one arises from the other by a rotation of the cube. (a) How many different cube colorings are there, using six colors? (b) How many different cube colorings are there, using exactly five colors?

Two are playing the game "cats and rats" on the chess-board $8\times 8$. The first has one piece -- a rat, the second -- several pieces -- cats. All the pieces have four available moves -- up, down, left, right -- to the neighbour field, but the rat can also escape from the board if it is on the boarder of the chess-board. If they appear on the same field -- the rat is eaten. The players move in turn, but the second can move all the cats in independent directions. a) Let there be two cats. The rat is on the interior field. Is it possible to put the cats on such a fields on the border that they will be able to catch the rat? b) Let there be three cats, but the rat moves twice during the first turn. Prove that the rat can escape.

There's a convex $3n$-polygon on the plane with a robot on each of it's vertices. Each robot fires a laser beam toward another robot. On each of your move,you select a robot to rotate counter clockwise until it's laser point a new robot. Three robots $A$, $B$ and $C$ form a triangle if $A$'s laser points at $B$, $B$'s laser points at $C$, and $C$'s laser points at $A$. Find the minimum number of moves that can guarantee $n$ triangles on the plane.

Using only the digits $2,3$ and $9$, how many six-digit numbers can be formed which are divisible by $6$?

We say that a finite set $\mathcal{S}$ of points in the plane is [i]balanced[/i] if, for any two different points $A$ and $B$ in $\mathcal{S}$, there is a point $C$ in $\mathcal{S}$ such that $AC=BC$. We say that $\mathcal{S}$ is [i]centre-free[/i] if for any three different points $A$, $B$ and $C$ in $\mathcal{S}$, there is no points $P$ in $\mathcal{S}$ such that $PA=PB=PC$. (a) Show that for all integers $n\ge 3$, there exists a balanced set consisting of $n$ points. (b) Determine all integers $n\ge 3$ for which there exists a balanced centre-free set consisting of $n$ points. Proposed by Netherlands

There are $10$ cities in each of the three countries. Each road connects two cities from two different countries (there is at most one road between any two cities.) There are more than $200$ roads between these three countries. Prove that three cities, one city from each country, can be chosen such that there is a road between any two of these cities.

Some cards each have a pair of numbers written on them. There is just one card for each pair $(a,b)$ with $1 \leq a < b \leq 2003$. Two players play the following game. Each removes a card in turn and writes the product $ab$ of its numbers on the blackboard. The first player who causes the greatest common divisor of the numbers on the blackboard to fall to $1$ loses. Which player has a winning strategy?

There are $40$ identical gas cylinders, gas pressure values in which we are unknown and may be evil. It is allowed to connect any cylinders with each other in an amount not exceeding a given natural number $k$, and then separate them; while the pressure gas in the connected cylinders is set equal to the arithmetic average of the pressures in them before the connection. At what minimum $k$ is there a way to equalize the pressures in all $40$ cylinders, regardless of initial pressure distribution in the cylinders?

Is it possible to fill a $3 \times 3$ grid with each of the numbers $1,2,\ldots,9$ once each such that the sum of any two numbers sharing a side is prime?

Let $S$ be an infinite set of positive integers, such that there exist four pairwise distinct $a,b,c,d \in S$ with $\gcd(a,b) \neq \gcd(c,d)$. Prove that there exist three pairwise distinct $x,y,z \in S$ such that $\gcd(x,y)=\gcd(y,z) \neq \gcd(z,x)$.

Let $n$ be an odd integer greater than $11$; $k\in \mathbb{N}$, $k \geq 6$, $n=2k-1$. We define \[d(x,y) = \left | \{ i\in \{1,2,\dots, n \} \bigm | x_i \neq y_i \} \right |\] for $T=\{ (x_1, x_2, \dots, x_n) \bigm | x_i \in \{0,1\}, i=1,2,\dots, n \}$ and $x=(x_1,x_2,\dots, x_n), y=(y_1, y_2, \dots, y_n) \in T$. Show that $n=23$ if $T$ has a subset $S$ satisfying [list=i] [*]$|S|=2^k$ [*]For each $x \in T$, there exists exacly one $y\in S$ such that $d(x,y)\leq 3$[/list]

In some city there are $2000000$ citizens. In every group of $2000$ citizens there are $3$ pairwise friends. Prove, that there are $4$ pairwise friends in city.

Let $X= \{A_1, A_2, A_3, A_4\}$ be a set of four distinct points in the plane. Show that there exists a subset $Y$ of $X$ with the property that there is no (closed) disk $K$ such that $K\cap X = Y$.

The Fibonacci numbers $F_0, F_1, F_2, . . .$ are defined inductively by $F_0=0, F_1=1$, and $F_{n+1}=F_n+F_{n-1}$ for $n \ge 1$. Given an integer $n \ge 2$, determine the smallest size of a set $S$ of integers such that for every $k=2, 3, . . . , n$ there exist some $x, y \in S$ such that $x-y=F_k$. [i]Proposed by Croatia[/i]