Several clocks lie on the table. It is known that at some moment the sum of distances between a point $X$ of the table and the ends of their minute hands is not equal to the sum of distances between $X$ and the ends of their hour hands. Prove that there is a moment when the sum of distances between $X$ and the ends of their minute hands is greater than the sum of distances between $X$ and the ends of their hour hands. (E. Barabanov, I. Voronovich)

What is the largest possible number of acute angles in an $n$-gon which is not selfintersecting (no two non-adjacent edges interesect)?

We will say that a plane is [i]well-colored[/i] in several colors if it is divided into convex polygons with an area of at least $1/1000$ and each polygon is colored in one color. Points lying on the border of several polygons can be colored in any of their colors. Are there convex is a $9$-gon $R$ and a good coloring of the plane in $7$ colors such that in any polygon obtained from $R$ by a translate to any vector, all colors occupy the same area ($1/7$ of the area of $R$)?

[b]p1.[/b] A large square is cut into four smaller, congruent squares. If each of the smaller squares has perimeter $4$, what was the perimeter of the original square? [b]p2.[/b] Pie loves to bake apples so much that he spends $24$ hours a day baking them. If Pie bakes a dozen apples in one day, how many minutes does it take Pie to bake one apple, on average? [b]p3.[/b] Bames Jond is sent to spy on James Pond. One day, Bames sees James type in his $4$-digit phone password. Bames remembers that James used the digits $0$, $5$, and $9$, and no other digits, but he does not remember the order. How many possible phone passwords satisfy this condition? [b]p4.[/b] What do you get if you square the answer to this question, add $256$ to it, and then divide by $32$? [b]p5.[/b] Chloe the Horse and Flower the Chicken are best friends. When Chloe gets sad for any reason, she calls Flower, so Chloe must remember Flower's $3$ digit phone number, which can consist of any digits $0-5$. Given that the phone number's digits are unique and add to $5$, the number does not start with $0$, and the $3$ digit number is prime, what is the sum of all possible phone numbers? [b]p6.[/b] Anuj has a circular pizza with diameter $A$ inches, which is cut into $B$ congruent slices, where $A$,$B$ are positive integers. If one of Anuj's pizza slices has a perimeter of $3\pi + 30$ inches, find $A + B$. [b]p7.[/b] Bob really likes to study math. Unfortunately, he gets easily distracted by messages sent by friends. At the beginning of every minute, there is an $\frac{6}{10}$ chance that he will get a message from a friend. If Bob does get a message from a friend, there is a $\frac{9}{10}$ chance that he will look at the message, causing him to waste $30$ seconds before resuming his studying. If Bob doesn't get a message from a friend, there is a $\frac{3}{10}$ chance Bob will still check his messages hoping for a message from his friends, wasting $10$ seconds before he resumes his studying. What is the expected number of minutes in $100$ minutes for which Bob will be studying math? [b]p8.[/b] Suppose there is a positive integer $n$ with $225$ distinct positive integer divisors. What is the minimum possible number of divisors of n that are perfect squares? [b]p9.[/b] Let $a, b, c$ be positive integers. $a$ has $12$ divisors, $b$ has $8$ divisors, $c$ has $6$ divisors, and $lcm(a, b, c) = abc$. Let $d$ be the number of divisors of $a^2bc$. Find the sum of all possible values of $d$. [b]p10.[/b] Let $\vartriangle ABC$ be a triangle with side lengths $AB = 17$, $BC = 28$, $AC = 25$. Let the altitude from $A$ to $BC$ and the angle bisector of angle $B$ meet at $P$. Given the length of $BP$ can be expressed as $\frac{a\sqrt{b}}{c}$ for positive integers $a$, $b$, $c$ where $gcd(a, c) = 1$ and $b$ is not divisible by the square of any prime, find $a + b + c$. [b]p11.[/b] Let $a$, $b$, and $c$ be the roots of the cubic equation $x^3-5x+3 = 0$. Let $S = a^4b+ab^4+a^4c+ac^4+b^4c+bc^4$. Find $|S|$. [b]p12.[/b] Call a number palindromeish if changing a single digit of the number into a different digit results in a new six-digit palindrome. For example, the number $110012$ is a palindromeish number since you can change the last digit into a $1$, which results in the palindrome $110011$. Find the number of $6$ digit palindromeish numbers. [b]p13.[/b] Let $P(x)$ be a polynomial of degree $3$ with real coecients and leading coecient $1$. Let the roots of $P(x)$ be $a$, $b$, $c$. Given that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}= 4$ and $a^2 + b^2 + c^2 = 36$, the coefficient of $x^2$ is negative, and $P(1) = 2$, let the $S$ be the sum of possible values of $P(0)$. Then $|S|$ can be expressed as $\frac{a + b\sqrt{c}}{d}$ for positive integers $a$, $b$, $c$, $d$ such that $gcd(a, b, d) = 1$ and $c$ is not divisible by the square of any prime. Find $a + b + c + d$. [b]p14.[/b] Let $ABC$ be a triangle with side lengths $AB = 7$, $BC = 8$, $AC = 9$. Draw a circle tangent to $AB$ at $B$ and passing through $C$. Let the center of the circle be $O$. The length of $AO$ can be expressed as $\frac{a\sqrt{b}}{c\sqrt{d}}$ for positive integers $a$, $b$, $c$, $d$ where $gcd(a, c) = gcd(b, d) = 1$ and $b$,$ d$ are not divisible by the square of any prime. Find $a + b + c + d$. [b]p15.[/b] Many students in Mr. Noeth's BC Calculus class missed their first test, and to avoid taking a makeup, have decided to never leave their houses again. As a result, Mr. Noeth decides that he will have to visit their houses to deliver the makeup tests. Conveniently, the $17$ absent students in his class live in consecutive houses on the same street. Mr. Noeth chooses at least three of every four people in consecutive houses to take a makeup. How many ways can Mr. Noeth select students to take makeups? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We are given an equilateral triangle ABC with the length of its side equal to $1$. There are $n-1$ points on each side of the triangle $ABC$ that equally divide the side into $n$ segments. We draw all possible lines that pass through any two of all those $3(n-1)$ points such that they are parallel to one of three sides of triangle $ABC$. All such lines divide triangle $ABC$ into some lesser triangles whose vertices are called [i]nodes[/i]. We assign a real number for each [i]node[/i] such that the following conditions are satisfied: (I) real numbers $a,b,c$ are assigned to $A,B,C$ respectively; (II) for any rhombus that is consisted of two lesser triangles that share a common side, the sum of the numbers of vertices on its one diagonal is equal to that of vertices on the other diagonal. 1) Find the minimum distance between the [i]node[/i] with the maximal number to the [i]node[/i] with the minimal number; 2) Denote by $S$ the sum of the numbers of all [i]nodes[/i], find $S$.

[b]p1.[/b] Vivek has three letters to send out. Unfortunately, he forgets which letter is which after sealing the envelopes and before putting on the addresses. He puts the addresses on at random sends out the letters anyways. What are the chances that none of the three recipients get their intended letter? [b]p2.[/b] David is a horrible bowler. Luckily, Logan and Christy let him use bumpers. The bowling lane is $2$ meters wide, and David's ball travels a total distance of $24$ meters. How many times did David's bowling ball hit the bumpers, if he threw it from the middle of the lane at a $60^o$ degree angle to the horizontal? [b]p3.[/b] Find $\gcd \,(212106, 106212)$. [b]p4.[/b] Michael has two fair dice, one six-sided (with sides marked $1$ through $6$) and one eight-sided (with sides marked $1-8$). Michael play a game with Alex: Alex calls out a number, and then Michael rolls the dice. If the sum of the dice is equal to Alex's number, Michael gives Alex the amount of the sum. Otherwise Alex wins nothing. What number should Alex call to maximize his expected gain of money? [b]p5.[/b] Suppose that $x$ is a real number with $\log_5 \sin x + \log_5 \cos x = -1$. Find $$|\sin^2 x \cos x + \cos^2 x \sin x|.$$ [b]p6.[/b] What is the volume of the largest sphere that FIts inside a regular tetrahedron of side length $6$? [b]p7.[/b] An ant is wandering on the edges of a cube. At every second, the ant randomly chooses one of the three edges incident at one vertex and walks along that edge, arriving at the other vertex at the end of the second. What is the probability that the ant is at its starting vertex after exactly $6$ seconds? [b]p8.[/b] Determine the smallest positive integer $k$ such that there exist $m, n$ non-negative integers with $m > 1$ satisfying $$k = 2^{2m+1} - n^2.$$ [b]p9.[/b] For $A,B \subset Z$ with $A,B \ne \emptyset$, define $A + B = \{a + b|a \in A, b \in B\}$. Determine the least $n$ such that there exist sets $A,B$ with $|A| = |B| = n$ and $A + B = \{0, 1, 2,..., 2012\}$. [b]p10.[/b] For positive integers $n \ge 1$, let $\tau (n)$ and $\sigma (n)$ be, respectively, the number of and sum of the positive integer divisors of $n$ (including $1$ and $n$). For example, $\tau (1) = \sigma (1) = 1$ and $\tau (6) = 4$, $\sigma (6) = 12$. Find the number of positive integers $n \le 100$ such that $$\sigma (n) \le (\sqrt{n} - 1)^2 +\tau (n)\sqrt{n}.$$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A round robin tennis tournament is played among $4$ friends in which each player plays every other player only one time, resulting in either a win or a loss for each player. If overall placement is determined strictly by how many games each player won, how many possible placements are there at the end of the tournament? For example, Andy and Bob tying for first and Charlie and Derek tying for third would be one possible case.

Suppose $n$ coins are available that their mass is unknown. We have a pair of balances and every time we can choose an even number of coins and put half of them on one side of the balance and put another half on the other side, therefore a [i]comparison[/i] will be done. Our aim is determining that the mass of all coins is equal or not. Show that at least $n-1$ [i]comparisons[/i] are required.

Consider a cube and let$ M, N$ be two of its vertices. Assign the number $1$ to these vertices and $0$ to the other six vertices. We are allowed to select a vertex and to increase with a unit the numbers assigned to the $3$ adjiacent vertices - call this a [i]movement[/i]. Prove that there is a sequence of [i]movements [/i] after which all the numbers assigned to the vertices of the cube became equal if and only if $MN$ is not a diagonal of a face of the cube. Marius Ghergu, Dinu Serbanescu

For any 2 convex polygons $S$ and $T$, if all the vertices of $S$ are vertices of $T$, call $S$ a sub-polygon of $T$. [b]I. [/b]Prove that for an odd number $n \geq 5$, there exists $m$ sub-polygons of a convex $n$-gon such that they do not share any edges, and every edge and diagonal of the $n$-gon are edges of the $m$ sub-polygons. [b]II.[/b] Find the smallest possible value of $m$.

In each cell of a $4 \times 4$ grid, one of the two diagonals is drawn uniformly at random. Compute the probability that the resulting $32$ triangular regions can be colored red and blue so that any two regions sharing an edge have different colors.

Two treasure-hunters found a treasure containing coins of value $a_1< a_2 < ... < a_{2003}$ (the quantity of coins of each value is unlimited). The first treasure-hunter forms all the possible sets of different coins containing odd number of elements, and takes the most valuable coin of each such set. The second treasure-hunter forms all the possible sets of different coins containing even number of elements, and takes the most valuable coin of each such set. Which one of them is going to have more money and how much more? (H. Nestra)

In country some cities are connected by oneway flights( There are no more then one flight between two cities). City $A$ called "available" for city $B$, if there is flight from $B$ to $A$, maybe with some transfers. It is known, that for every 2 cities $P$ and $Q$ exist city $R$, such that $P$ and $Q$ are available from $R$. Prove, that exist city $A$, such that every city is available for $A$.

A graph $G$ is called $\textit{divisibility graph}$ if the vertices can be assigned distinct positive integers such that between two vertices assigned $u, v$ there is an edge iff $\frac{u} {v}$ or $\frac{v} {u}$ is a positive integer. Show that for any positive integer $n$ and $0 \leq e \leq \frac{n(n-1)}{2}$, there is a $\textit{divisibility graph}$ with $n$ vertices and $e$ edges. [hide=Remark on source of 10.3] It appears to be Kvant 2022 Issue 10 M2719, so it will not be posted; the same problem was also used as 9.4.

Consider the Sierpinski triangle iterations drawn below. $S_0$ is a single triangle, and $S_{n+1}$ consists of three copies of $S_n.$ Let a [i]maximal line segment[/i] be line segment in the drawing of $S_k$ which cannot be extended any further while remaining in $S_k.$ For example, $S_0$ has three maximal line segments and $S_1$ has $6$ maximal line segments. How many maximal line segments are there in $S_5$? [center] [img]https://cdn.artofproblemsolving.com/attachments/6/2/51d83da65910cd32ce0b235a9615ec467870e1.png[/img] [/center]

Consider a system of infinitely many spheres made of metal, with centers at points $(a, b, c) \in \mathbb Z^3$. We say that the system is stable if the temperature of each sphere equals the average temperature of the six closest spheres. Assuming that all spheres in a stable system have temperatures between $0^\circ C$ and $1^\circ C$, prove that all the spheres have the same temperature.

A $2^{2014} + 1$ by $2^{2014} + 1$ grid has some black squares filled. The filled black squares form one or more snakes on the plane, each of whose heads splits at some points but never comes back together. In other words, for every positive integer $n$ greater than $2$, there do not exist pairwise distinct black squares $s_1$, $s_2$, \dots, $s_n$ such that $s_i$ and $s_{i+1}$ share an edge for $i=1,2, \dots, n$ (here $s_{n+1}=s_1$). What is the maximum possible number of filled black squares? [i]Proposed by David Yang[/i]

Several positive integers $a_0 , a_1 , a_2 , ... , a_n$ are written on a board. On a second board, we write the amount $b_0$ of numbers written on the first board, the amount $b_1$ of numbers on the first board exceeding $1$, the amount $b_2$ of numbers greater than $2$, and so on as long as the $b$s are still positive. Then we stop, so that we do not write any zeros. On a third board we write the numbers $c_0 , c_1 , c_2 , ...$. using the same rules as before, but applied to the numbers $b_0 , b_1 , b_2 , ...$ of the second board. Prove that the same numbers are written on the first and the third boards. (H. Lebesgue - A Kanel)

Is it possible to arrange all the integers from $0$ to $9$ in circles so that the sum of three numbers along any of the six segments is the same? [img]https://cdn.artofproblemsolving.com/attachments/c/1/1a577fb4a607c395f5cc07b63653307b569b95.png[/img]

A $2008 \times 2009$ rectangle is divided into unit squares. In how many ways can you remove a pair of squares such that the remainder can be covered with $1 \times 2$ dominoes?

Determine the number of permutations $a_1, a_2, \dots, a_n$ of $1, 2, \dots, n$ such that for every positive integer $k$ with $1 \le k \le n$, there exists an integer $r$ with $0 \le r \le n - k$ which satisfies \[ 1 + 2 + \dots + k = a_{r+1} + a_{r+2} + \dots + a_{r+k}. \]

A finite number of stones are [i]good[/i] when the weight of each of these stones is less than the total weight of the rest. It is known that arbitrary $n-1$ of the given $n$ stones is [i]good[/i]. Prove that it is possible to choose a [i]good[/i] triple from these stones.

For each natural number $k$ find the least number $n$ such that in every tournament with $n$ vertices, there exists a vertex with in-degree and out-degree at least $k$. (Tournament is directed complete graph.)

Let $S > 1$ be a real number. The Cartesian plane is partitioned into rectangles whose sides are parallel to the axes of the coordinate system. and whose vertices have integer coordinates. Prove that if the area of each triangle if at most $S$, then for any positive integer $k$ there exist $k$ vertices of these rectangles which lie on a line.

Given is a simple graph $G$ with $2022$ vertices, such that for any subset $S$ of vertices (including the set of all vertices), there is a vertex $v$ with $deg_{S}(v) \leq 100$. Find $\chi(G)$ and the maximal number of edges $G$ can have.