For any point $(x, y)$ with $0\le x < 1$ and $0 \le y < 1$, Jenny can perform a shuffle on that point, which takes the point to $(\{3x + y\} ,\{x + 2y\})$ where $\{a\}$ denotes the fractional or decimal part of $a$ (so for example,$\{\pi\} = \pi - 3 = 0.1415...$). How many points $p$ are there such that after $3$ shuffles on $p$, $p$ ends up in its original position?

$ n\geq 2$ cars are participating in a rally. The cars leave the start line at different times and arrive at the finish line at different times. During the entire rally each car takes over any other car at most once , the number of cars taken over by each car is different and each car is taken over by the same number of cars. Find all possible values of $ n$

On a board, Ana writes $a$ different integers, while Ben writes $b$ different integers. Then, Ana adds each of her numbers with with each of Ben’s numbers and she obtains $c$ different integers. On the other hand, Ben substracts each of his numbers from each of Ana’s numbers and he gets $d$ different integers. For each integer $n$ , let $f(n)$ be the number of ways that $n$ may be written as sum of one number of Ana and one number of Ben. [i]a)[/i] Show that there exist an integer $n$ such that, $$f(n)\geq\frac{ab}{c}.$$ [i]b)[/i] Does there exist an integer $n$ such that, $$f(n)\geq\frac{ab}{d}?$$ [i]Proposed by Besfort Shala, Kosovo[/i]

Alice is drawing a shape on a piece of paper. She starts by placing her pencil at the origin, and then draws line segments of length one, alternating between vertical and horizontal segments. Eventually, her pencil returns to the origin, forming a closed, non-self-intersecting shape. Show that the area of this shape is even if and only if its perimeter is a multiple of eight.

Let $n \geq 2$ be a natural number. We consider a $(2n - 1) \times (2n - 1)$ table.Ana and Bob play the following game: starting with Ana, the two of them alternately color the vertices of the unit squares, Ana with red and Bob with blue, in $2n^2$ rounds. Then, starting with Ana, each one forms a vector with origin at a red point and ending at a blue point, resulting in $2n^2$ vectors with distinct origins and endpoints. If the sum of these vectors is zero, Ana wins. Otherwise, Bob wins. Show that Bob has a winning strategy.

Connecting the vertices of a regular $ n$-gon we obtain a closed (not necessarily convex) $ n$-gon. Show that if $ n$ is even, then there are two parallel segments among the connecting segments and if $ n$ is odd then there cannot be exactly two parallel segments.

In a very large City, they are building a subway: there are many stations, some pairs of which are connected by tunnels, and from any station you can get through tunnels to any other. All metro tunnels must be divided into "lines": each line consists of several consecutive tunnels, all stations in which are different (in particular, the line should not be circular); lines consisting of one tunnel are also allowed. By law, it is required that you can get from any station to any other station by making no more than $100$ transfers from line to line. At what is the largest $N$, any connected metro with $N$ stations can be divided into lines, observing the law?

We are given sufficiently many stones of the forms of a rectangle $2\times 1$ and square $1\times 1$. Let $n > 3$ be a natural number. In how many ways can one tile a rectangle $3 \times n$ using these stones, so that no two $2 \times 1$ rectangles have a common point, and each of them has the longer side parallel to the shorter side of the big rectangle?

In each cell of a $2019\times 2019$ board is written the number $1$ or the number $-1$. Prove that for some positive integer $k$ it is possible to select $k$ rows and $k$ columns so that the absolute value of the sum of the $k^2$ numbers in the cells at the intersection of the selected rows and columns is more than $1000$. [i]Folklore[/i]

For what positive integers $n\geq 4$ does there exist a set $S$ of $n$ points on the plane, not all collinear, such that for any three non-collinear points $A,B,C$ in $S$, either the incenter, $A$-excenter, $B$-excenter, or $C$-excenter of triangle $ABC$ is also contained in $S$?

Given is a natural number $n > 5$. On a circular strip of paper is written a sequence of zeros and ones. For each sequence $w$ of $n$ zeros and ones we count the number of ways to cut out a fragment from the strip on which is written $w$. It turned out that the largest number $M$ is achieved for the sequence $11 00...0$ ($n-2$ zeros) and the smallest - for the sequence $00...011$ ($n-2$ zeros). Prove that there is another sequence of $n$ zeros and ones that occurs exactly $M$ times.

In the plane are given $27$ points, no three of which are collinear. Four of this points are vertices of a unit square, while the others lie inside the square. Prove that there are three points in this set forming a triangle with area not exceeding $1/48$.

King Radford of Peiza is hosting a banquet in his palace. The King has an enormous circular table with $2021$ chairs around it. At The King's birthday celebration, he is sitting in his throne (one of the $2021$ chairs) and the other $2020$ chairs are filled with guests, with the shortest guest sitting to the King's left and the remaining guests seated in increasing order of height from there around the table. The King announces that everybody else must get up from their chairs, run around the table, and sit back down in some chair. After doing this, The King notices that the person seated to his left is different from the person who was previously seated to his left. Each other person at the table also notices that the person sitting to their left is different. Find a closed form expression for the number of ways the people could be sitting around the table at the end. You may use the notation $D_{n},$ the number of derangements of a set of size $n$, as part of your expression.

Armadillo and Badger are playing a game. Armadillo chooses a nonempty tree (a simple acyclic graph) and places apples at some of its vertices (there may be several apples on a single vertex). First, Badger picks a vertex $v_0$ and eats all its apples. Next, Armadillo and Badger take turns alternatingly, with Armadillo starting. On the $i$-th turn the animal whose turn it is picks a vertex $v_i$ adjacent to $v_{i-1}$ that hasn't been picked before and eats all its apples. The game ends when there is no such vertex $v_i$. Armadillo's goal is to have eaten more apples than Badger once the game ends. Can she fulfill her wish?

[b]p1.[/b] If the pairwise sums of the three numbers $x$, $y$, and $z$ are $22$, $26$, and $28$, what is $x + y + z$? [b]p2.[/b] Suhas draws a quadrilateral with side lengths $7$, $15$, $20$, and $24$ in some order such that the quadrilateral has two opposite right angles. Find the area of the quadrilateral. [b]p3.[/b] Let $(n)*$ denote the sum of the digits of $n$. Find the value of $((((985^{998})*)*)*)*$. [b]p4.[/b] Everyone wants to know Andy's locker combination because there is a golden ticket inside. His locker combination consists of 4 non-zero digits that sum to an even number. Find the number of possible locker combinations that Andy's locker can have. [b]p5.[/b] In triangle $ABC$, $\angle ABC = 3\angle ACB$. If $AB = 4$ and $AC = 5$, compute the length of $BC$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[i]20 problems for 20 minutes. [/i] [b]p1.[/b] Evaluate $\frac{\sqrt2 \cdot \sqrt6}{\sqrt3}.$ [b]p2.[/b] If $6\%$ of a number is $1218$, what is $18\%$ of that number? [b]p3.[/b] What is the median of $\{42, 9, 8, 4, 5, 1,13666, 3\}$? [b]p4.[/b] Define the operation $\heartsuit$ so that $i\heartsuit u = 5i - 2u$. What is $3\heartsuit 4$? p5. How many $0.2$-inch by $1$-inch by $1$-inch gold bars can fit in a $15$-inch by $12$-inch by $9$-inch box? [b]p6.[/b] A tetrahedron is a triangular pyramid. What is the sum of the number of edges, faces, and vertices of a tetrahedron? [b]p7.[/b] Ron has three blue socks, four white socks, five green socks, and two black socks in a drawer. Ron takes socks out of his drawer blindly and at random. What is the least number of socks that Ron needs to take out to guarantee he will be able to make a pair of matching socks? [b]p8.[/b] One segment with length $6$ and some segments with lengths $10$, $8$, and $2$ form the three letters in the diagram shown below. Compute the sum of the perimeters of the three figures. [img]https://cdn.artofproblemsolving.com/attachments/1/0/9f7d6d42b1d68cd6554d7d5f8dd9f3181054fa.png[/img] [b]p9.[/b] How many integer solutions are there to the inequality $|x - 6| \le 4$? [b]p10.[/b] In a land for bad children, the flavors of ice cream are grass, dirt, earwax, hair, and dust-bunny. The cones are made out of granite, marble, or pumice, and can be topped by hot lava, chalk, or ink. How many ice cream cones can the evil confectioners in this ice-cream land make? (Every ice cream cone consists of one scoop of ice cream, one cone, and one topping.) [b]p11.[/b] Compute the sum of the prime divisors of $245 + 452 + 524$. [b]p12.[/b] In quadrilateral $SEAT$, $SE = 2$, $EA = 3$, $AT = 4$, $\angle EAT = \angle SET = 90^o$. What is the area of the quadrilateral? [b]p13.[/b] What is the angle, in degrees, formed by the hour and minute hands on a clock at $10:30$ AM? [b]p14.[/b] Three numbers are randomly chosen without replacement from the set $\{101, 102, 103,..., 200\}$. What is the probability that these three numbers are the side lengths of a triangle? [b]p15.[/b] John takes a $30$-mile bike ride over hilly terrain, where the road always either goes uphill or downhill, and is never flat. If he bikes a total of $20$ miles uphill, and he bikes at $6$ mph when he goes uphill, and $24$ mph when he goes downhill, what is his average speed, in mph, for the ride? [b]p16.[/b] How many distinct six-letter words (not necessarily in any language known to man) can be formed by rearranging the letters in $EXETER$? (You should include the word EXETER in your count.) [b]p17.[/b] A pie has been cut into eight slices of different sizes. Snow White steals a slice. Then, the seven dwarfs (Sneezy, Sleepy, Dopey, Doc, Happy, Bashful, Grumpy) take slices one by one according to the alphabetical order of their names, but each dwarf can only take a slice next to one that has already been taken. In how many ways can this pie be eaten by these eight persons? [b]p18.[/b] Assume that $n$ is a positive integer such that the remainder of $n$ is $1$ when divided by $3$, is $2$ when divided by $4$, is $3$ when divided by $5$, $...$ , and is $8$ when divided by $10$. What is the smallest possible value of $n$? [b]p19.[/b] Find the sum of all positive four-digit numbers that are perfect squares and that have remainder $1$ when divided by $100$. [b]p20.[/b] A coin of radius $1$ cm is tossed onto a plane surface that has been tiled by equilateral triangles with side length $20\sqrt3$ cm. What is the probability that the coin lands within one of the triangles? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We have a $10 \times 10$ table. $T$ is a set of rectangles with vertices from the table and sides parallel to the sides of the table such that no rectangle from the set is a subrectangle of another rectangle from the set. $t$ is the maximum number of elements of $T$. (a) Prove that $t>300$. (b) Prove that $t<600$. [i]Proposed by Mir Omid Haji Mirsadeghi and Kasra Alishahi[/i]

The $A$ set consists of integers only. Its minimal element is $1$ and its maximal element is $100$. Every element of $A$ except $1$ equals to the sum of two (may be equal) numbers being contained in $A$. What is the least possible number of elements in $A$?

A group consist of n tourists. Among every 3 of them there are 2 which are not familiar. For every partition of the tourists in 2 buses you can find 2 tourists that are in the same bus and are familiar with each other. Prove that is a tourist familiar to at most $\displaystyle \frac 2{5}n$ tourists.

Define the product $P_n=1! \cdot 2!\cdot 3!\cdots (n-1)!\cdot n!$ a) Find all positive integers $m$, such that $\frac {P_{2020}}{m!}$ is a perfect square. b) Prove that there are infinite many value(s) of $n$, such that $\frac {P_{n}}{m!}$ is a perfect square, for at least two positive integers $m$.

Cells of $11\times 11$ table are colored with $n$ colors (each cell is colored with exactly one color). For each color, the total amount of the cells of this color is not less than $7$ and not greater than $13$. Prove that there exists at least one row or column which contains cells of at least four different colors. [i](N. Sedrakyan)[/i]

The leader of an IMO team chooses positive integers $n$ and $k$ with $n > k$, and announces them to the deputy leader and a contestant. The leader then secretly tells the deputy leader an $n$-digit binary string, and the deputy leader writes down all $n$-digit binary strings which differ from the leader’s in exactly $k$ positions. (For example, if $n = 3$ and $k = 1$, and if the leader chooses $101$, the deputy leader would write down $001, 111$ and $100$.) The contestant is allowed to look at the strings written by the deputy leader and guess the leader’s string. What is the minimum number of guesses (in terms of $n$ and $k$) needed to guarantee the correct answer?

The expression $*3^5*3^4*3^3*3^2*3*1$ is given. Ana and Branka alternately change the signs $*$ to $+$ or $-$ (one time each turn). Can Branka, who plays second, do this so as to obtain an expression whose value is divisible by $7$?

Max has a light bulb and a defective switch. The light bulb is initially off, and on the $n$th time the switch is flipped, the light bulb has a $\tfrac 1{2(n+1)^2}$ chance of changing its state (i.e. on $\to$ off or off $\to$ on). If Max flips the switch 100 times, find the probability the light is on at the end. [i]Proposed by Connor Gordon[/i]

Given a real number $\alpha$ in whose decimal representation $\alpha=0,a_1a_2a_3\dots$ each decimal digit $a_i$ $(i=1,2,3,\dots)$ is a prime number. The decimal digits are arranged along the path indicated by arrows in the accompanying figure, which can be thought of as continuing infinitely to the right and downward. For each $m\geq 1$, the decimal representation of a real number $z_m$ is formed by writing before the decimal point the digit 0 and after the decimal point the sequence of digits of the $m$-th row from the top read from left to right from the adjacent arrangement. In an analogous way, for all $n\geq 1$, the real numbers $s_n$ are formed with the digits of the $n$-th column from the left to be read from top to bottom. For example, $z_3=0,a_5a_6a_7a_{12}a_{23}a_{28}\dots$ and $s_2=0,a_2a_3a_6a_{15}a_{18}a_{35}\dots$. Show: (a) If $\alpha$ is rational, then all $z_m$ and all $s_n$ are rational. (b) The converse of the statement formulated in (a) is false.