Let $ABC$ be a right triangle with hypotenuse $AC$. Let $G$ be the centroid of this triangle and suppose that we have $AG^2 + BG^2 + CG^2 = 156$. Find $AC^2$.

Find all pairs of integers $(x,y)$ that satisfy the equation $3^4 2^3(x^2+y^2)=x^3y^3$

Let $ABC$ is a triangle with $\angle BAC=\frac{\pi}{6}$ and the circumradius equal to 1. If $X$ is a point inside or in its boundary let $m(X)=\min(AX,BX,CX).$ Find all the angles of this triangle if $\max(m(X))=\frac{\sqrt{3}}{3}.$

For a given integer $k \geq 1$, find all $k$-tuples of positive integers $(n_1,n_2,...,n_k)$ with $\text{GCD}(n_1,n_2,...,n_k) = 1$ and $n_2|(n_1+1)^{n_1}-1$, $n_3|(n_2+1)^{n_2}-1$, ... , $n_1|(n_k+1)^{n_k}-1$. [i]Authored by Pavel Dimovski[/i]

Given a sequence $(a_n)$ of non-negative real numbers such that $a_{n+m}\leq a_{n} a_{m} $ for all pairs of positive integers $m$ and $n,$ prove that the sequence $(\sqrt[n]{a_n })$ converges.

Suppose that $m$ and $k$ are positive integers. Determine the number of sequences $x_1, x_2, x_3, \dots , x_{m-1}, x_m$ with [list] [*]$x_i$ an integer for $i = 1, 2, 3, \dots , m$, [*]$1\le x_i \le k$ for $i = 1, 2, 3, \dots , m$, [*]$x_1\neq x_m$, and [*]no two consecutive terms equal.[/list]

Find the smallest positive integer $x$ such that $x^2$ ends with the four digits $9009$.

Evaluate $ \int_0^{\ln 2} (x\minus{}\ln 2)e^{\minus{}2\ln (1\plus{}e^x)\plus{}x\plus{}\ln 2}dx$.

Let $ABC$ be an acute triangle with $AB>AC$. Prove that there exists a point $D$ with the following property: whenever two distinct points $X$ and $Y$ lie in the interior of $ABC$ such that the points $B$, $C$, $X$, and $Y$ lie on a circle and $$\angle AXB-\angle ACB=\angle CYA-\angle CBA$$ holds, the line $XY$ passes through $D$.

Determine, with proof, all possible values of $\gcd(a^2+b^2+c^2,abc)$ across all triples of positive integers $(a,b,c).$

Prove the identity \[ 1 \plus{} \frac{1}{2} \minus{} \frac{2}{3} \plus{} \frac{1}{4} \plus{} \frac{1}{5} \minus{} \frac{2}{6} \plus{} \ldots \plus{} \frac{1}{478} \plus{} \frac{1}{479} \minus{} \frac{2}{480} \equal{} 2 \cdot \sum^{159}_{k\equal{}0} \frac{641}{(161\plus{}k) \cdot (480\minus{}k)}.\]

A number is called a palindromic number if its decimal representation read from the left to the right is the same as read from the right to the left. Let $(x_n)$ be the increasing sequence of all palindromic numbers. Determine all primes, which are divisors of at least one of the differences $x_{n+1} - x_n$.

There are $2$ ways to write $2020$ as a sum of $2$ squares: $2020 = a^2 + b^2$ and $2020 = c^2 + d^2$, where $a$, $b$, $c$, and $d$ are distinct positive integers with $a < b$ and $c < d$. Compute $a+b+c+d$.

As shown in the figure, chess pieces are placed at the intersection points of the $64$ grid lines of the $7\times 7$ grid table. At most $1$ piece is placed at each point, and a total of $k$ left chess pieces are placed. No matter how they are placed, there will always be $4$ chess pieces, and the grid in which they are located the points form the four vertices of a rectangle (the sides of the rectangle are parallel to the grid lines). Try to find the minimum value of $k$. [img]https://cdn.artofproblemsolving.com/attachments/5/b/23a79f43d3f4c9aade1ba9eaa7a282c3b3b86f.png[/img]

$ABC$ is a non-isosceles triangle. $O, I, H$ are respectively the center of its circumscribed circle, the inscribed circle and its orthocenter. prove that $\widehat{OIH}$ is obtuse.

Prove the identity: a) $(ax + by + cz)^2 + (bx + cy + az)^2 + (cx + ay + bz)^2 =(cx + by + az)^2 + (bx + ay + cz)^2 + (ax + cy + bz)^2$ b) $(ax + by + cz + du)^2+(bx + cy + dz + au)^2 +(cx + dy + az + bu)^2 + (dx + ay + bz + cu)^2 =$ $(dx + cy + bz + au)^2+(cx + by + az + du)^2 +(bx + ay + dz + cu)^2 + (ax + dy + cz + bu)^2$.

Let $S$ be a nonempty closed set in the euclidean plane for which there is a closed disk $D$ containing $S$ such that $D$ is a subset of every closed disk that contains $S$. Prove that every point inside $D$ is the midpoint of a segment joining two points of $S.$

Starting with any $n$-tuple $R_0$, $n\ge 1$, of symbols from $A,B,C$, we define a sequence $R_0, R_1, R_2,\ldots,$ according to the following rule: If $R_j= (x_1,x_2,\ldots,x_n)$, then $R_{j+1}= (y_1,y_2,\ldots,y_n)$, where $y_i=x_i$ if $x_i=x_{i+1}$ (taking $x_{n+1}=x_1$) and $y_i$ is the symbol other than $x_i, x_{i+1}$ if $x_i\neq x_{i+1}$. Find all positive integers $n>1$ for which there exists some integer $m>0$ such that $R_m=R_0$.

A rectangle can be divided into $n$ equal squares. The same rectangle can also be divided into $n+76$ equal squares. Find $n$.

How many ordered pairs $(p,n)$ are there such that $(1+p)^n = 1+pn + n^p$ where $p$ is a prime and $n$ is a positive integer? $ \textbf{(A)}\ 5 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 1 \qquad\textbf{(D)}\ 0 \qquad\textbf{(E)}\ \text{None of the preceding} $

Two farmers agree that pigs are worth $ \$300$ and that goats are worth $ \$210$. When one farmer owes the other money, he pays the debt in pigs or goats, with ``change'' received in the form of goats or pigs as necessary. (For example, a $ \$390$ debt could be paid with two pigs, with one goat received in change.) What is the amount of the smallest positive debt that can be resolved in this way? $ \textbf{(A) } \$5\qquad \textbf{(B) } \$10\qquad \textbf{(C) } \$30\qquad \textbf{(D) } \$90\qquad \textbf{(E) } \$210$

A two-digit positive integer is said to be [i]cuddly[/i] if it is equal to the sum of its nonzero tens digit and the square of its units digit. How many two-digit positive integers are cuddly? $\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad\textbf{(E) }4$

Suppose $a$, $b$, and $c$ are nonzero real numbers such that \[bc+\frac1a = ca+\frac2b = ab+\frac7c = \frac1{a+b+c}.\] Find $a+b+c$.

[b]p1.[/b] Consider this statement: An equilateral polygon circumscribed about a circle is also equiangular. Decide whether this statement is a true or false proposition in euclidean geometry. If it is true, prove it; if false, produce a counterexample. [b]p2.[/b] Show that the fraction $\frac{x^2-3x+1}{x-3}$ has no value between $1$ and $5$, for any real value of $x$. [b]p3.[/b] A man walked a total of $5$ hours, first along a level road and then up a hill, after which he turned around and walked back to his starting point along the same route. He walks $4$ miles per hour on the level, three miles per hour uphill, and $r$ miles per hour downhill. For what values of $r$ will this information uniquely determine his total walking distance? [b]p4.[/b] A point $P$ is so located in the interior of a rectangle that the distance of $P$ from one comer is $5$ yards, from the opposite comer is $14$ yards, and from a third comer is $10$ yards. What is the distance from $P$ to the fourth comer? [b]p5.[/b] Each small square in the $5$ by $5$ checkerboard shown has in it an integer according to the following rules: $\begin{tabular}{|l|l|l|l|l|} \hline & & & & \\ \hline & & & & \\ \hline & & & & \\ \hline & & & & \\ \hline & & & & \\ \hline \end{tabular}$ i. Each row consists of the integers $1, 2, 3, 4, 5$ in some order. ii. Тhе order of the integers down the first column has the same as the order of the integers, from left to right, across the first row and similarly fог any other column and the corresponding row. Prove that the diagonal squares running from the upper left to the lower right contain the numbers $1, 2, 3, 4, 5$ in some order. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Each of the integers from $1$ to $n$ is written on a separate card, and then the cards are combined into a deck and shuffled. Three players, $A,B,$ and $C,$ take turns in the order $A,B,C,A,\dots$ choosing one card at random from the deck. (Each card in the deck is equally likely to be chosen.) After a card is chosen, that card and all higher-numbered cards are removed from the deck, and the remaining cards are reshuffled before the next turn. Play continues until one of the three players wins the game by drawing the card numbered $1.$ Show that for each of the three players, there are arbitrarily large values of $n$ for which that player has the highest probability among the three players of winning the game.