Ana and Natalia alternately play on a $ n \times n$ board (Ana rolls first and $n> 1$). At the beginning, Ana's token is placed in the upper left corner and Natalia's in the lower right corner. A turn consists of moving the corresponding piece in any of the four directions (it is not allowed to move diagonally), without leaving the board. The winner is whoever manages to place their token on the opponent's token. Determine if either of them can secure victory after a finite number of turns.

Determine all odd primes $p$ and $q$ such that the equation $x^p + y^q = pq$ at least one solution $(x, y)$ where $x$ and $y$ are positive integers.

Zscoder has an simple undirected graph $G$ with $n\ge 3$ vertices. Navi labels a positive integer to each vertex, and places a token at one of the vertex. This vertex is now marked red. In each turn, Zscoder plays with following rule: $\bullet$ If the token is currently at vertex $v$ with label $t$, then he can move the token along the edges in $G$ (possibly repeating some edges) exactly $t$ times. After these $t$ moves, he marks the current vertex red where the token is at if it is unmarked, or does nothing otherwise, then finishes the turn. Zscoder claims that he can mark all vertices in $G$ red after finite number of turns, regardless of Navi's labels and starting vertex. What is the minimum number of edges must $G$ have, in terms of $n$? [i]Proposed by Yeoh Zi Song[/i]

Investigate if there exist infinitely many natural numbers $n$ such that $n$ divides $2^n+3^n$.

Let $A,B,C$ be points on the sides $B_1C_1, C_1A_1,A_1B_1$ of a triangle $A_1B_1C_1$ such that $A_1A,B_1B,C_1C$ are the bisectors of angles of the triangle. We have that $AC = BC$ and $A_1C_1 \neq B_1C_1.$ $(a)$ Prove that $C_1$ lies on the circumcircle of the triangle $ABC$. $(b)$ Suppose that $\angle BAC_1 =\frac{\pi}{6};$ find the form of triangle $ABC$.

The value of $ \frac{1}{16}a^0\plus{}\left (\frac{1}{16a} \right )^0\minus{} \left (64^{\minus{}\frac{1}{2}} \right )\minus{} (\minus{}32)^{\minus{}\frac{4}{5}}$ is: $ \textbf{(A)}\ 1 \frac{13}{16} \qquad \textbf{(B)}\ 1 \frac{3}{16} \qquad \textbf{(C)}\ 1 \qquad \textbf{(D)}\ \frac{7}{8} \qquad \textbf{(E)}\ \frac{1}{16}$

Find all functions $f: \mathbb{Z^+} \to \mathbb{Z^+}$ such that for all integers $a, b, c$ we have $$ af(bc)+bf(ac)+cf(ab)=(a+b+c)f(ab+bc+ac). $$ [i]Note. The set $\mathbb{Z^+}$ refers to the set of positive integers.[/i] [i]Proposed by Mojtaba Zare, Iran[/i]

Let $A$ and $B$ be two fixed points of a given circle and $XY$ a diameter of this circle. Find the locus of the intersection points of lines $AX$ and $BY$ . ($BY$ is not a diameter of the circle). Albanian National Mathematical Olympiad 2010---12 GRADE Question 1.

Prove that if points $ A_1, B_1, C_1 $ lying on the sides $ BC, CA, AB $ of a triangle $ ABC $ are the orthogonal projections of a point $ P $ of the triangle onto these sides, then $$ AC_1^2 + BA_1^2 + CB_1^2 = AB_1^2 + BC_1^2 + CA_1^2.$$

Given that $x$ is a real number, compute the minimum possible value of $(x-20)^2 + (x-18)^2$.

The angle bisectors at $A$ and $C$ in a non-isosceles triangle $ABC$ with incenter $I$ intersect its circumcircle $k$ at $A_0$ and $C_0$, respectively. The line through $I$, parallel to $AC$, intersects $A_0C_0$ at $P$. Prove that $PB$ is tangent to $k$.

The perimeter of an isosceles trapezoid is $24$. If each of the legs is two times the length of the shorter base and is two-thirds the length of the longer base, what is the area of the trapezoid?

Let $P,Q,R$ be polynomials and let $S(x) = P(x^3) + xQ(x^3) + x^2R(x^3)$ be a polynomial of degree $n$ whose roots $x_1,\ldots, x_n$ are distinct. Construct with the aid of the polynomials $P,Q,R$ a polynomial $T$ of degree $n$ that has the roots $x_1^3 , x_2^3 , \ldots, x_n^3.$

On the table was a pile of $135$ chocolate chips. Phil ate $\tfrac49$ of the chips, Eric ate $\tfrac4{15}$ of the chips, and Beverly ate the rest of the chips. How many chips did Beverly eat?

Prove that the integer $1^1 + 3^3 + 5^5 + .. + (2^n - 1)^{2^n-1}$ is a multiple of $2^n$ but not a multiple of $2^{n+1}$.

There are $2014$ airports in the faraway land of Artinia. Each pair of airports is connected by a nonstop flight in one or both directions. Show that there is some airport from which it is possible to reach every other airport in at most two flights.

Prove that for every parititon of set $X=\{1,2,...,9\}$ on two disjoint sets at least one of them contains three elements such that sum of some two of them is equal to third

For each positive integer $n$, show that the polynomial: $$P_n(x)=\sum _{k=0}^n2^k\binom{2n}{2k}x^k(x-1)^{n-k}$$ has $n$ real roots.

p1. Among the numbers $\frac15$ and $\frac14$ there are infinitely many fractional numbers. Find $999$ decimal numbers between $\frac15$ and $\frac14$ so that the difference between the next fractional number with the previous fraction constant. (i.e. If $x_1, x_2, x_3, x_4,..., x_{999}$ is a fraction that meant, then $x_2 - x_1= x_3 - x_3= ...= x_n - x_{n-1}=...=x_{999}-x_{998}$) p2. The pattern in the image below is: "Next image obtained by adding an image of a black equilateral triangle connecting midpoints of the sides of each white triangle that is left in the previous image." The pattern is continuous to infinity. [img]https://cdn.artofproblemsolving.com/attachments/e/f/81a6b4d20607c7508169c00391541248b8f31e.png[/img] It is known that the area of ​​the triangle in Figure $ 1$ is $ 1$ unit area. Find the total area of ​​the area formed by the black triangles in figure $5$. Also find the total area of the area formed by the black triangles in the $20$th figure. p3. For each pair of natural numbers $a$ and $b$, we define $a*b = ab + a - b$. The natural number $x$ is said to be the [i]constituent [/i] of the natural number $n$ if there is a natural number $y$ that satisfies $x*y = n$. For example, $2$ is a constituent of $6$ because there is a natural number 4 so that $2*4 = 2\cdot 4 + 2 - 4 = 8 + 2 - 4 = 6$. Find all constituent of $2005$. p4. Three people want to eat at a restaurant. To find who pays them to make a game. Each tossing one coin at a time. If the result is all heads or all tails, then they toss again. If not, then "odd person" (i.e. the person whose coin appears different from the two other's coins) who pay. Determine the number of all possible outcomes, if the game ends in tossing: a. First. b. Second. c. Third. d. Tenth. p5. Given the equation $x^2 + 3y^2 = n$, where $x$ and $y$ are integers. If $n < 20$ what number is $n$, and which is the respective pair $(x,y)$ ? Show that it is impossible to solve $x^2 + 3y^2 = 8$ in integers.

For $n\ge 1$ let $d_n$ be the $\gcd$ of the entries of $A^n-\mathcal{I}_2$ where \[ A=\begin{pmatrix} 3&2\\ 4&3\end{pmatrix}\quad \text{ and }\quad \mathcal{I}_2=\begin{pmatrix}1&0\\ 0&1\\\end{pmatrix}\] Show that $\lim_{n\to \infty}d_n=\infty$.

Jimmy’s garden has right angled triangle shape that lies on island of circular shape in such a way that the corners of the triangle are on the shore of the island. When he made fences along the garden he realized that the length of the shortest side is $36$ meter shorter than the longest side, and third side required $48$ meter long fence. In the middle of the garden he built a house of circular shape that has the largest possible size. Jimmy measured the distance between the center of his house and the center of the island. What is the square of this distance?

Let $ABC$ be an isosceles triangle with base $BC$ and $\angle BAC = 20^o$. Let $D$ a point on side $AB$ such that $AD = BC$. Determine $\angle DCA$.

There are 6 lines in space, of which no 3 are parallel, no 3 pass through the same point, and no 3 are contained in the same plane. Prove that among these 6 lines there are 3 mutually oblique lines.

Show that for each natural number $k$ there exist only finitely many triples $(p, q, r)$ of distinct primes for which $p$ divides $qr-k$, $q$ divides $pr-k$, and $r$ divides $pq - k$.

We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$ \[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n}, \] where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof. Prove that $1+L_{2^{j}}\equiv 0 \pmod{2^{j+1}}$ for $j \geq 0$.