A flower bouquet contains pink roses, red roses, pink carnations, and red carnations. One third of the pink flowers are roses, three fourths of the red flowers are carnations, and six tenths of the flowers are pink. What percent of the flowers are carnations? $ \textbf{(A)}\ 15\qquad\textbf{(B)}\ 30\qquad\textbf{(C)}\ 40\qquad\textbf{(D)}\ 60\qquad\textbf{(E)}\ 70 $

In an $m\times n$ rectangular grid, where m and n are odd integers, $1\times 2$ dominoes are initially placed so as to exactly cover all but one of the $1\times 1$ squares at one corner of the grid. It is permitted to slide a domino towards the empty square, thus exposing another square. Show that by a sequence of such moves, we can move the empty square to any corner of the rectangle. [i]A. Shapovalov[/i]

Consider $n \geq 2$ distinct points in the plane $A_1,A_2,...,A_n$ . Color the midpoints of the segments determined by each pair of points in red. What is the minimum number of distinct red points?

At a party, a group of $20$ people needs to be seated at $4$ tables. The seating arrangement is called [i]successful [/i] if any two people at the same table are friends. It turned out that successful seating arrangements exist. In a successful seating arrangement, exactly $5$ people sit at each table. What is the greatest possible number of pairs of friends in this companies?

Suppose $A=\{1,2,\dots,2002\}$ and $M=\{1001,2003,3005\}$. $B$ is an non-empty subset of $A$. $B$ is called a $M$-free set if the sum of any two numbers in $B$ does not belong to $M$. If $A=A_1\cup A_2$, $A_1\cap A_2=\emptyset$ and $A_1,A_2$ are $M$-free sets, we call the ordered pair $(A_1,A_2)$ a $M$-partition of $A$. Find the number of $M$-partitions of $A$.

In a certain country there are $10$ cities connected by a network of one-way nonstop flights so that it is possible to fly (using one or more flights) from any city to any other. Let $n$ be the least number of flights needed to complete a trip starting from one of the cities, visiting all others and returning to the starting point. Find the greatest possible value of $n$.

The plane is dissected by broken lines into some regions. It is possible to paint the map formed by these regions in three colours so that any neighbouring regions will have different colours. Call by knots the points which belong to at least two segments of broken lines. One of the segments connecting two knots is erased and replaced by arbitrary broken line connecting the same knots. Prove that it is possible to paint new map in three colours so that any neighbouring regions will have different colours.

Let $n$ be a positive integer. Each point $(x,y)$ in the plane, where $x$ and $y$ are non-negative integers with $x+y<n$, is coloured red or blue, subject to the following condition: if a point $(x,y)$ is red, then so are all points $(x',y')$ with $x'\leq x$ and $y'\leq y$. Let $A$ be the number of ways to choose $n$ blue points with distinct $x$-coordinates, and let $B$ be the number of ways to choose $n$ blue points with distinct $y$-coordinates. Prove that $A=B$.

We are given $b$ white balls and $n$ black balls ($b,n>0$) which are to be distributed among two urns, at least one in each. Let $s$ be the number of balls in the first urn, and $r$ the number of white ones among them. One randomly chooses an urn and randomly picks a ball from it. (a) Compute the probability $p$ that the drawn ball is white. (b) If $s$ is fixed, for which $r$ is $p$ maximal? (c) Find the distribution of balls among the urns which maximizes $p$. (d) Give a generalization for larger numbers of colors and urns.

The numbers $1$ through $4^{n}$ are written on a board. In each step, Pedro erases two numbers $a$ and $b$ from the board, and writes instead the number $\frac{ab}{\sqrt{2a^2+2b^2}}$. Pedro repeats this procedure until only one number remains. Prove that this number is less than $\frac{1}{n}$, no matter what numbers Pedro chose in each step.

An [i]operation[/i] on three given non-negative integers consists in increasing two of them by $1$ and decreasing the third by $2$, provided the new numbers are non-negative. The process begins with three non-negative integers that add up to $100$ and are less than $100$. Find the number of distinct triplets that can be obtained by applying the operation. (Triplets that differ only in the order of their members are considered the same).

Alice and Bob play the following game on a $100\times 100$ grid, taking turns, with Alice starting first. Initially the grid is empty. At their turn, they choose an integer from $1$ to $100^2$ that is not written yet in any of the cells and choose an empty cell, and place it in the chosen cell. When there is no empty cell left, Alice computes the sum of the numbers in each row, and her score is the maximum of these $100$ numbers. Bob computes the sum of the numbers in each column, and his score is the maximum of these $100$ numbers. Alice wins if her score is greater than Bob's score, Bob wins if his score is greater than Alice's score, otherwise no one wins. Find if one of the players has a winning strategy, and if so which player has a winning strategy. [i]Théo Lenoir, France[/i]

There are $n$ cells with indices from $1$ to $n$. Originally, in each cell, there is a card with the corresponding index on it. Vasya shifts the card such that in the $i$-th cell is now a card with the number $a_i$. Petya can swap any two cards with the numbers $x$ and $y$, but he must pay $2|x-y|$ coins. Show that Petya can return all the cards to their original position, not paying more than $|a_1-1|+|a_2-2|+\ldots +|a_n-n|$ coins.

Prove that the set of positive integers cannot be partitioned into three nonempty subsets such that, for any two integers $x,y$ taken from two different subsets, the number $x^2-xy+y^2$ belongs to the third subset.

p1. Let $U_n$ be a sequence of numbers that satisfy: $U_1=1$, $U_n=1+U_1U_2U_3...U_{n-1}$ for $n=2,3,...,2020$ Prove that $\frac{1}{U_1}+\frac{1}{U_2}+...+\frac{1}{U_{2019}}<2$ p2. If $a= \left \lceil \sqrt{2020+\sqrt{2020+...+\sqrt{2020}}} \right\rceil$ , $b= \left \lfloor \sqrt{1442+\sqrt{1442+...+\sqrt{1442}}} \right \rfloor$, and $c=a-b$, then determine the value of $c$. p3. Fajar will buy a pair of koi fish in the aquarium. If he randomly picks $2$ fish, then the probability that the $2$ fish are of the same sex is $1/2$. Prove that the number of koi fish in the aquarium is a perfect square. p4. A pharmacist wants to put $155$ ml of liquid into $3$ bottles. There are 3 bottle choices, namely a. Bottle A $\bullet$ Capacity: $5$ ml $\bullet$ The price of one bottle is $10,000$ Rp $\bullet$ If you buy the next bottle, you will get a $20\%$ discount, up to the $4$th purchase or if you buy $4$ bottles, get $ 1$ free bottle A b. Bottle B $\bullet$ Capacity: $8$ ml $\bullet$ The price of one bottle is $15.000$ Rp $\bullet$ If you buy $2$ : $20\%$ discount $\bullet$ If you buy $3$ : Free $ 1$ bottle of B c. Bottle C $\bullet$ Capacity : $14$ ml $\bullet$ Buy $ 1$ : $25.000$ Rp $\bullet$ Buy $2$ : Free $ 1$ bottle of A $\bullet$ Buy $3$ : Free $ 1$ bottle of B If in one purchase, you can only buy a maximum of $4$ bottles, then look for the possibility of pharmacists putting them in bottles so that the cost is minimal (bottles do not have to be filled to capacity). p5. Two circles, let's say $L_1$ and $L_2$ have the same center, namely at point $O$. Radius of $L_1$ is $10$ cm and radius of $L_2$ is $5$ cm. The points $A, B, C, D, E, F$ lie on $L_1$ so the arcs $AB,BC,CD,DE,EF,FA$ are equal. The points $P, Q, R$ lie on $L_2$ so that the arcs $PQ,QR,RS$ are equal and $PA=PF=QB=QC=RD=RD$ . Determine the area of ​​the shaded region. [img]https://cdn.artofproblemsolving.com/attachments/b/5/0729eca97488ddfc82ab10eda02c708fecd7ae.png[/img]

There are $2n$ consecutive integers on a board. It is permitted to split them into pairs and simultaneously replace each pair by their difference (not necessarily positive) and their sum. Prove that it is impossible to obtain any $2n$ consecutive integers again. Alexandr Gribalko

We call an ordered set of distinct natural numbers good if for any two numbers in it, the larger one is divided by the smaller one. Prove that the number $(n + 1)! – 1$ can be represented as $x_1 + 2x_2 + \ldots + nx_n$, where $\{ x_1, x_2, \ldots , x_n \}$ is a good set, by at least $n!$ ways.

Find the smallest positive integer $n$ such that if $n$ squares of a $1000 \times 1000$ chessboard are colored, then there will exist three colored squares whose centers form a right triangle with sides parallel to the edges of the board.

At the beginning there are $2017$ marbles in each of $1000$ boxes. On each move Aybike chooses a box, grabs some of the marbles from that box and delivers them one for each to the boxes she wishes. At least how many moves does Aybike have to make to have different number of marbles in each box?

Let $M= \{ 1, 2, \cdots, 19 \}$ and $A = \{ a_{1}, a_{2}, \cdots, a_{k}\}\subseteq M$. Find the least $k$ so that for any $b \in M$, there exist $a_{i}, a_{j}\in A$, satisfying $b=a_{i}$ or $b=a_{i}\pm a_{i}$ ($a_{i}$ and $a_{j}$ do not have to be different) .

Prair writes the letters $A,B,C,D$, and $E$ such that neither vowel are written first, and they are not adjacent; such that there exists at least one pair of adjacent consonants; and such that exactly five pairs of letters are in alphabetical order. How many possible ways could Prair have ordered the letters?

In a room, we have 2019 aligned switches, connected to 2019 light bulbs, all initially switched on. Then, 2019 people enter the room one by one, performing the operation: The first, uses all the switches; the second, every second switch; the third, every third switch, and so on. How many lightbulbs remain switched on, after all the people entered ?

A bag contains plastic cubes of the same size, whose faces have been painted in colors: white, red, yellow, green, blue and violet (without repeating a color on two faces of the same cube). How many of these cubes can there be distinguishable to each other?

We are given $n$ coins of different weights and $n$ balances, $n>2$. On each turn one can choose one balance, put one coin on the right pan and one on the left pan, and then delete these coins out of the balance. It's known that one balance is wrong (but it's not known ehich exactly), and it shows an arbitrary result on every turn. What is the smallest number of turns required to find the heaviest coin? [hide=Thanks]Thanks to the user Vlados021 for translating the problem.[/hide]

[b]p1.[/b] How many real roots does the equation $2x^7 + x^5 + 4x^3 + x + 2 = 0$ have? [b]p2.[/b] Given that $f(n) = 1 +\sum^n_{j=1}(1 +\sum^j_{i=1}(2i + 1))$, find the value of $f(99)-\sum^{99}_{i=1} i^2$. [b]p3.[/b] A rectangular prism with dimensions $1\times a \times b$, where $1 < a < b < 2$, is bisected by a plane bisecting the longest edges of the prism. One of the smaller prisms is bisected in the same way. If all three resulting prisms are similar to each other and to the original box, compute $ab$. Note: Two rectangular prisms of dimensions $p \times q\times r$ and$ x\times y\times z$ are similar if $\frac{p}{x} = \frac{q}{y} = \frac{r}{z}$ . [b]p4.[/b] For fixed real values of $p$, $q$, $r$ and $s$, the polynomial $x^4 + px^3 + qx^2 + rx + s$ has four non real roots. The sum of two of these roots is $4 + 7i$, and the product of the other two roots is $3 - 4i$. Compute $q$. [b]p5.[/b] There are $10$ seats in a row in a theater. Say we have an infinite supply of indistinguishable good kids and bad kids. How many ways can we seat $10$ kids such that no two bad kids are allowed to sit next to each other? [b]p6.[/b] There are an infinite number of people playing a game. They each pick a different positive integer $k$, and they each win the amount they chose with probability $\frac{1}{k^3}$ . What is the expected amount that all of the people win in total? [b]p7.[/b] There are $100$ donuts to be split among $4$ teams. Your team gets to propose a solution about how the donuts are divided amongst the teams. (Donuts may not be split.) After seeing the proposition, every team either votes in favor or against the propisition. The proposition is adopted with a majority vote or a tie. If the proposition is rejected, your team is eliminated and will never receive any donuts. Another remaining team is chosen at random to make a proposition, and the process is repeated until a proposition is adopted, or only one team is left. No promises or deals need to be kept among teams besides official propositions and votes. Given that all teams play optimally to maximize the expected value of the number of donuts they receive, are completely indifferent as to the success of the other teams, but they would rather not eliminate a team than eliminate one (if the number of donuts they receive is the same either way), then how much should your team propose to keep? [b]p8.[/b] Dominic, Mitchell, and Sitharthan are having an argument. Each of them is either credible or not credible – if they are credible then they are telling the truth. Otherwise, it is not known whether they are telling the truth. At least one of Dominic, Mitchell, and Sitharthan is credible. Tim knows whether Dominic is credible, and Ethan knows whether Sitharthan is credible. The following conversation occurs, and Tim and Ethan overhear: Dominic: “Sitharthan is not credible.” Mitchell: “Dominic is not credible.” Sitharthan: “At least one of Dominic or Mitchell is credible.” Then, at the same time, Tim and Ethan both simultaneously exclaim: “I can’t tell exactly who is credible!” They each then think for a moment, and they realize that they can. If Tim and Ethan always tell the truth, then write on your answer sheet exactly which of the other three are credible. [b]p9.[/b] Pick an integer $n$ between $1$ and $10$. If no other team picks the same number, we’ll give you $\frac{n}{10}$ points. [b]p10.[/b] Many quantities in high-school mathematics are left undefined. Propose a definition or value for the following expressions and justify your response for each. We’ll give you $\frac15$ points for each reasonable argument. $$(i) \,\,\,(.5)! \,\,\, \,\,\,(ii) \,\,\,\infty \cdot 0 \,\,\, \,\,\,(iii) \,\,\,0^0 \,\,\, \,\,\,(iv)\,\,\, \prod_{x\in \emptyset}x \,\,\, \,\,\,(v)\,\,\, 1 - 1 + 1 - 1 + ...$$ [b]p11.[/b] On the back of your answer sheet, write the “coolest” math question you know, and include the solution. If the graders like your question the most, then you’ll get a point. (With your permission, we might include your question on the Mixer next year!) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].