Suppose $a,b,c$ are positive integers such that \[\gcd(a,b)+\gcd(a,c)+\gcd(b,c)=b+c+2023\] Prove that $\gcd(b,c)=2023$. [i]Remark.[/i] For positive integers $x$ and $y$, $\gcd(x,y)$ denotes their greatest common divisor. [i]Ivan Novak[/i]

Let $ABC$ be an acute triangle with $AB>AC$. The internal angle bisector of $\angle BAC$ meets $BC$ at $D$. Let $O$ be the circumcenter of $ABC$ and let $AO$ meet $BC$ at $E$. Let $J$ be the incenter of triangle $AED$. Show that if $\angle ADO=45^{\circ}$, then $OJ=JD$.

Let $ \, a_{0}, a_{1}, a_{2},\ldots\,$ be a sequence of positive real numbers satisfying $ \, a_{i\minus{}1}a_{i\plus{}1}\leq a_{i}^{2}\,$ for $ i \equal{} 1,2,3,\ldots\; .$ (Such a sequence is said to be [i]log concave[/i].) Show that for each $ \, n > 1,$ \[ \frac{a_{0}\plus{}\cdots\plus{}a_{n}}{n\plus{}1}\cdot\frac{a_{1}\plus{}\cdots\plus{}a_{n\minus{}1}}{n\minus{}1}\geq\frac{a_{0}\plus{}\cdots\plus{}a_{n\minus{}1}}{n}\cdot\frac{a_{1}\plus{}\cdots\plus{}a_{n}}{n}.\]

A positive integer $n$ is called $nice$, if the sum of the squares of all its positive divisors is equal to $(n+3)^2$. Prove that if $n=pq$ is nice, where $p, q$ are not necessarily distinct primes, then $n+2$ and $2(n+1)$ are simultaneously perfect squares.

Assume $ABC$ is an isosceles triangle that $AB=AC$ Suppose $P$ is a point on extension of side $BC$. $X$ and $Y$ are points on $AB$ and $AC$ that: \[PX || AC \ , \ PY ||AB \] Also $T$ is midpoint of arc $BC$. Prove that $PT \perp XY$

Each point of the plane is colored by one of the two colors. Show that there exists an equilateral triangle with monochromatic vertices.

Let $n$ be a fixed positive integer. - Show that there exist real polynomials $p_1, p_2, p_3, \cdots, p_k \in \mathbb{R}[x_1, \cdots, x_n]$ such that \[(x_1 + x_2 + \cdots + x_n)^2 + p_1(x_1, \cdots, x_n)^2 + p_2(x_1, \cdots, x_n)^2 + \cdots + p_k(x_1, \cdots, x_n)^2 = n(x_1^2 + x_2^2 + \cdots + x_n^2)\] - Find the least natural number $k$, depending on $n$, such that the above polynomials $p_1, p_2, \cdots, p_k$ exist.

Sristan Thin is walking around the Cartesian plane. From any point $\left(x,y\right)$, Sristan can move to $\left(x+1,y\right)$ or $\left(x+1,y+3\right)$. How many paths can Sristan take from $\left(0,0\right)$ to $\left(9,9\right)$? [i]2019 CCA Math Bonanza Individual Round #3[/i]

Let $S$ be the set of lattice points $(a,b)$ in the coordinate plane such that $1\le a\le 30$ and $1\le b\le 30$. What is the maximum number of lattice points in $S$ such that no four points form a square of side length 2? [i]Proposed by Harry Kim[/i]

Let $n \geqslant 2$ be an integer. We consider a square grid of size $2n \times 2n$ divided into $4n^2$ unit squares. The grid is called [i]balanced[/i] if: [list] [*]Each cell contains a number equal to $-1$, $0$ or $1$. [*]The absolute value of the sum of the numbers in the grid does not exceed $4n$. [/list] Determine, as a function of $n$, the smallest integer $k \geqslant 1$ such that any balanced grid always contains an $n \times n$ square whose absolute sum of the $n^2$ cells is less than or equal to $k$.

Let $MN$ be a chord of the circle $\Gamma$ and let $S$ be the midpoint of $MN$. Let $A, B, C, D$ be points on $\Gamma$ such that $AC$ and $BD$ intersect at $S$ and $A$ and $B$ are on the same side of $MN$. Let $d_A, d_B, d_C , d_D$ be the distances from $MN$ to $A, B, C,$ and $D,$ respectively. Prove that $\frac{1}{d_A}+\frac{1}{d_D}=\frac{1}{d_B}+\frac{1}{d_C}$.

Show that $(x + y + z) \big(\frac{1}{x}+\frac{1}{y}+\frac{1}{z}\big) \ge 4 \big(\frac{x}{xy+1}+\frac{y}{yz+1}+\frac{z}{zx+1}\big)^2$ , for all real positive numbers $x, y $ and $z$.

What is the ones digit of \[222{,}222-22{,}222-2{,}222-222-22-2?\] $\textbf{(A) }0\qquad\textbf{(B) }2\qquad\textbf{(C) }4\qquad\textbf{(D) }6\qquad\textbf{(E) }8$

In an island there are $n$ castles, and each castle is in country $A$ or $B$. There is one commander per castle, and each commander belongs to the same country as the castle he's initially in. There are some (two-way) roads between castles (there may be roads between castles of different countries), and call two castles adjacent if there is a road between them. Prove that the following two statements are equivalent: (1) If some commanders from country $B$ move to attack an adjacent castle in country $A$, some commanders from country $A$ could appropriately move in defense to adjacent castles in country $A$ so that in every castle of country $A$, the number of country $A$'s commanders defending that castle is not less than the number of country $B$'s commanders attacking that castle. (Each commander can defend or attack only one castle at a time.) (2) For any arbitrary set $X$ of castles in country $A$, the number of country $A$'s castles that are in $X$ or adjacent to at least one of the castle in $X$ is not less than the number of country $B$'s castles that are adjacent to at least one of the castles in $X$.

In convex quadrilateral $ ABCD$, $ AB\equal{}a$, $ BC\equal{}b$, $ CD\equal{}c$, $ DA\equal{}d$, $ AC\equal{}e$, $ BD\equal{}f$. If $ \max \{a,b,c,d,e,f \}\equal{}1$, then find the maximum value of $ abcd$.

Let $f(x)=|x-2|+|x-4|-|2x-6|$ for $2 \leq x\leq 8$. The sum of the largest and smallest values of $f(x)$ is $\textbf {(A) } 1 \qquad \textbf {(B) } 2 \qquad \textbf {(C) } 4 \qquad \textbf {(D) } 6 \qquad \textbf {(E) }\text{none of these}$

A circle passes through the points $A,C$ of triangle $ABC$ intersects with the sides $AB,BC$ at points $D,E$ respectively. Let $ \frac{BD}{CE}=\frac{3}{2}$, $BE=4$, $AD=5$ and $AC=2\sqrt{7} $. Find the angle $ \angle BDC$.

[u]Round 1[/u] [b]p1.[/b] Alex is writing a sequence of $A$’s and $B$’s on a chalkboard. Any $20$ consecutive letters must have an equal number of $A$’s and $B$’s, but any 22 consecutive letters must have a different number of $A$’s and $B$’s. What is the length of the longest sequence Alex can write?. [b]p2.[/b] A positive number is placed on each of the $10$ circles in this picture. It turns out that for each of the nine little equilateral triangles, the number on one of its corners is the sum of the numbers on the other two corners. Is it possible that all $10$ numbers are different? [img]https://cdn.artofproblemsolving.com/attachments/b/f/c501362211d1c2a577e718d2b1ed1f1eb77af1.png[/img] [b]p3.[/b] Pablo and Nina take turns entering integers into the cells of a $3 \times 3$ table. Pablo goes first. The person who fills the last empty cell in a row must make the numbers in that row add to $0$. Can Nina ensure at least two of the columns have a negative sum, no matter what Pablo does? [b]p4. [/b]All possible simplified fractions greater than $0$ and less than $1$ with denominators less than or equal to $100$ are written in a row with a space before each number (including the first). Zeke and Qing play a game, taking turns choosing a blank space and writing a “$+$” or “$-$” sign in it. Zeke goes first. After all the spaces have been filled, Zeke wins if the value of the resulting expression is an integer. Can Zeke win no matter what Qing does? [img]https://cdn.artofproblemsolving.com/attachments/3/6/15484835686fbc2aa092e8afc6f11cd1d1fb88.png[/img] [b]p5.[/b] A police officer patrols a town whose map is shown. The officer must walk down every street segment at least once and return to the starting point, only changing direction at intersections and corners. It takes the officer one minute to walk each segment. What is the fastest the officer can complete a patrol? [img]https://cdn.artofproblemsolving.com/attachments/0/c/d827cf26c8eaabfd5b0deb92612a6e6ebffb47.png[/img] [u]Round 2[/u] [b]p6.[/b] Prove that among any $3^{2022}$ integers, it is possible to find exactly $3^{2021}$ of them whose sum is divisible by $3^{2021}$. [b]p7.[/b] Given a list of three numbers, a zap consists of picking two of the numbers and decreasing each of them by their average. For example, if the list is $(5, 7, 10)$ and you zap $5$ and $10$, whose average is $7.5$, the new list is $(-2.5, 7, 2.5)$. Is it possible to start with the list $(3, 1, 4)$ and, through some sequence of zaps, end with a list in which the sum of the three numbers is $0$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a real number $\lambda > 1$, let $P$ be a point on the arc $BAC$ of the circumcircle of $\bigtriangleup ABC$. Extend $BP$ and $CP$ to $U$ and $V$ respectively such that $BU = \lambda BA$, $CV = \lambda CA$. Then extend $UV$ to $Q$ such that $UQ = \lambda UV$. Find the locus of point $Q$.

Given are two positive integers $k$ and $n$ with $k \le n \le 2k - 1$. Julian has a large stack of rectangular $k \times 1$ tiles. Merlin calls a positive integer $m$ and receives $m$ tiles from Julian to place on an $n \times n$ board. Julian first writes on every tile whether it should be a horizontal or a vertical tile. Tiles may be used the board should not overlap or protrude. What is the largest number $m$ that Merlin can call if he wants to make sure that he has all tiles according to the rule of Julian can put on the plate?

It is given polynomial $$P(x)=x^4+3x^3+3x+p, (p \in \mathbb{R})$$ $a)$ Find $p$ such that there exists polynomial with imaginary root $x_1$ such that $\mid x_1 \mid =1$ and $2Re(x_1)=\frac{1}{2}\left(\sqrt{17}-3\right)$ $b)$ Find all other roots of polynomial $P$ $c)$ Prove that does not exist positive integer $n$ such that $x_1^n=1$

For every positive integer $ n$, let $ \phi(n)$ denotes the number of positive integers less than $ n$ that is relatively prime to $ n$ and $ \tau(n)$ denote the sum of all positive divisors of $ n$. Let $ n$ be a positive integer such that $ \phi(n)|n\minus{}1$ and that $ n$ is not a prime number. Prove that $ \tau(n)>2009$.

If the polynomials $f(x)$ and $g(x)$ are written on a blackboard then we can also write down the polynomials $f(x)\pm g(x)$, $f(x)g(x)$, $f(g(x))$ and $cf(x)$, where $c$ is an arbitrary real constant. The polynomials $x^3-3x^2+5$ and $x^2-4x$ are written on the blackboard. Can we write a nonzero polynomial of form $x^n-1$ after a finite number of steps?

A spaceman of mass $\text{80 kg}$ is sitting in a spacecraft near the surface of the Earth. The spacecraft is accelerating upward at five times the acceleration due to gravity. What is the force of the spaceman on the spacecraft? (A) $\text{4800 N}$ (B) $\text{4000 N}$ (C) $\text{3200 N}$ (D) $\text{800 N}$ (E) $\text{400 N}$

The lengths of the two legs of a right triangle are the two distinct roots of the quadratic $x^2 - 36x + 70$. What is the length of the triangle’s hypotenuse?