Let $p$ be a prime number, determine all positive integers $(x, y, z)$ such that: $x^p + y^p = p^z$

In a non-isosceles triangle $ABC$, let $I$ be its incenter. The incircle of $ABC$ touches $BC$, $CA$, and $AB$ at $D$, $E$, and $F$, respectively. A line passing through $D$ and perpendicular to $AD$ intersects $IB$ and $IC$ at $A_b$ and $A_c$, respectively. Define the points $B_c$, $B_a$, $C_a$, and $C_b$ similarly. Let $G$ be the intersection of the cevians $AD$, $BE$, and $CF$. The points $O_1$ and $O_2$ are the circumcenter of the triangles $A_bB_cC_a$ and $A_cB_aC_b$, respectively. Prove that $IG$ is the perpendicular bisector of $O_1O_2$.

The finite sequence $a_1, a_2, ... , a_n$ of ones and zeroes should satisfy a condition: [i]for every $k$ from $0$ to $(n-1)$ the sum a_1a_{k+1} + a_2a_{k+2} + ... + a_{n-k}a_n should be odd.[/i] a) Construct such a sequence for $n=25$. b) Prove that there exists such a sequence for some $n > 1000$.

For each positive integer $n$ let $A_n$ be the $n \times n$ matrix such that its $a_{ij}$ entry is equal to ${i+j-2 \choose j-1}$ for all $1\leq i,j \leq n.$ Find the determinant of $A_n$.

Points $A$, $B$, and $C$ lie in that order along a straight path where the distance from $A$ to $C$ is $1800$ meters. Ina runs twice as fast as Eve, and Paul runs twice as fast as Ina. The three runners start running at the same time with Ina starting at $A$ and running toward $C$, Paul starting at $B$ and running toward $C$, and Eve starting at $C$ and running toward $A$. When Paul meets Eve, he turns around and runs toward $A$. Paul and Ina both arrive at $B$ at the same time. Find the number of meters from $A$ to $B$.

Let $ABC$ be an acute-angled triangle, and let $P$ and $Q$ be two points on its side $BC$. Construct a point $C_{1}$ in such a way that the convex quadrilateral $APBC_{1}$ is cyclic, $QC_{1}\parallel CA$, and $C_{1}$ and $Q$ lie on opposite sides of line $AB$. Construct a point $B_{1}$ in such a way that the convex quadrilateral $APCB_{1}$ is cyclic, $QB_{1}\parallel BA$, and $B_{1}$ and $Q$ lie on opposite sides of line $AC$. Prove that the points $B_{1}$, $C_{1}$, $P$, and $Q$ lie on a circle.

Let $M$ be a point on side $BC$ of isosceles $ABC$ ($AB=AC$) and let $N$ be a points on the extension of $BC$ such that $(AM)^2+(AN)^2=2(AB)^2$. Find the locus of point $N$ when point $M$ moves on side $BC$.

Let $\sigma(n)=\sum_{d|n} d$, the sum of positive divisors of an integer $n>0$. [list] [b](a)[/b] Show that $\sigma(mn)=\sigma(m)\sigma(n)$ for positive integers $m$ and $n$ with $gcd(m,n)=1$ [b](b)[/b] Find all positive integers $n$ such that $\sigma(n)$ is a power of $2$.[/list]

Let $P(t)$ be a nonconstant polynomial with real coefficients. Prove that the system of simultaneous equations $$ \int_{0}^{x} P(t)\sin t \, dt =0, \;\;\;\; \int_{0}^{x} P(t) \cos t \, dt =0 $$ has only finitely many solutions $x.$

Let $\{a_n\}$ be a sequence of real numbers with $a_1=-1$, $a_2=2$ and for all $n\ge3$, $$a_{n+1}-a_n-a_{n+2}=0.$$ Find $a_1+a_2+a_3+\ldots+a_{2015}$.

At the top of a piece of paper is written a list of distinctive natural numbers. To continue the list you must choose 2 numbers from the existent ones and write in the list the least common multiple of them, on the condition that it isn’t written yet. We can say that the list is closed if there are no other solutions left (for example, the list 2, 3, 4, 6 closes right after we add 12). Which is the maximum numbers which can be written on a list that had closed, if the list had at the beginning 10 numbers?

[b]p1.[/b] The length of the side $AB$ of the trapezoid with bases $AD$ and $BC$ is equal to the sum of lengths $|AD|+|BC|$. Prove that bisectors of angles $A$ and $B$ do intersect at a point of the side $CD$. [b]p2.[/b] Polynomials $P(x) = x^4 + ax^3 + bx^2 + cx + 1$ and $Q(x) = x^4 + cx^3 + bx^2 + ax + 1$ have two common roots. Find these common roots of both polynomials. [b]p3.[/b] A girl has a box with $1000$ candies. Outside the box there is an infinite number of chocolates and muffins. A girl may replace: $\bullet$ two candies in the box with one chocolate bar, $\bullet$ two muffins in the box with one chocolate bar, $\bullet$ two chocolate bars in the box with one candy and one muffin, $\bullet$ one candy and one chocolate bar in the box with one muffin, $\bullet$ one muffin and one chocolate bar in the box with one candy. Is it possible that after some time it remains only one object in the box? [b]p4.[/b] There are $9$ straight lines drawn in the plane. Some of them are parallel some of them intersect each other. No three lines do intersect at one point. Is it possible to have exactly $17$ intersection points? [b]p5.[/b] It is known that $x$ is a real number such that $x+\frac{1}{x}$ is an integer. Prove that $x^n+\frac{1}{x^n}$ is an integer for any positive integer $n$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider a board consisting of $n\times n$ unit squares where $n \ge 2$. Two cells are called neighbors if they share a horizontal or vertical border. In the beginning, all cells together contain $k$ tokens. Each cell may contain one or several tokens or none. In each turn, choose one of the cells that contains at least one token for each of its neighbors and move one of those to each of its neighbors. The game ends if no such cell exists. (a) Find the minimal $k$ such that the game does not end for any starting configuration and choice of cells during the game. (b) Find the maximal $k$ such that the game ends for any starting configuration and choice of cells during the game. Proposed by Theresia Eisenkölbl

For every integer $n$ not equal to $1$ or $-1$, define $S(n)$ as the smallest integer greater than $1$ that divides $n$. In particular, $S(0)=2$. We also define $S(1) = S(-1) = 1$. Let $f$ be a non-constant polynomial with integer coefficients such that $S(f(n)) \leq S(n)$ for every positive integer $n$. Prove that $f(0)=0$. [b]Note:[/b] A non-constant polynomial with integer coefficients is a function of the form $f(x) = a_0 + a_1 x + a_2 x^2 + \ldots + a_k x^k$, where $k$ is a positive integer and $a_0,a_1,\ldots,a_k$ are integers such that $a_k \neq 0$. [i]Pitchayut Saengrungkongka, Thailand[/i]

Let $r_k$ denote the remainder when ${127 \choose k}$ is divided by $8$. Compute$ r_1 + 2r_2 + 3r_3 + · · · + 63r_{63}.$

Find the number of positive integers $x$ less than $100$ for which $$3^x + 5^x + 7^x + 11^x + 13^x + 17^x + 19^x$$ is prime.

Let $\left< F_n\right>$ be the Fibonacci sequence, that is, $F_0=0$, $F_1=1$, and $F_{n+2}=F_{n+1}+F_{n}$ holds for all nonnegative integers $n$. Find all pairs $(a,b)$ of positive integers with $a < b$ such that $F_n-2na^n$ is divisible by $b$ for all positive integers $n$.

(I'll skip over the whole "dressing" of the graph in cities and flights [color=#FF0000][Mod edit: Shu has posted the "dressed-up" version below][/color]) For an ordinary directed graph, show that there is a subset A of vertices such that: $1.$ There are no edges between the vertices of A. $2.$ For any vertex $v$, there is either a direct way from $v$ to a vertex in A, or a way passing through only one vertex and ending in A (like $v$ ->$v'$-> $a$, where $a$ is a vertex in A)

A cube with size $10\times 10\times 10$ consists of $1000$ unit cubes, all colored white. $A$ and $B$ play a game on this cube. $A$ chooses some pillars with size $1\times 10\times 10$ such that no two pillars share a vertex or side, and turns all chosen unit cubes to black. $B$ is allowed to choose some unit cubes and ask $A$ their colors. How many unit cubes, at least, that $B$ need to choose so that for any answer from $A$, $B$ can always determine the black unit cubes?

Hammie is in the $6^\text{th}$ grade and weighs 106 pounds. His quadruplet sisters are tiny babies and weigh 5, 5, 6, and 8 pounds. Which is greater, the average (mean) weight of these five children or the median weight, and by how many pounds? $\textbf{(A)}\ \text{median, by 60} \qquad \textbf{(B)}\ \text{median, by 20} \qquad \textbf{(C)}\ \text{average, by 5} \qquad \textbf{(D)}\ \text{average, by 15}$ \\ $\textbf{(E)}\ \text{average, by 20}$

Prove that the sum of the distances of the vertices of a regular tetrahedron from the center of its circumscribed sphere is less than the sum of the distances of these vertices from any other point in space.

Chords $ AB$ and $ CD$ of a circle intersect at a point $ E$ inside the circle. Let $ M$ be an interior point of the segment $ EB$. The tangent line at $ E$ to the circle through $ D$, $ E$, and $ M$ intersects the lines $ BC$ and $ AC$ at $ F$ and $ G$, respectively. If \[ \frac {AM}{AB} \equal{} t, \] find $\frac {EG}{EF}$ in terms of $ t$.

Given any set of $9$ points in the plane such that there is no $3$ of them collinear, show that for each point $P$ of the set, the number of triangles with its vertices on the other $8$ points and that contain $P$ on its interior is even.

Find all pairs of positive integers $(a, b)$ such that $f(x)=x$ is the only function $f:\mathbb{R}\to \mathbb{R}$ that satisfies $$f^a(x)f^b(y)+f^b(x)f^a(y)=2xy$$ for all $x, y\in \mathbb{R}$.

Let $n$ be a positive integer, and $x$ be a positive real number. Prove that $$\sum_{k=1}^{n} \left( x \left[\frac{k}{x}\right] - (x+1)\left[\frac{k}{x+1}\right]\right) \leq n,$$ where $[x]$ denotes the largest integer not exceeding $x$.