a) Consider the function $$f(x,y) = x^2 + xy + y^2$$ Prove that for the every point $(x,y)$ there exist such integers $(m,n)$, that $$f((x-m),(y-n)) \le 1/2$$ b) Let us denote with $g(x,y)$ the least possible value of the $f((x-m),(y-n))$ for all the integers $m,n$. The statement a) was equal to the fact $g(x,y) \le 1/2$. Prove that in fact, $$g(x,y) \le 1/3$$ Find all the points $(x,y)$, where $g(x,y)=1/3$. c) Consider function $$f_a(x,y) = x^2 + axy + y^2 \,\,\, (0 \le a \le 2)$$ Find any $c$ such that $g_a(x,y) \le c$. Try to obtain the closest estimation.

Which of the following series are convergent? $\textbf{(A)}~\sum_{n=1}^\infty\sqrt{\frac{2n^2+3}{5n^3+1}}$ $\textbf{(B)}~\sum_{n=1}^\infty\frac{(n+1)^n}{n^{n+3/2}}$ $\textbf{(C)}~\sum_{n=1}^\infty n^2x\left(1-x^2\right)^n$ $\textbf{(D)}~\text{None of the above}$

$22$ mathematicians are meeting together. Each mathematician has at least $3$ friends (friends are mutual). And each mathematician can pass his or her information to any mathematician through the transfer between friends. Is it possible to divide these $22$ mathematicians into $2$-person groups (that is, two people in each group, a total of $11$ groups), so that the mathematicians in each group are friends? [hide=original wording in Chinese]仃22位数学家一起开会.每位数学家都至少有3个朋友(朋友是相互的).而且每 位数学家都可以通过朋友之间的传递.将门已的资料传给任意一位数学家.问：是否一定可 以将这22位数学家两两分组(即每组两人,共11组),使得每组的数学家都是朋友？[/hide]

Find the number of subsets $ S$ of $ \{1,2, \dots 63\}$ the sum of whose elements is $ 2008$.

Consider an infinite sequence of positive integers $a_1, a_2, a_3, \dots$ such that $a_1 > 1$ and $(2^{a_n} - 1)a_{n+1}$ is a square for all positive integers $n$. Is it possible for two terms of such a sequence to be equal? [i]Proposed by Pavel Kozlov, Russia[/i]

Let $F$ be the set of all $n-tuples$ $(A_1,A_2,…,A_n)$ such that each $A_i$ is a subset of ${1,2,…,2019}$. Let $\mid{A}\mid$ denote the number of elements o the set $A$ . Find $\sum_{(A_1,…,A_n)\in{F}}^{}\mid{A_1\cup{A_2}\cup...\cup{A_n}}\mid$

Let $n$ be a positive integer. A mouse sits at each corner point of an $n\times n$ board, which is divided into unit squares as shown below for the example $n=5$. [asy] unitsize(5mm); defaultpen(linewidth(.5pt)); fontsize(25pt); for(int i=0; i<=5; ++i) { for(int j=0; j<=5; ++j) { draw((0,i)--(5,i)); draw((j,0)--(j,5)); }} dot((0,0)); dot((5,0)); dot((0,5)); dot((5,5)); [/asy] The mice then move according to a sequence of [i]steps[/i], in the following manner: (a) In each step, each of the four mice travels a distance of one unit in a horizontal or vertical direction. Each unit distance is called an [i]edge[/i] of the board, and we say that each mouse [i]uses[/i] an edge of the board. (b) An edge of the board may not be used twice in the same direction. (c) At most two mice may occupy the same point on the board at any time. The mice wish to collectively organize their movements so that each edge of the board will be used twice (not necessarily be the same mouse), and each mouse will finish up at its starting point. Determine, with proof, the values of $n$ for which the mice may achieve this goal.

Compute the sum of all the roots of $ (2x \plus{} 3)(x \minus{} 4) \plus{} (2x \plus{} 3)(x \minus{} 6) \equal{} 0$. $ \textbf{(A)}\ 7/2 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 7 \qquad \textbf{(E)}\ 13$

A function $f$ satisfies the equation \[f\left(x\right)+f\left(1-\frac{1}{x}\right)=1+x\] for every real number $x$ except for $x = 0$ and $x = 1$. Find a closed formula for $f$.

Calculate $\displaystyle{\sum_{n=1}^\infty\left(\lfloor\sqrt[n]{2010}\rfloor-1\right)}$ where $\lfloor x\rfloor$ is the largest integer less than or equal to $x$.

A triangle $ABC$ has acute angles at $A$ and $B$. Isosceles triangles $ACD$ and $BCE$ with bases $AC$ and $BC$ are constructed externally to triangle $ABC$ such that $\angle ADC = \angle ABC$ and $\angle BEC = \angle BAC$. Let $S$ be the circumcenter of $\triangle ABC$. Prove that the length of the polygonal line $DSE$ equals the perimeter of triangle $ABC$ if and only if $\angle ACB$ is right.

Show that $\vert 12^m -5^n\vert \ge 7$ for all $m, n \in \mathbb{N}$.

Let $P_1(x) = x^2 + a_1x + b_1$ and $P_2(x) = x^2 + a_2x + b_2$ be two quadratic polynomials with integer coeffcients. Suppose $a_1 \ne a_2$ and there exist integers $m \ne n$ such that $P_1(m) = P_2(n), P_2(m) = P_1(n)$. Prove that $a_1 - a_2$ is even.

Let $p(x)$ be a cubic polynomial with integer coefficients with leading coefficient $1$ and with one of its roots equal to the product of the other two. Show that $2p(-1)$ is a multiple of $p(1)+p(-1)-2(1+p(0)).$

Given a circle and $2006$ points lying on this circle. Albatross colors these $2006$ points in $17$ colors. After that, Frankinfueter joins some of the points by chords such that the endpoints of each chord have the same color and two different chords have no common points (not even a common endpoint). Hereby, Frankinfueter intends to draw as many chords as possible, while Albatross is trying to hinder him as much as he can. What is the maximal number of chords Frankinfueter will always be able to draw?

In La-La-Land there are 5784 cities. Alpaca chooses for each pair of cities to either build a road or a river between them, and additionally she places a fish in each city to defend it. Subsequently Bear chooses a city to start his trip. At first, he chooses whether to take his trip in a car or in a boat. A boat can sail through rivers but not drive on roads, and a car can drive on roads but not sail through rivers. When Bear enters a city he takes the fish defending it, and consequently the city collapses and he can't return to it again. What is the maximum number of fish Bear can guarantee himself, regardless of the construction of the paths? Remarks: Bear takes a fish also from the city he begins his trip from (and the city collapses). All roads and rivers are two-way.

[b]p1.[/b] In rectangle $ABMC$, $AB= 5$ and $BM= 8$. If point $X$ is the midpoint of side $AC$, what is the area of triangle $XCM$? [b]p2.[/b] Find the sum of all possible values of $a+b+c+d$ such that $(a, b, c, d)$ are quadruplets of (not necessarily distinct) prime numbers satisfying $a \cdot b \cdot c \cdot d = 4792$. [b]p3.[/b] How many integers from $1$ to $2022$ inclusive are divisible by $6$ or $24$, but not by both? [b]p4.[/b] Jerry begins his English homework at $07:39$ a.m. At $07:44$ a.m., he has finished $2.5\%$ of his homework. Subsequently, for every five minutes that pass, he completes three times as much homework as he did in the previous five minute interval. If Jerry finishes his homework at $AB : CD$ a.m., what is $A + B + C + D$? For example, if he finishes at $03:14$ a.m., $A + B + C + D = 0 + 3 + 1 + 4$. [b]p5.[/b] Advay the frog jumps $10$ times on Mondays, Wednesdays and Fridays. He jumps $7$ times on Tuesdays and Saturdays. He jumps $5$ times on Thursdays and Sundays. How many times in total did Advay jump in November if November $17$th falls on a Thursday? (There are $30$ days in November). [b]p6.[/b] In the following diagram, $\angle BAD\cong \angle DAC$, $\overline{CD} = 2\overline{BD}$, and $ \angle AEC$ and $\angle ACE$ are complementary. Given that $\overline{BA} = 210$ and $\overline{EC} = 525$, find $\overline{AE}$. [img]https://cdn.artofproblemsolving.com/attachments/5/3/8e11caf2d7dbb143a296573f265e696b4ab27e.png[/img] [b]p7.[/b] How many trailing zeros are there when $2021!$ is expressed in base $2021$? [b]p8.[/b] When two circular rings of diameter $12$ on the Olympic Games Logo intersect, they meet at two points, creating a $60^o$ arc on each circle. If four such intersections exist on the logo, and no region is in $3$ circles, the area of the regions of the logo that exist in exactly two circles is $a\pi - b\sqrt{c}$ where $a$, $b$, $c$ are positive integers and $\sqrt{c}$ is fully simplified find $a + b + c$. [b]p9.[/b] If $x^2 + ax - 3$ is a factor of $x^4 - x^3 + bx^2 - 5x - 3$, then what is $|a + b|$? [b]p10.[/b] Let $(x, y, z)$ be the point on the graph of $x^4 +2x^2y^2 +y^4 -2x^2 -2y^2 +z^2 +1 = 0$ such that $x+y +z$ is maximized. Find $a+b$ if $xy +xz +yz$ can be expressed as $\frac{a}{b}$ where $a$, $b$ are relatively prime positive integers. [b]p11.[/b] Andy starts driving from Pittsburgh to Columbus and back at a random time from $12$ pm to $3$ pm. Brendan starts driving from Pittsburgh to Columbus and back at a random time from $1$ pm to $4$ pm. Both Andy and Brendan take $3$ hours for the round trip, and they travel at constant speeds. The probability that they pass each other closer to Pittsburgh than Columbus is$ m/n$, for relatively prime positive integers $m$ and $n$. What is $m + n$? [b]p12.[/b] Consider trapezoid $ABCD$ with $AB$ parallel to $CD$ and $AB < CD$. Let $AD \cap BC = O$, $BO = 5$, and $BC = 11$. Drop perpendicular $AH$ and $BI$ onto $CD$. Given that $AH : AD = \frac23$ and $BI : BC = \frac56$ , calculate $a + b + c + d - e$ if $AB + CD$ can be expressed as $\frac{a\sqrt{b} + c\sqrt{d}}{e}$ where $a$, $b$, $c$, $d$, $e$ are integers with $gcd(a, c, e) = 1$ and $\sqrt{b}$, $\sqrt{d}$ are fully simplified. [b]p13.[/b] The polynomials $p(x)$ and $q(x)$ are of the same degree and have the same set of integer coefficients but the order of the coefficients is different. What is the smallest possible positive difference between $p(2021)$ and $q(2021)$? [b]p14.[/b] Let $ABCD$ be a square with side length $12$, and $P$ be a point inside $ABCD$. Let line $AP$ intersect $DC$ at $E$. Let line $DE$ intersect the circumcircle of $ADP$ at $F \ne D$. Given that line $EB$ is tangent to the circumcircle of $ABP$ at $B$, and $FD = 8$, find $m + n$ if $AP$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$, $n$. [b]p15.[/b] A three digit number $m$ is chosen such that its hundreds digit is the sum of the tens and units digits. What is the smallest positive integer $n$ such that $n$ cannot divide $m$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the number of positive integer n, which follows the following $ \bigstar $ $ n=[\frac{m^3}{2024}] $ $n$ has a positive integer $m$ that follows this equation ($ m \le 1000$)

Is it possible to cut a regular triangular prism into two equal pyramids?

Find the largest number formed by the digits 1 to 9, without repetition, that is divisible by 18.

How many sequences of integers $(a_1, ... , a_7)$ are there for which $-1 \le a_i \le 1$ for every $i$, and $$a_1a_2 + a_2a_3 + a_3a_4 + a_4a_5 + a_5a_6 + a_6a_7 = 4 ?$$

Prove that the equation $7^x=1+y^2+z^2$ has no solutions over positive integers.

A number of three digits is said to be [i]firm [/i]when it is equal to the product of its unit digit by a number formed by the remaining digits. For example, $153$ is firm because $153 = 3 \times 51$. How many [i]firm [/i] numbers are there?

The line $x-2y-1=0$ insects the parabola $y^2=4x$ at two different points $A, B$. Let $C$ be a point on the parabola such that $\angle ACB=\frac{\pi}{2}$. Find the coordinate of point $C$.

A circle is divided by $2N$ points into $2N$ arcs of length $1$. These points are joined in pairs to form $N$ chords. Each chord divides the circle into two arcs, the length of each being an even integer. Prove that $N$ is even.