Prove that if for a real number $a $ , $a+\frac {1}{a} $is integer then $a^n+\frac {1}{a^n} $ is also integer where $n$ is positive integer.

A line segment is divided so that the lesser part is to the greater part as the greater part is to the whole. If $ R$ is the ratio of the lesser part to the greater part, then the value of \[ R^{[R^{(R^2\plus{}R^{\minus{}1})}\plus{}R^{\minus{}1}]}\plus{}R^{\minus{}1}\] is $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 2R \qquad \textbf{(C)}\ R^{\minus{}1} \qquad \textbf{(D)}\ 2\plus{}R^{\minus{}1} \qquad \textbf{(E)}\ 2\plus{}R$

The digits $1, 4, 9$ and $2$ are each used exactly once to form some $4$-digit number $N$. What is the sum of all possible values of $N$?

A [i]super-integer[/i] triangle is defined to be a triangle whose lengths of all sides and at least one height are positive integers. We will deem certain positive integer numbers to be [i]good[/i] with the condition that if the lengths of two sides of a super-integer triangle are two (not necessarily different) good numbers, then the length of the remaining side is also a good number. Let $5$ be a good number. Prove that all integers larger than $2$ are good numbers.

Given that the expected amount of $1$s in a randomly selected $2021$-digit number is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, find $m+n$. [i]Proposed by Hannah Shen[/i]

A frog begins at $P_0 = (0,0)$ and makes a sequence of jumps according to the following rule: from $P_n=(x_n,y_n)$, the frog jumps to $P_{n+1}$, which may be any of the points $(x_n+7, y_n+2)$, $(x_n+2,y_n+7)$, $(x_n-5, y_n-10)$, or $(x_n-10,y_n-5)$. There are $M$ points $(x,y)$ with $|x|+|y| \le 100$ that can be reached by a sequence of such jumps. Find the remainder when $M$ is divided by $1000$.

In how many ways can the integers from $1$ to $2006$ be divided into three non-empty disjoint sets so that none of these sets contains a pair of consecutive integers?

Let $ X$ the set of all sequences $ \{a_1, a_2,\ldots , a_{2000}\}$, such that each of the first 1000 terms is 0, 1 or 2, and each of the remaining terms is 0 or 1. The [i]distance[/i] between two members $ a$ and $ b$ of $ X$ is defined as the number of $ i$ for which $ a_i$ and $ b_i$ are different. Find the number of functions $ f : X \to X$ which preserve the distance.

All numbers from $1$ to $32$ a written on the stars from the picture below, such that each number is written once. Can all sums of the numbers written in each square that is not divided in smaller squares be equal?

Given integer $n \geq 3$. $1, 2, \ldots, n$ were written on the blackboard. In each move, one could choose two numbers $x, y$, erase them, and write down $x + y, |x-y|$ in the place of $x, y$. Find all integers $X$ such that one could turn all numbers into $X$ within a finite number of moves.

Let $A_1A_2\ldots A_n$ be a regular hexagon and $M$ be a point on the shorter arc $A_1A_n$ of its circumcircle. Prove that the value of $$\frac{A_2M+A_3M+\ldots+A_{n-1}M}{A_1M+A_nM}$$is constant and find this value.

[u]Round 5[/u] [b]5.1[/b] A circle with a radius of $1$ is inscribed in a regular hexagon. This hexagon is inscribed in a larger circle. If the area that is outside the hexagon but inside the larger circle can be expressed as $\frac{a\pi}{b} - c\sqrt{d}$, where $a, b, c, d$ are positive integers, $a, b$ are relatively prime, and no prime perfect square divides into $d$. find the value of $a + b + c + d$. [b]5.2[/b] At a dinner party, $10$ people are to be seated at a round table. If person A cannot be seated next to person $B$ and person $C$ must be next to person $D$, how many ways can the 10 people be seated? Consider rotations of a configuration identical. [b]5.3[/b] Let $N$ be the sum of all the positive integers that are less than $2022$ and relatively prime to $1011$. Find $\frac{N}{2022}$. [u]Round 6[/u] [b]6.1[/b] The line $y = m(x - 6)$ passes through the point $ A$ $(6, 0)$, and the line $y = 8 -\frac{x}{m}$ pass through point $B$ $(0,8)$. The two lines intersect at point $C$. What is the largest possible area of triangle $ABC$? [b]6.2[/b] Let $N$ be the number of ways there are to arrange the letters of the word MATHEMATICAL such that no two As can be adjacent. Find the last $3$ digits of $\frac{N}{100}$. [b]6.3[/b] Find the number of ordered triples of integers $(a, b, c)$ such that $|a|, |b|, |c| \le 100$ and $3abc = a^3 + b^3 + c^3$. [u]Round 7[/u] [b]7.1[/b] In a given plane, let $A, B$ be points such that $AB = 6$. Let $S$ be the set of points such that for any point $C$ in $S$, the circumradius of $\vartriangle ABC$ is at most $6$. Find $a + b + c$ if the area of $S$ can be expressed as $a\pi + b\sqrt{c}$ where $a, b, c$ are positive integers, and $c$ is not divisible by the square of any prime. [b]7.2[/b] Compute $\sum_{1\le a<b<c\le 7} abc$. [b]7.3[/b] Three identical circles are centered at points $A, B$, and $C$ respectively and are drawn inside a unit circle. The circles are internally tangent to the unit circle and externally tangent to each other. A circle centered at point $D$ is externally tangent to circles $A, B$, and $C$. If a circle centered at point $E$ is externally tangent to circles $A, B$, and $D$, what is the radius of circle $E$? The radius of circle $E$ can be expressed as $\frac{a\sqrt{b}-c}{d}$ where $a, b, c$, and d are all positive integers, gcd(a, c, d) = 1, and b is not divisible by the square of any prime. What is the sum of $a + b + c + d$? [u]Round 8[/u] [b]8.[/b] Let $A$ be the number of unused Algebra problems in our problem bank. Let $B$ be the number of times the letter ’b’ appears in our problem bank. Let M be the median speed round score. Finally, let $C$ be the number of correct answers to Speed Round $1$. Estimate $$A \cdot B + M \cdot C.$$ Your answer will be scored according to the following formula, where $X$ is the correct answer and $I$ is your input. $$max \left\{ 0, \left\lceil min \left\{13 - \frac{|I-X|}{0.05 |I|}, 13 - \frac{|I-X|}{0.05 |I-2X|} \right\} \right\rceil \right\}$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2826128p24988676]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In a triangle $ABC$ assume $AB = AC$, and let $D$ and $E$ be points on the extension of segment $BA$ beyond $A$ and on the segment $BC$, respectively, such that the lines $CD$ and $AE$ are parallel. Prove $CD \ge \frac{4h}{BC}CE$, where $h$ is the height from $A$ in triangle $ABC$. When does equality hold?

Given trapezoid $ ABCD$ with parallel sides $ AB$ and $ CD$, assume that there exist points $ E$ on line $ BC$ outside segment $ BC$, and $ F$ inside segment $ AD$ such that $ \angle DAE \equal{} \angle CBF$. Denote by $ I$ the point of intersection of $ CD$ and $ EF$, and by $ J$ the point of intersection of $ AB$ and $ EF$. Let $ K$ be the midpoint of segment $ EF$, assume it does not lie on line $ AB$. Prove that $ I$ belongs to the circumcircle of $ ABK$ if and only if $ K$ belongs to the circumcircle of $ CDJ$. [i]Proposed by Charles Leytem, Luxembourg[/i]

$ \triangle ABC$ is a right isosceles triangle. Choose points $ K$ and $ M$ from the hypotenuse $ AB$, such that $ K \in AM$ and $ \angle KCM \equal{} 45$º. Prove that $ (AK)^2 \plus{} (MB)^2 \equal{} (KM)^2$ Thanks for any help.

The product $$\frac12 \cdot \frac24 \cdot \frac38 \cdot \frac{4}{16} \cdot ... \cdot \frac{99}{2^{99}} \cdot \frac{100}{2^{100}}$$ is written in its most simplified form. What is the last digit of the denominator?

$n$ teams take part in a tournament, in which every two teams compete exactly once, and that no draws are possible. It is known that for any two teams, there exists another team which defeated both of the two teams. Find all $n$ for which this is possible.

Let $ M$ be a point on $ BC$ and $ N$ be a point on $ AB$ such that $ AM$ and $ CN$ are angle bisectors of the triangle $ ABC$. Given that $ \frac {\angle BNM}{\angle MNC} \equal{} \frac {\angle BMN}{\angle NMA}$, prove that the triangle $ ABC$ is isosceles.

Let $n$ be a positive integer such that $1 \leq n \leq 1000$. Let $M_n$ be the number of integers in the set $X_n=\{\sqrt{4 n+1}, \sqrt{4 n+2}, \ldots, \sqrt{4 n+1000}\}$. Let $$ a=\max \left\{M_n: 1 \leq n \leq 1000\right\} \text {, and } b=\min \left\{M_n: 1 \leq n \leq 1000\right\} \text {. } $$ Find $a-b$.

What is the greatest number of balls of radius $1/2$ that can be placed within a rectangular box of size $10 \times 10 \times 1 \ ?$

In each cell of a square table of size $n \times n$ cells ($n \ge 3$) the number $1$ or $-1$ is written. If you take any two lines, multiply numbers standing above each other in them and add the n resulting products, then the sum will be equal to $0$. Prove that the number $n$ is divisible by $4$.

There are two triangles $ABC$ and $BKL$ on the plane so that the segment $AK$ is divided into three equal parts by the point of intersection of the medians $\vartriangle ABC$ and the point of intersection of the bisectors $ \vartriangle BKL $ ($AK $ - median $ \vartriangle ABC$, $KA$ - bisector $\vartriangle BKL $) and quadrilateral $KALC $ is trapezoid. Find the angles of the triangle $BKL$. (Bogdan Rublev)

Given a non-zero integer $y$ and a positive integer $n$. If $x_1, x_2, \ldots, x_n \in \mathbb{Z} - \{0, 1\}$ and $z \in \mathbb{Z}^+$ satisfy $(x_1x_2 \ldots x_n)^2y \le 2^{2(n+1)}$ and $x_1x_2 \ldots x_ny = z + 1$, prove that there is a prime among $x_1, x_2, \ldots, x_n, z$. [color=blue]It appears that the problem statement is incorrect; suppose $y = 5, n = 2$, then $x_1 = x_2 = -1$ and $z = 4$. They all satisfy the problem's conditions, but none of $x_1, x_2, z$ is a prime. What should the problem be, or did I misinterpret the problem badly?[/color]

If real numbers $x$, $y$, and $z$ satisfy $x^2-yz = 1$ and $y^2-xz = 4$ such that $|x+y+z|$ is minimized, then $z^2-xy$ can be expressed in the form $\sqrt{a}-b$ where $a$ and $b$ are positive integers. Find $a+b$. [i]Proposed by Andy Xu[/i]

In a Cartesian coordinate system, the circle $C_1$ has center $O_1(-2, 0)$ and radius $3$. Denote the point $(1, 0)$ by $A$ and the origin by $O$.Prove that there is a constant $c > 0$ such that for every $X$ that is exterior to $C1$, \[OX- 1 \geq c \min\{AX,AX^2\}.\] Find the largest possible $c.$