Six young people - Antonio, Bernardo, Carlos, Diego, Eduardo, and Francisco, attended a meeting in vests of different colors. After the meeting, they decided to exchange the vests as souvenir. $1)$. Each of them came out of the meeting room, wearing a vest with color different from the one with which they went into the meeting room. $2)$. The vest with which Antonio came out of the meeting room was belong to the young man who came out with Bernardo's vest. $3)$. The owner of the vest with which Carlos came out of the meeting room, came out with the vest that was belong to the young man who came out with Diego's vest. $4)$. The one who came out of the meeting room with Eduardo's vest was not the owner of the vest with which Francisco came out. Determine who came out of the meeting room with Antonio's vest, and who owns the vest with which Antonio came out. [hide=original wording]Seis jovenes que asistieron a una reunion vistiendo chalecos de distintos colores, decidieron intercambiarlos y salieron vistiendo todos de color diferente a aquel con que llegaron. El chaleco con que salio Antonio perteneca al joven que salio con el chaleco de Bernardo. El dueno del chaleco con que salio Carlos, salio con el chaleco que perteneca al joven que se llevo el de Diego. Quien se llevo el chaleco de Eduardo no era el dueno del que se llevo Francisco. Determine quien salio con el chaleco de Antonio, y quien es el dueno del chaleco que se llevo Antonio.[/hide]

Let $X$ be the set of all lattice points in the plane (points $(x, y)$ with $x, y \in \mathbb{Z}$). A path of length $n$ is a chain $(P_0, P_1, ... , P_n)$ of points in $X$ such that $P_{i-1}P_i = 1$ for $i = 1, ... , n$. Let $F(n)$ be the number of distinct paths beginning in $P_0=(0,0)$ and ending in any point $P_n$ on line $y = 0$. Prove that $F(n) = \binom{2n}{n}$

Given is a natural number $n>4$. There are $n$ points marked on the plane, no three of which lie on the same line. Vasily draws one by one all the segments connecting pairs of marked points. At each step, drawing the next segment $S$, Vasily marks it with the smallest natural number, which hasn't appeared on a drawn segment that has a common end with $S$. Find the maximal value of $k$, for which Vasily can act in such a way that he can mark some segment with the number $k$?

Michelle is at the bottom-left corner of a $6\times 6$ lattice grid, at $(0,0)$. The grid also contains a pair of one-time-use teleportation devices at $(2,2)$ and $(3,3)$; the first time Michelle moves to one of these points she is instantly teleported to the other point and the devices disappear. If she can only move up or to the right in unit increments, in how many ways can she reach the point $(5,5)$?

Ali and Shayan are playing a turn-based game on an infinite grid. Initially, all cells are white. Ali starts the game, and in the first turn, he colors one unit square black. In the following turns, each player must color a white square that shares at least one side with a black square. The game continues for exactly 2808 turns, after which each player has made 1404 moves. Let $A$ be the set of black cells at the end of the game. Ali and Shayan respectively aim to minimize and maximise the perimeter of the shape $A$ by playing optimally. (The perimeter of shape $A$ is defined as the total length of the boundary segments between a black and a white cell.) What are the possible values of the perimeter of $A$, assuming both players play optimally?

How many permutations $(s_1, s_2,...,s_n) $of $(1,2 ,...,n)$ are there satisfying the condition $s_i > s_j$ for all $i \ge j + 3$ when $n = 5$ and when $n = 7$?

Finite number of dwarfs excavates ore in the mine with infinite number of levels. Each day at the same time one dwarf from each level, inhabited with exactly $n = 1, 2, 3, ...$ dwarfs, move $n$ levels down. Prove that after some moment there will be no more then one dwarf on each level.

Is it possible to put together $27$ equal cubes, $9$ red, $9$ blue and $9$ white, so as to obtain a big cube in which each row (parallel to an arbitrary edge of the cube) contains three cubes with exactly two different colours? (S. Fomin, Leningrad)

An angle is considered as a point and two rays coming out of it. Find the largest value on $n$ such that it is possible to place $n$ $60$ degree angles on the plane in a way that any pair of these angles have exactly $4$ intersection points.

A rectangle $\mathcal{R}$ with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of $\mathcal{R}$ are either all odd or all even. [i]Proposed by Jeck Lim, Singapore[/i]

A sequence $a_1, a_2, \ldots $ consisting of $1$'s and $0$'s satisfies for all $k>2016$ that \[ a_k=0 \quad \Longleftrightarrow \quad a_{k-1}+a_{k-2}+\cdots+a_{k-2016}>23. \] Prove that there exist positive integers $N$ and $T$ such that $a_k=a_{k+T}$ for all $k>N$.

Determine the smallest integer $n\geq 4$ for which one can choose four different numbers $a,b,c$ and $d$ from any $n$ distinct integers such that $a+b-c-d$ is divisible by $20$.

There are 100 boxers, each of them having different strengths, who participate in a tournament. Any of them fights each other only once. Several boxers form a plot. In one of their matches, they hide in their glove a horse shoe. If in a fight, only one of the boxers has a horse shoe hidden, he wins the fight; otherwise, the stronger boxer wins. It is known that there are three boxers who obtained (strictly) more wins than the strongest three boxers. What is the minimum number of plotters ? [i]Proposed by N. Kalinin[/i]

How many ways are there to permute the letters $\{S,C,R, A,M,B,L,E\}$ without the permutation containing the substring $L AME$?

Find the number ot 6-tuples $(x_1, x_2,...,x_6)$, where $x_i=0,1 or 2$ and $x_1+x_2+...+x_6$ is even

How many permutations of the string $0123456$ are there such that no contiguous substrings of lengths $1<\ell<7$ have a sum of digits divisible by $7$? [i]Proposed by Srinivasan Sathiamurthy[/i]

[hide=Rules]Time Limit: 25 minutes Maximum Possible Score: 81 The following is a mathematical Sudoku puzzle which is also a crossword. Your job is to fill in as many blanks as you possibly can, including all shaded squares. You do not earn extra points for showing your work; the only points you get are for correctly filled-in squares. You get one point for each correctly filled-in square. You should read through the following rules carefully before starting. $\bullet$ Your time limit for this round is $25$ minutes, in addition to the five minutes you get for reading the rules. So make use of your time wisely. The round is based more on speed than on perfect reasoning, so use your intuition well, and be fast. $\bullet$ This is a Sudoku puzzle; all the squares should be filled in with the digits $1$ through $9$ so that every row and column contains each digit exactly once. In addition, each of the nine $3\times 3$ boxes that compose the grid also contains each digit exactly once. Furthermore, this is a super-Sudoku puzzle; in addition to satisfying all these conditions, the four $3\times 3$ boxes with red outlines also contain each of $1,..., 9$ exactly once. This last property is important to keep in mind – it may help you solve the puzzle faster. $\bullet$ Just to restate the idea, you can use the digits $1$ through $9$, but not $0$. You may not use any other symbol, such as $\pi$ or $e$ or $\epsilon$. Each square gets exactly one digit. $\bullet$ The grid is also a crossword puzzle; the usual rules apply. The shaded grey squares are the “black” squares of an ordinary crossword puzzle. The white squares as well as the shaded yellow ones count as the “white” crossword squares. All squares, white or shaded, count as ordinary Sudoku squares. $\bullet$ If you obtain the unique solution to the crossword puzzle, then this solution extends to a unique solution to the Sudoku puzzle. $\bullet$ You may use a graphing calculator to help you solve the clues. The following hints and tips may prove useful while solving the puzzle. $\bullet$ Use the super-Sudoku structure described in the first rule; use all the symmetries you have. Remember that we are not looking for proofs or methods, only for correctly filled-in squares. $\bullet$ If you find yourself stuck on a specific clue, it is nothing to worry about. You can obtain the solution to that clue later on by solving other clues and figuring out certain digits of your desired solution. Just move on to the rest of the puzzle. $\bullet$ As you progress through the puzzle, keep filling in all squares you have found on your solution sheet, including the shaded ones. Remember that for scoring, the shaded grey squares count the same as the white ones. Good luck! [/hide] [asy] // place label "s" in row i, column j void labelsq(int i, int j, string s) { label("$"+s+"$",(j-0.5,7.5-i),fontsize(14)); } // for example, use the command // labelsq(1,7,"2"); // to put the digit 2 in the top right box // **** rest of code **** size(250); defaultpen(linewidth(1)); pair[] labels = {(1,1),(1,4),(1,6),(1,7),(1,9),(2,1),(2,6),(3,4),(4,1),(4,8),(5,1),(6,3),(6,5),(6,6),(7,1),(7,2),(7,7),(7,9),(8,1),(8,4),(9,1),(9,6)}; pair[] blacksq = {(1,5),(2,5),(3,2),(3,3),(3,8),(5,5),(5,6),(5,7),(5,9),(6,2),(6,7),(6,9),(8,3),(9,5),(9,8)}; path peachsq = shift(1,1)*scale(3)*unitsquare; pen peach = rgb(0.98,0.92,0.71); pen darkred = red + linewidth(2); fill(peachsq,peach); fill(shift(4,0)*peachsq,peach); fill(shift(4,4)*peachsq,peach); fill(shift(0,4)*peachsq,peach); for(int i = 0; i < blacksq.length; ++i) fill(shift(blacksq[i].y-1, 9-blacksq[i].x)*unitsquare, gray(0.6)); for(int i = 0; i < 10; ++i) { pen sudokuline = linewidth(1); if(i == 3 || i == 6) sudokuline = linewidth(2); draw((0,i)--(9,i),sudokuline); draw((i,0)--(i,9),sudokuline); } draw(peachsq,darkred); draw(shift(4,0)*peachsq,darkred); draw(shift(4,4)*peachsq,darkred); draw(shift(0,4)*peachsq,darkred); for(int i = 0; i < labels.length; ++i) label(string(i+1), (labels[i].y-1, 10-labels[i].x), SE, fontsize(10)); // **** draw letters **** draw(shift(.5,.5)*((0,6)--(0,8)--(2,8)--(2,7)--(0,7)^^(3,8)--(3,6)--(5,6)--(5,8)^^(6,6)--(6,8)--(7,8)--(7,7)--(7,8)--(8,8)--(8,6)^^(0,3)--(0,5)--(2,5)--(2,3)--(2,4)--(0,4)^^(5,3)--(3,3)--(3,5)--(5,5)),linewidth(1)+rgb(0.94,0.74,0.58)); // **** end rest of code ****[/asy] [b][u][i]Across[/i][/u][/b] [b]1 Across.[/b] The following is a normal addition where each letter represents a (distinct) digit: $$GOT + TO + GO + TO = TOP$$This certainly does not have a unique solution. However, you discover suddenly that $G = 2$ and $P \notin \{4, 7\}$. Then what is the numeric value of the expression $GOT \times TO$? [b]3 Across.[/b] A strobogrammatic number which reads the same upside down, e.g. $619$. On the other hand, a triangular number is a number of the form $n(n + 1)/2$ for some $n \in N$, e.g. $15$ (therefore, the $i^{th}$ triangular number $T_i$ is the sum of $1$ through $i$). Let $a$ be the third strobogrammatic prime number. Let $b$ be the smaller number of the smallest pair of triangular numbers whose sum and difference are also triangular numbers. What is the value of $ab$? [b]6 Across.[/b] A positive integer $m$ is said to be palindromic in base $\ell$ if, when written in base $\ell$ , its digits are the same front-to-back and back-to-front. For $j, k \in N$, let $\mu (j, k)$ be the smallest base-$10$ integer that is palindromic in base $j$ as well as in base$ k$, and let $\nu (j, k) := (j + k) \cdot \mu (j, k)$. Find the value of $\nu (5, 9)$. [b]7 Across.[/b] Suppose you have the unique solution to this Sudoku puzzle. In that solution, let $X$ denote the sum of all digits in the shaded grey squares. Similarly, let $Y$ denote the sum of all numbers in the shaded yellow squares on the upper left block (i.e. the $3 \times 3$ box outlined red towards the top left). Concatenate $X$ with $Y$ in that order, and write that down. [b]8 Across.[/b] For any $n \in N$ such that $1 < n < 10$, define the sequence $X_{n,1}$,$X_{n,2}$,$ ...$ by $X_{n,1} = n$, and for $r \ge 2$, X_{n,r} is smallest number $k \in N$ larger than X_{n,r-1} such that $k$ and the sum of digits of $k$ are both powers of $n$. For instance, $X_{3,1 = 3}$, $X_{3,2} = 9$, $X_{3,3} = 27$, and so on. Concatenate $X_{2,2}$ with $X_{2,4}$, and write down the answer. [b]9 Across.[/b] Find positive integers $x, y,z$ satisfying the following properties: $y$ is obtained by subtracting $93$ from $x$, and $z$ is obtained by subtracting $183$ from $y$, furthermore, $x, y$ and $z$ in their base-$10$ representations contain precisely all the digits from $1$ through $9$ once (i.e. concatenating $x, y$ and $z$ yields a valid $9$-digit Sudoku answer). Obviously, write down the concatenation of $x, y$ and $z$ in that order. [b]11 Across.[/b] Find the largest pair of two-digit consecutive prime numbers $a$ and $b$ (with $a < b$) such that the sum of the digits of a plus the sum of the digits of b is also a prime number. Write the concatenation of $a$ and $b$. [b]12 Across.[/b] Suppose you have a strip of $2n + 1$ squares, with n frogs on the $n$ squares on the left, and $n$ toads on the $n$ squares on the right. A move consists either of a toad or a frog sliding to an adjacent square if it is vacant, or of a toad or a frog jumping one square over another one and landing on the next square if it is vacant. For instance, the starting position [img]https://cdn.artofproblemsolving.com/attachments/a/a/6c97f15304449284dc282ff86014f526322e4a.png[/img] has the position [img]https://cdn.artofproblemsolving.com/attachments/e/6/e2c9520731bd94dc0aa37f540c2b9d1bce6432.png[/img] or the position [img]https://cdn.artofproblemsolving.com/attachments/3/f/06868eca80d649c4f80425dc9dc5c596cb2a4e.png[/img] as results of valid first moves. What is the minimum number of moves needed to swap the toads with the frogs if $n = 5$? How about $n = 6$? Concatenate your answers. [b]15 Across.[/b] Let $w$ be the largest number such that $w$, $2w$ and $3w$ together contain every digit from $1$ through $9$ exactly once. Let $x$ be the smallest integer with the property that its first $5$ multiples contain the digit $9$. A Leyland number is an integer of the form $m^n + n^m$ for integers $m, n > 1$. Let $y$ be the fourth Leyland number. A Pillai prime is a prime number $p$ for which there is an integer $n > 0$ such that $n! \equiv - 1 (mod \,\, p)$, but $p \not\equiv 1 (mod \,\, n)$. Let $z$ be the fourth Pillai prime. Concatenate $w$, $x, y$ and $z$ in that order to obtain a permutation of $1,..., 9$. Write down this permutation. [b]19 Across.[/b] A hoax number $k \in N$ is one for which the sum of its digits (in base $10$) equals the sum of the digits of its distinct prime factors (in base $10$). For instance, the distinct prime factors of $22$ are $2$ and $11$, and we have $2+2 = 2+(1+1)$. In fact, $22$ is the first hoax number. What is the second? [b]20 Across.[/b] Let $a, b$ and $c$ be distinct $2$-digit numbers satisfying the following properties: – $a$ is the largest integer expressible as $a = x^y = y^x$, for distinct integers $x$ and $y$. – $b$ is the smallest integer which has three partitions into three parts, which all give the same product (which turns out to be $1200$) when multiplied. – $c$ is the largest number that is the sum of the digits of its cube. Concatenate $a, b$ and $c$, and write down the resulting 6-digit prime number. [b]21 Across.[/b] Suppose $N = \underline{a}\, \underline{b} \, \underline{c} \, \underline{d}$ is a $4$-digit number with digits $a, b, c$ and $d$, such that $N = a \cdot b \cdot c \cdot d^7$. Find $N$. [b]22 Across.[/b] What is the smallest number expressible as the sum of $2, 3, 4$, or $5$ distinct primes? [b][u][i]Down [/i][/u][/b] [b]1 Down.[/b] For some $a, b, c \in N$, let the polynomial $$p(x) = x^5 - 252x^4 + ax^3 - bx^2 + cx - 62604360$$ have five distinct roots that are positive integers. Four of these are 2-digit numbers, while the last one is single-digit. Concatenate all five roots in decreasing order, and write down the result. [b]2 Down.[/b] Gene, Ashwath and Cosmin together have $2511$ math books. Gene now buys as many math books as he already has, and Cosmin sells off half his math books. This leaves them with $2919$ books in total. After this, Ashwath suddenly sells off all his books to buy a private jet, leaving Gene and Cosmin with a total of $2184$ books. How many books did Gene, Ashwath and Cosmin have to begin with? Concatenate the three answers (in the order Gene, Ashwath, Cosmin) and write down the result. [b]3 Down.[/b] A regular octahedron is a convex polyhedron composed of eight congruent faces, each of which is an equilateral triangle; four of them meet at each vertex. For instance, the following diagram depicts a regular octahedron: [img]https://cdn.artofproblemsolving.com/attachments/c/1/6a92f12d5e9f56b0699531ae8369a0ab8ab813.png[/img] Let $T$ be a regular octahedron of edge length $28$. What is the total surface area of $T$ , rounded to the nearest integer? [b]4 Down.[/b] Evaluate the value of the expression $$\sum^{T_{25}}_{k=T_{24}+1}k, $$ where $T_i$ denotes the $i^{th}$ triangular number (the sum of the integers from $1$ through $i$). [b]5 Down.[/b] Suppose $r$ and $s$ are consecutive multiples of$ 9$ satisfying the following properties: – $r$ is the smallest positive integer that can be written as the sum of $3$ positive squares in $3$ different ways. – $s$ is the smallest $2$-digit number that is a Woodall number as well as a base-$10$ Harshad number. A Woodall number is any number of the form $n \cdot 2^n - 1$ for some $n \in N$. A base-$10$ Harshad number is divisible by the sum of its digits in base $10$. Concatenate $r$ and $s$ and write down the result. [b]10 Down.[/b] For any $k \in N$, let $\phi_p(k)$ denote the sum of the distinct prime factors of $k$. Suppose $N$ is the largest integer less than $50000$ satisfying $\phi_p(N) =\phi_p(N + 1)$, where the common value turns out to be a meager $55$. What is$ N$? [b]13 Down.[/b] The $n^{th}$ $s$-gonal number $P(s, n)$ is defined as $$P(s, n) = (s - 3)T_{n-1} + T_n$$ where $T_i$ is the $i^{th}$ triangular number (recall that the $i^{th}$ triangular number is the sum of the numbers $1$ through $i$). Find the least $N$ such that $N$ is both a $34$-gonal number, and a $163$-gonal number. [b]14 Down.[/b] A biprime is a positive integer that is the product of precisely two (not necessarily distinct) primes. A cluster of biprimes is an ordered triple $(m,m + 1,m + 2)$ of consecutive integers that are biprimes. There are precisely three clusters of biprimes below 100. Denote these by, say, $$\{(p, p + 1, p + 2), (q, q + 1,q + 2), (r, r + 1, r + 2)\}$$ and add the condition that $p + 2 < q < r - 2$ to fix the three clusters. Interestingly, $p + 1$ and $q$ are both multiples of $17$. Concatenate $q$ with $p + 1$ in that order, and write down the result. [b]16 Down.[/b] Find the least positive integer $m$ (written in base $10$ as $m = \underline{a} \, \underline{b} \, \underline{c} $, with digits $a, b,c$), such that $m = (b + c)^a$. [b]17 Down.[/b] Let $X$ be a set containing $32$ elements, and let $Y\subseteq X$ be a subset containing $29$ elements. How many $2$-element subsets of $X$ are there which have nonempty intersection with $Y$? [b]18 Down.[/b] Find a positive integer $K < 196$, which is a strange twin of the number $196$, in the sense that $K^2$ shares the same digits as $196^2$, and $K^3$ shares the same digits as $196^3$. PS. You should use hide for answers.

In Mathcity, there are infinitely many buses and infinitely many stations. The stations are indexed by the powers of $2: 1, 2, 4, 8, 16, ...$ Each bus goes by finitely many stations, and the bus number is the sum of all the stations it goes by. For simplifications, the mayor of Mathcity wishes that the bus numbers form an arithmetic progression with common difference $r$ and whose first term is the favourite number of the mayor. For which positive integers $r$ is it always possible that, no matter the favourite number of the mayor, given any $m$ stations, there is a bus going by all of them? Proposed by [i]Savinien Kreczman and Martin Rakovsky, France[/i]

The triangle table is constructed according to the rule: You put the natural number $a>1$ in the upper row, and then you write under the number $k$ from the left side $k^2$, and from the right side -- $(k+1)$. For example, if $a = 2$, you get the table on the picture. Prove that all the numbers on each particular line are different. 2 / \ / \ 4 3 / \ / \ 16 5 9 4 / \ / \ /\ / \

Find the number of ordered triples $(a, b)$ of positive integers with $a < b$ and $100 \leq a, b \leq 1000$ satisfy $\gcd(a, b) : \mathrm{lcm}(a, b) = 1 : 495$?

[i]25 problems for 30 minutes[/i] [b]p1.[/b] Today is Saturday, April $25$, $2020$. What is the value of $6 + 4 + 25 + 2020$? [b]p2.[/b] The figure below consists of a $2$ by $3$ grid of squares. How many squares of any size are in the grid? $\begin{tabular}{|l|l|l|} \hline & & \\ \hline & & \\ \hline \end{tabular}$ [b]p3.[/b] James is playing a game. He first rolls a six-sided dice which contains a different number on each side, then randomly picks one of twelve dierent colors, and finally ips a quarter. How many different possible combinations of a number, a color and a flip are there in this game? [b]p4.[/b] What is the sum of the number of diagonals and sides in a regular hexagon? [b]p5.[/b] Mickey Mouse and Minnie Mouse are best friends but they often fight. Each of their fights take up exactly one hour, and they always fight on prime days. For example, they fight on January $2$nd, $3$rd, but not the $4$th. Knowing this, how many total times do Mickey and Minnie fight in the months of April, May and June? [b]p6.[/b] Apple always loved eating watermelons. Normal watermelons have around $13$ black seeds and $25$ brown seeds, whereas strange watermelons had $45$ black seeds and $2$ brown seeds. If Apple bought $14$ normal watermelons and $7$ strange watermelons, then let $a$ be the total number of black seeds and $b$ be the total number of brown seeds. What is $a - b$? [b]p7.[/b] Jerry and Justin both roll a die once. The probability that Jerry's roll is greater than Justin's can be expressed as a fraction in the form $\frac{m}{n}$ in simplified terms. What is $m + n$? [b]p8.[/b] Taylor wants to color the sides of an octagon. What is the minimum number of colors Taylor will need so that no adjacent sides of the octagon will be filled in with the same color? [b]p9.[/b] The point $\frac23$ of the way from ($-6, 8$) to ($-3, 5$) can be expressed as an ordered pair $(a, b)$. What is $|a - b|$? [b]p10.[/b] Mary Price Maddox laughs $7$ times per class. If she teaches $4$ classes a day for the $5$ weekdays every week but doesn't laugh on Wednesdays, then how many times does she laugh after $5$ weeks of teaching? [b]p11.[/b] Let $ABCD$ be a unit square. If $E$ is the midpoint of $AB$ and $F$ lies inside $ABCD$ such that $CFD$ is an equilateral triangle, the positive difference between the area of $CED$ and $CFD$ can be expressed in the form $\frac{a-\sqrt{b}}{c}$ , where $a$, $b$, $c$ are in lowest simplified terms. What is $a + b + c$? [b]p12.[/b] Eddie has musician's syndrome. Whenever a song is a $C$, $A$, or $F$ minor, he begins to cry and his body becomes very stiff. On the other hand, if the song is in $G$ minor, $A$ at major, or $E$ at major, his eyes open wide and he feels like the happiest human being ever alive. There are a total of $24$ keys. How many different possibilities are there in which he cries while playing one song with two distinct keys? [b]p13.[/b] What positive integer must be added to both the numerator and denominator of $\frac{12}{40}$ to make a fraction that is equivalent to $\frac{4}{11}$ ? [b]p14.[/b] The number $0$ is written on the board. Each minute, Gene the genie either multiplies the number on the board by $3$ or $9$, each with equal probability, and then adds either $1$,$2$, or $3$, each with equal probability. Find the expected value of the number after $3$ minutes. [b]p15.[/b] $x$ satisfies $\dfrac{1}{x+ \dfrac{1}{1+\frac{1}{2}}}=\dfrac{1}{2+ \dfrac{1}{1- \dfrac{1}{2+\frac{1}{2}}}}$ Find $x$. [b]p16.[/b] How many different points in a coordinate plane can a bug end up on if the bug starts at the origin and moves one unit to the right, left, up or down every minute for $8$ minutes? [b]p17.[/b] The triplets Addie, Allie, and Annie, are racing against the triplets Bobby, Billy, and Bonnie in a relay race on a track that is $100$ feet long. The first person of each team must run around the entire track twice and tag the second person for the second person to start running. Then, the second person must run once around the entire track and tag the third person, and finally, the third person would only have to run around half the track. Addie and Bob run first, Allie and Billy second, Annie and Bonnie third. Addie, Allie, and Annie run at $50$ feet per minute (ft/m), $25$ ft/m, and $20$ ft/m, respectively. If Bob, Billy, and Bonnie run half as fast as Addie, Allie, and Annie, respectively, then how many minutes will it take Bob, Billy, and Bonnie to finish the race. Assume that everyone runs at a constant rate. [b]p18.[/b] James likes to play with Jane and Jason. If the probability that Jason and Jane play together is $\frac13$, while the probability that James and Jason is $\frac14$ and the probability that James and Jane play together is $\frac15$, then the probability that they all play together is $\frac{\sqrt{p}}{q}$ for positive integers $p$, $q$ where $p$ is not divisible by the square of any prime. Find $p + q$. [b]p19.[/b] Call an integer a near-prime if it is one more than a prime number. Find the sum of all near-primes less than$ 1000$ that are perfect powers. (Note: a perfect power is an integer of the form $n^k$ where $n, k \ge 2$ are integers.) [b]p20.[/b] What is the integer solution to $\sqrt{\frac{2x-6}{x-11}} = \frac{3x-7}{x+6}$ ? [b]p21.[/b] Consider rectangle $ABCD$ with $AB = 12$ and $BC = 4$ with $F$,$G$ trisecting $DC$ so that $F$ is closer to $D$. Then $E$ is on $AB$. We call the intersection of $EF$ and $DB$ $X$, and the intersection of $EG$ and $DB$ is $Y$. If the area of $\vartriangle XY E$ is \frac{8}{15} , then what is the length of $EB$? [b]p22.[/b] The sum $$\sum^{\infty}_{n=2} \frac{1}{4n^2-1}$$ can be expressed as a common fraction $\frac{a}{b}$ in lowest terms. Find $a + b$. [b]p23.[/b] In square $ABCD$, $M$, $N$, $O$, $P$ are points on sides $\overline{AB}$, $\overline{BC}$, $\overline{CD}$ and $\overline{DA}$, respectively. If $AB = 4$, $AM = BM$ and $DP = 3AP$, the least possible value of $MN + NO + OP$ can be expressed as $\sqrt{x}$ forsome integer x. Find x: [b]p24.[/b] Grand-Ovich the ant is at a vertex of a regular hexagon and he moves to one of the adjacent vertices every minute with equal probability. Let the probability that after $8$ minutes he will have returned to the starting vertex at least once be the common fraction $\frac{a}{b}$ in lowest terms. What is $a + b$? [b]p25.[/b] Find the last two non-zero digits at the end of $2020!$ written as a two digit number. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In a room there are several children and a pile of 1000 sweets. The children come to the pile one after another in some order. Upon reaching the pile each of them divides the current number of sweets in the pile by the number of children in the room, rounds the result if it is not integer, takes the resulting number of sweets from the pile and leaves the room. All the boys round upwards and all the girls round downwards. The process continues until everyone leaves the room. Prove that the total number of sweets received by the boys does not depend on the order in which the children reach the pile. [i]Maxim Didin[/i]

Let $n\ge 1$ be an integer. In town $X$ there are $n$ girls and $n$ boys, and each girl knows each boy. In town $Y$ there are $n$ girls, $g_1,g_2,\ldots ,g_n$, and $2n-1$ boys, $b_1,b_2,\ldots ,b_{2n-1}$. For $i=1,2,\ldots ,n$, girl $g_i$ knows boys $b_1,b_2,\ldots ,b_{2i-1}$ and no other boys. Let $r$ be an integer with $1\le r\le n$. In each of the towns a party will be held where $r$ girls from that town and $r$ boys from the same town are supposed to dance with each other in $r$ dancing pairs. However, every girl only wants to dance with a boy she knows. Denote by $X(r)$ the number of ways in which we can choose $r$ dancing pairs from town $X$, and by $Y(r)$ the number of ways in which we can choose $r$ dancing pairs from town $Y$. Prove that $X(r)=Y(r)$ for $r=1,2,\ldots ,n$.

In a basketball competition, $n$ teams took part. Each pair of teams played exactly one match, and there were no draws. At the end of the competition the $i$-th team had $x_i$ wins and $y_i$ defeats $(i=1,\ldots,n)$. Prove that $x_1^2+x_2^2+\ldots+x_n^2=y_1^2+y_2^2+\ldots+y_n^2$.

A connected graph is given. Prove that its vertices can be coloured blue and green and some of its edges marked so that every two vertices are connected by a path of marked edges, every marked edge connects two vertices of different colour and no two green vertices are connected by an edge of the original graph.