On account of the annual fluctuation of temperature the ground at the town of Ν freezes to a depth of 2 metres. To what depth would it freeze on account of a daily fluctuation of the same amplitude?

Let $ABC$ be an acute-angled triangle with circumcircle $\omega$. Prove that there exists a point $J$ such that for any point $X$ inside $ABC$ if $AX,BX,CX$ intersect $\omega$ in $A_1,B_1,C_1$ and $A_2,B_2,C_2$ be reflections of $A_1,B_1,C_1$ in midpoints of $BC,AC,AB$ respectively then $A_2,B_2,C_2,J$ lie on a circle.

A $4\times4$ grid has its 16 cells colored arbitrarily in three colors. A [i]swap[/i] is an exchange between the colors of two cells. Prove or disprove that it always takes at most three swaps to produce a line of symmetry, regardless of the grid's initial coloring. [i]Proposed by Matthew Babbitt[/i]

Alice and Bob are painting a house. Alice can paint a house in $20$ hours by herself. Bob can paint a house in $40$ hours by himself. Both people start at the same time, paint at their own constant rate, and work together to paint one house. When the house is fully painted, what fraction of the house was painted by Alice?

Let $ABCD$ be a square such that $A=(0,0)$ and $B=(1,1)$. $P(\frac{2}{7},\frac{1}{4})$ is a point inside the square. An ant starts walking from $P$, touches $3$ sides of the square and comes back to the point $P$. The least possible distance traveled by the ant can be expressed as $\frac{\sqrt{a}}{b}$, where $a$ and $b$ are integers and $a$ not divisible by any square number other than $1$. What is the value of $(a+b)$?

In right $ \triangle ABC$ with legs $ 5$ and $ 12$, arcs of circles are drawn, one with center $ A$ and radius $ 12$, the other with center $ B$ and radius $ 5$. They intersect the hypotenuse at $ M$ and $ N$. Then, $ MN$ has length: [asy]size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair A=origin, B=(12,7), C=(12,0), M=12*dir(A--B), N=B+B.y*dir(B--A); real r=degrees(B); draw(A--B--C--cycle^^Arc(A,12,0,r)^^Arc(B,B.y,180+r,270)); pair point=incenter(A,B,C); label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$M$", M, dir(point--M)); label("$N$", N, dir(point--N)); label("$12$", (6,0), S); label("$5$", (12,3.5), E);[/asy] $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ \frac {13}{5} \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ \frac {24}{5}$

Initially, a non-constant polynomial $S(x)$ with real coefficients is written down on a board. Whenever the board contains a polynomial $P(x)$, not necessarily alone, one can write down on the board any polynomial of the form $P(C + x)$ or $C + P(x)$ where $C$ is a real constant. Moreover, if the board contains two (not necessarily distinct) polynomials $P(x)$ and $Q(x)$, one can write $P(Q(x))$ and $P(x) + Q(x)$ down on the board. No polynomial is ever erased from the board. Given two sets of real numbers, $A = \{ a_1, a_2, \dots, a_n \}$ and $B = \{ b_1, \dots, b_n \}$, a polynomial $f(x)$ with real coefficients is $(A,B)$-[i]nice[/i] if $f(A) = B$, where $f(A) = \{ f(a_i) : i = 1, 2, \dots, n \}$. Determine all polynomials $S(x)$ that can initially be written down on the board such that, for any two finite sets $A$ and $B$ of real numbers, with $|A| = |B|$, one can produce an $(A,B)$-[i]nice[/i] polynomial in a finite number of steps. [i]Proposed by Navid Safaei, Iran[/i]

$18.$ A subset $B$ of the set of first $100$ positive integers has the property that no two elements of $B$ sum to $125.$ What is the maximum possible number of elements in $B ?$

Consider a table of cyclic permutations ($n\ge2$) \[ \begin{matrix} 1, & 2, & \ldots, & n-1, & n \\ 2, & 3, & \ldots, & n, & 1, \\ \vdots & \vdots & \ddots & \vdots & \vdots \\ n, & 1, & \ldots, & n-2, & n-1. \end{matrix} \] Then multiply each number of the first row by that number of the $k$-th row that is in the same column. Sum all these products and denote $s_k$ the result (e.g. $s_2=1\cdot2+2\cdot3+\cdots+(n-1)\cdot n+n\cdot1$). a) Find a recursive relation for $s_k$ in terms of $s_{k-1}$ and determine the explicit formula for $s_k$. b) Determine both an index $k$ and the value of $s_k$ such that the sum $s_k$ is minimal.

[u]Round 1[/u] [b]p1.[/b] Alex is on a week-long mining quest. Each morning, she mines at least $1$ and at most $10$ diamonds and adds them to her treasure chest (which already contains some diamonds). Every night she counts the total number of diamonds in her collection and finds that it is divisible by either $22$ or $25$. Show that she miscounted. [b]p2.[/b] Hermione set out a row of $11$ Bertie Bott’s Every Flavor Beans for Ron to try. There are $5$ chocolateflavored beans that Ron likes and $6$ beans flavored like earwax, which he finds disgusting. All beans look the same, and Hermione tells Ron that a chocolate bean always has another chocolate bean next to it. What is the smallest number of beans that Ron must taste to guarantee he finds a chocolate one? [b]p3.[/b] There are $101$ pirates on a pirate ship: the captain and $100$ crew. Each pirate, including the captain, starts with $1$ gold coin. The captain makes proposals for redistributing the coins, and the crew vote on these proposals. The captain does not vote. For every proposal, each crew member greedily votes “yes” if he gains coins as a result of the proposal, “no” if he loses coins, and passes otherwise. If strictly more crew members vote “yes” than “no,” the proposal takes effect. The captain can make any number of proposals, one after the other. What is the largest number of coins the captain can accumulate? [b]p4.[/b] There are $100$ food trucks in a circle and $10$ gnomes who sample their menus. For the first course, all the gnomes eat at different trucks. For each course after the first, gnome #$1$ moves $1$ truck left or right and eats there; gnome #$2$ moves $2$ trucks left or right and eats there; ... gnome #$10$ moves $10$ trucks left or right and eats there. All gnomes move at the same time. After some number of courses, each food truck had served at least one gnome. Show that at least one gnome ate at some food truck twice. [b]p5.[/b] The town of Lumenville has $100$ houses and is preparing for the math festival. The Tesla wiring company lays lengths of power wire in straight lines between the houses so that power flows between any two houses, possibly by passing through other houses.The Edison lighting company hangs strings of lights in straight lines between pairs of houses so that each house is connected by a string to exactly one other. Show that however the houses are arranged, the Edison company can always hang their strings of lights so that the total length of the strings is no more than the total length of the power wires the Tesla company used. [img]https://cdn.artofproblemsolving.com/attachments/9/2/763de9f4138b4dc552247e9316175036c649b6.png[/img] [u]Round 2[/u] [b]p6.[/b] What is the largest number of zeros that could appear at the end of $1^n + 2^n + 3^n + 4^n$, where n can be any positive integer? [b]p7.[/b] A tennis academy has $2023$ members. For every group of 1011 people, there is a person outside of the group who played a match against everyone in it. Show there is someone who has played against all $2022$ other members. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a quartet of positive numbers $a,b,c,d$, and is known, that $abcd=1$. Prove that $$a^2+b^2+c^2+d^2+ab+ac+ad+bc+bd+dc \ge 10$$

The parliament of the country Ar consists of two houses, upper and lower, both have the same number of people. The law says that each member must vote "Yes" or "No". One day, when all members of both houses were present and voted on an important issue, the speaker informed the press that the number of members voted "Yes" was greater by $23$ than the number of members voted "No". Prove that he made a mistake.

Let $n\geq 2$ be a positive integer and let $a_1,a_2,...,a_n\in[0,1]$ be real numbers. Find the maximum value of the smallest of the numbers: \[a_1-a_1a_2, \ a_2-a_2a_3,...,a_n-a_na_1.\]

Five points are given in the plane that each of $10$ triangles they define has area greater than $2$. Prove that there exists a triangle of area greater than $3$.

Ali who has $10$ candies eats at least one candy a day. In how many different ways can he eat all candies (according to distribution among days)? $ \textbf{(A)}\ 64 \qquad\textbf{(B)}\ 126 \qquad\textbf{(C)}\ 243 \qquad\textbf{(D)}\ 512 \qquad\textbf{(E)}\ 1025 $

Prove that for each $n\geq 2$, there is a set $S$ of $n$ integers such that $(a-b)^2$ divides $ab$ for every distinct $a,b\in S$.

Prove that $ 7^{2^{20}} + 7^{2^{19}} + 1 $ has at least $ 21 $ distinct prime divisors.

Find for which positive integers $n$ the $A_n$ alternating group has a permutation which is contained in exactly one $2$-Sylow subgroup of $A_n$. [i]Proposed by Péter Pál Pálfy[/i]

Find the last three digits in the product $1 \cdot 3\cdot 5\cdot 7 \cdot . . . \cdot 2009 \cdot 2011$.

Real constants $ a, b, c$ are such that there is exactly one square all of whose vertices lie on the cubic curve $ y \equal{} x^3 \plus{} ax^2 \plus{} bx \plus{} c.$ Prove that the square has sides of length $ \sqrt[4]{72}.$

[b]p1.[/b] We define $a \oplus b = \frac{ab}{a+b}$. Compute $(3 \oplus 5) \oplus (5 \oplus 4)$. [b]p2.[/b] Let $ABCD$ be a quadrilateral with $\angle A = 45^o$ and $\angle B = 45^o$. If $BC = 5\sqrt2$, $AD = 6\sqrt2$, and $AB = 18$, find the length of side $CD$. [b]p3.[/b] A positive real number $x$ satisfies the equation $x^2 + x + 1 + \frac{1}{x }+\frac{1}{x^2} = 10$. Find the sum of all possible values of $x + 1 + \frac{1}{x}$. [b]p4.[/b] David writes $6$ positive integers on the board (not necessarily distinct) from least to greatest. The mean of the first three numbers is $3$, the median of the first four numbers is $4$, the unique mode of the first five numbers is $5$, and the range of all 6 numbers is $6$. Find the maximum possible value of the product of David’s $6$ integers. [b]p5.[/b] Let $ABCD$ be a convex quadrilateral such that $\angle A = \angle B = 120^o$ and $\angle C = \angle D = 60^o$. There exists a circle with center $I$ which is tangent to all four sides of $ABCD$. If $IA \cdot IB \cdot IC \cdot ID = 240$, find the area of quadrilateral $ABCD$. [b]p6.[/b] The letters $EXETERMATH$ are placed into cells on an annulus as shown below. How many ways are there to color each cell of the annulus with red, blue, green, or yellow such that each letter is always colored the same color and adjacent cells are always colored differently? [img]https://cdn.artofproblemsolving.com/attachments/3/5/b470a771a5279a7746c06996f2bb5487c33ecc.png[/img] [b]p7.[/b] Let $ABCD$ be a square, and let $\omega$ be a quarter circle centered at $A$ passing through points $B$ and $D$. Points $E$ and $F$ lie on sides $BC$ and $CD$ respectively. Line $EF$ intersects $\omega$ at two points, $G$ and $H$. Given that $EG = 2$, $GH = 16$ and $HF = 9$, find the length of side $AB$. [b]p8.[/b] Let x be equal to $\frac{2022! + 2021!}{2020! + 2019! + 2018!}$ . Find the closest integer to $2\sqrt{x}$. [b]p9.[/b] For how many ordered pairs of positive integers $(m, n)$ is the absolute difference between $lcm(m, n)$ and $gcd(m, n)$ equal to $2023$? [b]p10.[/b] There are $2023$ distinguishable frogs sitting on a number line with one frog sitting on $i$ for all integers $i$ between $-1011$ and $1011$, inclusive. Each minute, every frog randomly jumps either one unit left or one unit right with equal probability. After $1011$ minutes, over all possible arrangements of the frogs, what is the average number of frogs sitting on the number $0$? [b]p11.[/b] Albert has a calculator initially displaying $0$ with two buttons: the first button increases the number on the display by one, and the second button returns the square root of the number on the display. Each second, he presses one of the two buttons at random with equal probability. What is the probability that Albert’s calculator will display the number $6$ at some point? [b]p12.[/b] For a positive integer $k \ge 2$, let $f(k)$ be the number of positive integers $n$ such that n divides $(n-1)!+k$. Find $$f(2) + f(3) + f(4) + f(5) + ... + f(100).$$ [b]p13.[/b] Mr. Atf has nine towers shaped like rectangular prisms. Each tower has a $1$ by $1$ base. The first tower as height $1$, the next has height $2$, up until the ninth tower, which has height $9$. Mr. Atf randomly arranges these $9$ towers on his table so that their square bases form a $3$ by $3$ square on the surface of his table. Over all possible solids Mr. Atf could make, what is the average surface area of the solid? [b]p14.[/b] Let $ABCD$ be a cyclic quadrilateral whose diagonals are perpendicular. Let $E$ be the intersection of $AC$ and $BD$, and let the feet of the altitudes from $E$ to the sides $AB$, $BC$, $CD$, $DA$ be $W, X, Y , Z$ respectively. Given that $EW = 2EY$ and $EW \cdot EX \cdot EY \cdot EZ = 36$, find the minimum possible value of $\frac{1}{[EAB]} +\frac{1}{[EBC]}+\frac{1}{[ECD]} +\frac{1}{[EDA]}$. The notation $[XY Z]$ denotes the area of triangle $XY Z$. [b]p15.[/b] Given that $x^2 - xy + y^2 = (x + y)^3$, $y^2 - yz + z^2 = (y + z)^3$, and $z^2 - zx + x^2 = (z + x)^3$ for complex numbers $x, y, z$, find the product of all distinct possible nonzero values of $x + y + z$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$

Quadratic function $f(x)=ax^2+bx+c$ satisfies that: $(1)\forall x\in\mathbb{R},f(x-4)=f(2-x),f(x)\geq x$; $(2)\forall x\in(0,2),f(x)\leq\left(\frac{x+1}{2}\right)^2$; $(3)\min\limits_{x\in\mathbb{R}}f(x)=0$ Find the maximum of $m(m>1)$, satisfying: There exists $t\in\mathbb{R}$, as long as $x\in[1,m]$, then $f(x+t)\leq x$.

A $5\times5$ grid of squares is filled with integers. Call a rectangle [i]corner-odd[/i] if its sides are grid lines and the sum of the integers in its four corners is an odd number. What is the maximum possible number of corner-odd rectangles within the grid? Note: A rectangles must have four distinct corners to be considered [i]corner-odd[/i]; i.e. no $1\times k$ rectangle can be [i]corner-odd[/i] for any positive integer $k$.

Let $ A_1,B_1,C_1 $ be points on the sides (excluding their endpoints) $ BC,CA,AB, $ respectively, of a triangle $ ABC, $ such that $ \angle A_1AB =\angle B_1BC=\angle C_1CA. $ Let $ A^* $ be the intersection of $ BB_1 $ with $ CC_1,B^* $ be the intersection of $ CC_1 $ with $ AA_1, $ and $ C^* $ be the intersection of $ AA_1 $ with $ BB_1. $ Denote with $ r_A,r_B,r_C $ the inradii of $ A^*BC,AB^*C,ABC^*, $ respectively. Prove that $$ \frac{r_A}{BC}=\frac{r_B}{CA}=\frac{r_C}{AB} $$ if and only if $ ABC $ is equilateral. [i]Daniel Văcărețu[/i]