Initially, a word of $250$ letters with $125$ letters $A$ and $125$ letters $B$ is written on a blackboard. In each operation, we may choose a contiguous string of any length with equal number of letters $A$ and equal number of letters $B$, reverse those letters and then swap each $B$ with $A$ and each $A$ with $B$ (Example: $ABABBA$ after the operation becomes $BAABAB$). Decide if it possible to choose initial word, so that after some operations, it will become the same as the first word, but in reverse order.

Consider 2n+1 coins lying in a circle. At the beginning, all the coins are heads up. Moving clockwise, 2n+1 flips are performed: one coin is flipped, the next coin is skipped, the next coin is flipped, the next two coins are skipped, the next coin is flipped,the next three coins are skipped and so on, until finally 2n coins are skipped and the next coin is flipped.Prove that at the end of this procedure,exactly one coin is heads down.

Let $A_n$ be the set of all sequences with length $n$ and members of the set $\{1,2…q\}$. We denote with $B_n$ a subset of $A_n$ with a minimal number of elements with the following property: For each sequence $a_1,a_2,...,a_n$ from $A_n$ there exist a sequence $b_1,b_2,...,b_n$ from $B_n$ such that $a_i\neq b_i$ for each $i=1,2,....,n$. Prove that, if $q>n$, then $|B_n |=n+1$.

Let $\mathbb X$ be the set of all bijective functions from the set $S=\{1,2,\cdots, n\}$ to itself. For each $f\in \mathbb X,$ define \[T_f(j)=\left\{\begin{aligned} 1, \ \ \ & \text{if} \ \ f^{(12)}(j)=j,\\ 0, \ \ \ & \text{otherwise}\end{aligned}\right.\] Determine $\sum_{f\in\mathbb X}\sum_{j=1}^nT_{f}(j).$ (Here $f^{(k)}(x)=f(f^{(k-1)}(x))$ for all $k\geq 2.$)

9.2 Given 19 cards. Is it possible to write a nonzero digit on each card in such a way that you can compose from these cards an unique 19-digits number, which is divisible by 11? ([i]R. Zhenodarov, I. Bogdanov[/i])

Can one cover a cube by three paper triangles (without overlapping)?

Determine all pairs $(m,n)$ of positive integers such that a $m\times n$ rectangle can be tiled with L-trominoes.

There are $n$ light bulbs in a circle and one of them is marked. Let operation $A$: Take a positive divisor $d$ of the number $n,$ starting with the light bulb marked and clockwise, we count around the circumference from $1$ to $dn$, changing the state (on or off) to those light bulbs that correspond to the multiples of $d$. Let operation $B$ be: Apply operation$ A$ to all positive divisors of $n$ (to the first divider that is applied is with all the light bulbs off and the remaining divisors is with the state resulting from the previous divisor). Determine all the positive integers $n$, such that when applying the operation on $B$, all the light bulbs are on.

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.

Let $n$ be a natural number. A sequence $x_1,x_2, \cdots ,x_{n^2}$ of $n^2$ numbers is called $n-\textit{good}$ if each $x_i$ is an element of the set $\{1,2,\cdots ,n\}$ and the ordered pairs $\left(x_i,x_{i+1}\right)$ are all different for $i=1,2,3,\cdots ,n^2$ (here we consider the subscripts modulo $n^2$). Two $n-$good sequences $x_1,x_2,\cdots ,x_{n^2}$ and $y_1,y_2,\cdots ,y_{n^2}$ are called $\textit{similar}$ if there exists an integer $k$ such that $y_i=x_{i+k}$ for all $i=1,2,\cdots,n^2$ (again taking subscripts modulo $n^2$). Suppose that there exists a non-trivial permutation (i.e., a permutation which is different from the identity permutation) $\sigma$ of $\{1,2,\cdots ,n\}$ and an $n-$ good sequence $x_1,x_2,\cdots,x_{n^2}$ which is similar to $\sigma\left(x_1\right),\sigma\left(x_2\right),\cdots ,\sigma\left(x_{n^2}\right)$. Show that $n\equiv 2\pmod{4}$.

Some checkers placed on an $n \times n$ checkerboard satisfy the following conditions: (a) every square that does not contain a checker shares a side with one that does; (b) given any pair of squares that contain checkers, there is a sequence of squares containing checkers, starting and ending with the given squares, such that every two consecutive squares of the sequence share a side. Prove that at least $(n^{2}-2)/3$ checkers have been placed on the board.

In the space are given $2006$ distinct points, such that no $4$ of them are coplanar. One draws a segment between each pair of points. A natural number $m$ is called [i]good[/i] if one can put on each of these segments a positive integer not larger than $m$, so that every triangle whose three vertices are among the given points has the property that two of this triangle's sides have equal numbers put on, while the third has a larger number put on. Find the minimum value of a [i]good[/i] number $m$.

Is it possible to put the numbers $0,1$ or $2$ in the unit squares of the cross-lined paper $100\times 100$ in such a way, that every rectangle $3\times 4$ (and $4\times 3$) would contain three zeros, four ones and five twos?

Five identical empty buckets of $2$-liter capacity stand at the vertices of a regular pentagon. Cinderella and her wicked Stepmother go through a sequence of rounds: At the beginning of every round, the Stepmother takes one liter of water from the nearby river and distributes it arbitrarily over the five buckets. Then Cinderella chooses a pair of neighbouring buckets, empties them to the river and puts them back. Then the next round begins. The Stepmother goal's is to make one of these buckets overflow. Cinderella's goal is to prevent this. Can the wicked Stepmother enforce a bucket overflow? [i]Proposed by Gerhard Woeginger, Netherlands[/i]

An ant walks along the lines of a grid made up of $55$ horizontal lines and $45$ vertical lines. You want to paint some sections of lines so that the ant can go from any intersection to any other intersection, walking exclusively along painted sections. If the distance between consecutive lines is $10$ cm, what is the least possible number of centimeters that should be painted? What is the higher value?

For which positive integers $n \ge 3$ is it possible to mark $n$ points of a plane in such a way that, starting from one marked point and moving on each step to the marked point which is the second closest to the current point, one can walk through all the marked points and return to the initial one? For each point, the second closest marked point must be uniquely determined.

Let $n>3$ be a positive integer. Equilateral triangle ABC is divided into $n^2$ smaller congruent equilateral triangles (with sides parallel to its sides). Let $m$ be the number of rhombuses that contain two small equilateral triangles and $d$ the number of rhombuses that contain eight small equilateral triangles. Find the difference $m-d$ in terms of $n$.

For an ${n\times n}$ matrix $A$, let $X_{i}$ be the set of entries in row $i$, and $Y_{j}$ the set of entries in column $j$, ${1\leq i,j\leq n}$. We say that $A$ is [i]golden[/i] if ${X_{1},\dots ,X_{n},Y_{1},\dots ,Y_{n}}$ are distinct sets. Find the least integer $n$ such that there exists a ${2004\times 2004}$ golden matrix with entries in the set ${\{1,2,\dots ,n\}}$.

Two players play the following game: there are two heaps of tokens, and they take turns to pick some tokens from them. The winner of the game is the player who takes away the last token. If the number of tokens in the two heaps are $A$ and $B$ at a given moment, the player whose turn it is can take away a number of tokens that is a multiple of $A$ or a multiple of $B$ from one of the heaps. Find those pair of integers $(k,n)$ for which the second player has a winning strategy, if the initial number of tokens is $k$ in the first heap and $n$ in the second heap. [i]Proposed by Dömötör Pálvölgyi, Budapest[/i]

How many $5 \times 5$ grids are possible such that each element is either 1 or 0 and each row sum and column sum is $4 ?$ [list=1] [*] 64 [*] 32 [*] 120 [*] 96 [/list]

Find the number of ways to distribute $11$ balls into $5$ boxes with different sizes, so that each box receives at least one ball, and the total number of balls in the largest and smallest boxes is more than the total number of balls in the remaining boxes.

There are $N$ points on the plane; no three of them belong to the same straight line. Every pair of points is connected by a segment. Some of these segments are colored in red and the rest of them in blue. The red segments form a closed broken line without self-intersections(each red segment having only common endpoints with its two neighbors and no other common points with the other segments), and so do the blue segments. Find all possible values of $N$ for which such a disposition of $N$ points and such a choice of red and blue segments are possible.

Determine alle positive integers $n>1$ with the following property: For each colouring of the lattice points in the plane with $n$ colours, there are three lattice points of the same colour forming an isosceles right triangle with legs parallel to the coordinate axes.

Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.

A and B plays the following game: they choose randomly $k$ integers from $\{1,2,\dots,100\}$; if their sum is even, A wins, else B wins. For what values of $k$ does A and B have the same chance of winning?