Let $\frac{2}{\sqrt5+1}\leq p < 1$, and let the real sequence $\{ a_n \}$ have the following property: for every sequence $\{ e_n \}$ of $0$'s and $\pm 1$'s for which $\sum_{n=1}^\infty e_np^n=0$, we also have $\sum_{n=1}^\infty e_na_n=0$. Prove that there is a number $c$ such that $a_n=cp^n$ for all $n$. [Z. Daroczy, I. Katai]

The sequence $ (a_n)$ satisfies $ a_1 \equal{} 1$ and $ \displaystyle 5^{(a_{n\plus{}1}\minus{}a_n)} \minus{} 1 \equal{} \frac{1}{n\plus{}\frac{2}{3}}$ for $ n \geq 1$. Let $ k$ be the least integer greater than $ 1$ for which $ a_k$ is an integer. Find $ k$.

An integer $N \ge 2$ is given. A collection of $N(N + 1)$ soccer players, no two of whom are of the same height, stand in a row. Sir Alex wants to remove $N(N - 1)$ players from this row leaving a new row of $2N$ players in which the following $N$ conditions hold: ($1$) no one stands between the two tallest players, ($2$) no one stands between the third and fourth tallest players, $\;\;\vdots$ ($N$) no one stands between the two shortest players. Show that this is always possible. [i]Proposed by Grigory Chelnokov, Russia[/i]

Point $M$ on side $AB$ of quadrilateral $ABCD$ is such that quadrilaterals $AMCD$ and $BMDC$ are circumscribed around circles centered at $O_1$ and $O_2$ respectively. Line $O_1O_2$ cuts an isosceles triangle with vertex M from angle $CMD$. Prove that $ABCD$ is a cyclic quadrilateral. (M. Kungozhin)

Given three numbers $x, y, z$, and set $x_1 = |x - y|, y_1 = | y -z|, z_1 = |z- x|$. From $x_1, y_1, z_1$, form in the same fashion the numbers $x_2, y_2, z_2$, and so on. It is known that $x_n = x, y_n = y, z_n = z$ for some $n$. Find all possible values of $(x, y, z)$.

Greta is completing an art project. She has twelve sheets of paper: four red, four white, and four blue. She also has twelve paper stars: four red, four white, and four blue. She randomly places one star on each sheet of paper. The probability that no star will be placed on a sheet of paper that is the same color as the star is $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $n - 100m.$

Jordan is in the center of a circle whose radius is $100$ meters and can move one meter at a time, however, there is a giant who at every step can force you to move in the opposite direction to the one he chose (it does not mean returning to the place of departure, but advance but in the opposite direction to the chosen one). Determine the minimum number of steps that Jordan must give to get out of the circle.

Let $a_1, . . . , a_{2020}$ be a sequence of real numbers such that $a_1 = 2^{-2019}$, and $a^2_{n-1}a_n = a_n-a_{n-1}$. Prove that $a_{2020} <\frac{1}{2^{2019} -1}$

How many positive integer solutions does the following system of equations have? $$\begin{cases}\sqrt{2020}(\sqrt{a}+\sqrt{b})=\sqrt{(c+2020)(d+2020)}\\\sqrt{2020}(\sqrt{b}+\sqrt{c})=\sqrt{(d+2020)(a+2020)}\\\sqrt{2020}(\sqrt{c}+\sqrt{d})=\sqrt{(a+2020)(b+2020)}\\\sqrt{2020}(\sqrt{d}+\sqrt{a})=\sqrt{(b+2020)(c+2020)}\\ \end{cases}$$

In the diagram below, how many distinct paths are there from January 1 to December 31, moving from one adjacent dot to the next either to the right, down, or diagonally down to the right? [asy] size(340); int i, j; for(i = 0; i<10; i = i+1) { for(j = 0; j<5; j = j+1) { if(10*j + i == 11 || 10*j + i == 12 || 10*j + i == 14 || 10*j + i == 15 || 10*j + i == 18 || 10*j + i == 32 || 10*j + i == 35 || 10*j + i == 38 ) { } else{ label("$*$", (i,j));} }} label("$\leftarrow$"+"Dec. 31", (10.3,0)); label("Jan. 1"+"$\rightarrow$", (-1.3,4));[/asy]

A line that passes through the origin intersects both the line $x=1$ and the line $y=1+\frac{\sqrt{3}}{3}x$. The three lines create an equilateral triangle. What is the perimeter of the triangle? $ \textbf{(A) }2\sqrt{6}\qquad\textbf{(B) }2+2\sqrt{3}\qquad\textbf{(C) }6\qquad\textbf{(D) }3+2\sqrt{3}\qquad\textbf{(E) }6+\frac{\sqrt{3}}{3} $

Given triangle $ABC$, squares $ABEF, BCGH, CAIJ$ are constructed externally on side $AB, BC, CA$, respectively. Let $AH \cap BJ = P_1$, $BJ \cap CF = Q_1$, $CF \cap AH = R_1$, $AG \cap CE = P_2$, $BI \cap AG = Q_2$, $CE \cap BI = R_2$. Prove that triangle $P_1 Q_1 R_1$ is congruent to triangle $P_2 Q_2 R_2$.

Solve in non-negative integers the equation $125.2^n-3^m=271$

[b]a)[/b] Let be a continuous function $ f:\mathbb{R}_{\ge 0}\longrightarrow\mathbb{R}_{>0} . $ Show that there exists a natural number $ n_0 $ and a sequence of positive real numbers $ \left( x_n \right)_{n>n_0} $ that satisfy the following relation. $$ n\int_0^{x_n} f(t)dt=1,\quad n_0<\forall n\in\mathbb{N} $$ [b]b)[/b] Prove that the sequence $ \left( nx_n \right)_{n> n_0} $ is convergent and find its limit.

Layna wants to paint a rectangular wall green, but she only has blue and yellow paint. She finds that a $2:1$ mix of blue paint to yellow paint produces the color green she wants, and she knows that one gallon of paint will cover $80$ square feet of wall. If the wall is $8$ feet tall and $21$ feet long, how many gallons of blue paint does Layna need? Express your answer as a fraction in simplest form.

Let $ABC$ be a triangle with symmedian point $K$, and let $\theta = \angle AKB-90^{\circ}$. Suppose that $\theta$ is both positive and less than $\angle C$. Consider a point $K'$ inside $\triangle ABC$ such that $A,K',K,$ and $B$ are concyclic and $\angle K'CB=\theta$. Consider another point $P$ inside $\triangle ABC$ such that $K'P\perp BC$ and $\angle PCA=\theta$. If $\sin \angle APB = \sin^2 (C-\theta)$ and the product of the lengths of the $A$- and $B$-medians of $\triangle ABC$ is $\sqrt{\sqrt{5}+1}$, then the maximum possible value of $5AB^2-CA^2-CB^2$ can be expressed in the form $m\sqrt{n}$ for positive integers $m,n$ with $n$ squarefree. Compute $100m+n$. [i]Proposed by Vincent Huang[/i]

Let $M$ be the midpoint of $AB$ in a right angled triangle $ABC$ with $\angle C = 90^\circ$. A circle passing through $C$ and $M$ meets segments $BC, AC$ at $P, Q$ respectively. Let $c_1, c_2$ be the circles with centers $P, Q$ and radii $BP, AQ$ respectively. Prove that $c_1, c_2$ and the circumcircle of $ABC$ are concurrent.

Find all positive real numbers $c$ such that there are infinitely many pairs of positive integers $(n,m)$ satisfying the following conditions: $n \ge m+c\sqrt{m - 1}+1$ and among numbers $n. n+1,.... 2n-m$ there is no square of an integer. (Slovakia)

Let $ABCD$ be a parallelogram of center $O$. Points $M$ and $N$ are the midpoints of $BO$ and $CD$, respectively. Prove that if the triangles $ABC$ and $AMN$ are similar, then $ABCD$ is a square.

Let $x, y, z$ be positive real numbers such that $\sqrt {x}, \sqrt {y}, \sqrt {z}$ are sides of a triangle and $\frac {x}{y}+\frac {y}{z}+\frac {z}{x}=5$. Prove that $\frac {x(y^2-2z^2)}{z}+\frac {y(z^2-2x^2)}{x}+\frac {z(x^2-2y^2)}{y}\geqslant0$

The distance light travels in one year is approximately $ 5,870,000,000,000$ miles. The distance light travels in $ 100$ years is: $ \textbf{(A)}\ 587 * 10^8 \text{ miles} \qquad\textbf{(B)}\ 587 * 10^{10} \text{ miles} \qquad\textbf{(C)}\ 587*10^{ \minus{} 10} \text{ miles}$ $ \textbf{(D)}\ 587 * 10^{12} \text{ miles} \qquad\textbf{(E)}\ 587* 10^{ \minus{} 12} \text{ miles}$

Find the greatest integer less than or equal to $\sum_{k=1}^{2^{1983}} k^{\frac{1}{1983} -1}.$

Points $A$, $B$, $C$, $D$ and $E$ are placed on the circle. In how many ways can the resulting five arcs be designated by the letters $a$, $b$, $c$, $d$ and $e$, if it is forbidden to designate an arc with the same letter as one of its ends? (For example, an arc with ends $A$ and $B$ cannot be designated by the letter $a$ or $b$.)

In a triangle $ABC$, let $D$ and $E$ be points of the sides $ BC$ and $AC$ respectively. Segments $AD$ and $BE$ intersect at $O$. Suppose that the line connecting midpoints of the triangle and parallel to $AB$, bisects the segment $DE$. Prove that the triangle $ABO$ and the quadrilateral $ODCE$ have equal areas.

Lisa and Bart are playing a game. A round table has $n$ lights evenly spaced around its circumference. Some of the lights are on and some of them off; the initial configuration is random. Lisa wins if she can get all of the lights turned on; Bart wins if he can prevent this from happening. On each turn, Lisa chooses the positions at which to flip the lights, but before the lights are flipped, Bart, knowing Lisa’s choices, can rotate the table to any position that he chooses (or he can leave the table as is). Then the lights in the positions that Lisa chose are flipped: those that are off are turned on and those that are on are turned off. Here is an example turn for $n = 5$ (a white circle indicates a light that is on, and a black circle indicates a light that is off): [asy] size(250); defaultpen(linewidth(1)); picture p = new picture; real r = 0.2; pair s1=(0,-4), s2=(0,-8); int[][] filled = {{1,2,3},{1,2,5},{2,3,4,5}}; draw(p,circle((0,0),1)); for(int i = 0; i < 5; ++i) { pair P = dir(90-72*i); filldraw(p,circle(P,r),white); label(p,string(i+1),P,2*P,fontsize(10)); } add(p); add(shift(s1)*p); add(shift(s2)*p); for(int j = 0; j < 3; ++j) for(int i = 0; i < filled[j].length; ++i) filldraw(circle(dir(90-72*(filled[j][i]-1))+j*s1,r)); label("$\parbox{15em}{Initial Position.}$", (-4.5,0)); label("$\parbox{15em}{Lisa says ``1,3,4.'' \\ Bart rotates the table one \\ position counterclockwise. }$", (-4.5,0)+s1); label("$\parbox{15em}{Lights in positions 1,3,4 are \\ flipped.}$", (-4.5,0)+s2);[/asy] Lisa can take as many turns as she needs to win, or she can give up if it becomes clear to her that Bart can prevent her from winning. (a) Show that if $n = 7$ and initially at least one light is on and at least one light is off, then Bart can always prevent Lisa from winning. (b) Show that if $n = 8$, then Lisa can always win in at most 8 turns.