Suppose that $p|(2t^2-1)$ and $p^2|(2st+1)$. Prove that $p^2|(s^2+t^2-1)$

Let $p$ be a prime where $p \ge 5$. Prove that $\exists n$ such that $1+ (\sum_{i=2}^n \frac{1}{i^2})(\prod_{i=2}^n i^2) \equiv 0 \pmod p$

Consider a triangle $ABC$ with $AB < AC$ and let $H$ and $O$ be its orthocenter and circumcenter, respectively. A line starting from $B$ cuts the lines $AO$ and $AH$ at $M$ and $M'$ so that $M'$ is the midpoint of $BM$. Another line starting from $C$ cuts the lines $AH$ and $AO$ at $N$ and $N'$ so that $N'$ is the midpoint of $CN$. Prove that $M, M', N, N'$ are on the same circle.

The enemy ship has landed on a $9\times 9$ board that covers exactly $5$ squares of the board, like this: [img]https://cdn.artofproblemsolving.com/attachments/2/4/ae5aa95f5bb5e113fd5e25931a2bf8eb872dbe.png[/img] The ship is invisible. Each defensive missile covers exactly one square, and destroys the ship if it hits one of the $5$ squares that it occupies. Determine the minimum number of missiles needed to destroy the enemy ship with certainty .

The diameter of a circle is divided into $ n$ equal parts. On each part a semicircle is construced. As $ n$ becomes very large, the sum of the lengths of the arcs of the semicircles approaches a length: $ \textbf{(A)}$ equal to the semi-circumference of the original circle $ \textbf{(B)}$ equal to the diameter of the original circle $ \textbf{(C)}$ greater than the diameter but less than the semi-circumeference of the original circle $ \textbf{(D)}$ that is infinite $ \textbf{(E)}$ greater than the semi-circumference but finite

We denote by gcd (...) the greatest common divisor of the numbers in (...). (For example, gcd$(4, 6, 8)=2$ and gcd $(12, 15)=3$.) Suppose that positive integers $a, b, c$ satisfy the following four conditions: $\bullet$ gcd $(a, b, c)=1$, $\bullet$ gcd $(a, b + c)>1$, $\bullet$ gcd $(b, c + a)>1$, $\bullet$ gcd $(c, a + b)>1$. a) Is it possible that $a + b + c = 2015$? b) Determine the minimum possible value that the sum $a+ b+ c$ can take.

What is the sum (in base $10$) of all the natural numbers less than $64$ which have exactly three ones in their base $2$ representation?

Let $ x, y, z, w $ be nonzero real numbers such that $ x+y \ne 0$, $ z+w \ne 0 $, and $ xy+zw \ge 0 $. Prove that \[ \left( \frac{x+y}{z+w} + \frac{z+w}{x+y} \right) ^{-1} + \frac{1}{2} \ge \left( \frac{x}{z} + \frac{z}{x} \right) ^{-1} + \left( \frac{y}{w} + \frac{w}{y} \right) ^{-1}\]

Let $n$ be a natural number, $n \ge 5$, and $a_1, a_2, . . . , a_n$ real numbers such that all possible sums $a_i + a_j$, where $1 \le i < j \le n$, form $\frac{n(n-1)}{2}$ consecutive members of an arithmetic progression when taken in some order. Prove that $a_1 = a_2 = . . . = a_n$.

The plane has a semicircle with center $O$ and diameter $AB$. Chord $CD$ is parallel to the diameter $AB$ and $\angle AOC = \angle DOB = \frac{7}{16}$ (radians). Which of the two parts it divides into a semicircle is larger area?

A diabolical combination lock has $n$ dials (each with $c$ possible states), where $n,c>1$. The dials are initially set to states $d_1, d_2, \ldots, d_n$, where $0\le d_i\le c-1$ for each $1\le i\le n$. Unfortunately, the actual states of the dials (the $d_i$'s) are concealed, and the initial settings of the dials are also unknown. On a given turn, one may advance each dial by an integer amount $c_i$ ($0\le c_i\le c-1$), so that every dial is now in a state $d_i '\equiv d_i+c_i \pmod{c}$ with $0\le d_i ' \le c-1$. After each turn, the lock opens if and only if all of the dials are set to the zero state; otherwise, the lock selects a random integer $k$ and cyclically shifts the $d_i$'s by $k$ (so that for every $i$, $d_i$ is replaced by $d_{i-k}$, where indices are taken modulo $n$). Show that the lock can always be opened, regardless of the choices of the initial configuration and the choices of $k$ (which may vary from turn to turn), if and only if $n$ and $c$ are powers of the same prime. [i]Bobby Shen.[/i]

Let $p$ be a prime number. Troy and Abed are playing a game. Troy writes a positive integer $X$ on the board, and gives a sequence $(a_n)_{n\in\mathbb{N}}$ of positive integers to Abed. Abed now makes a sequence of moves. The $n$-th move is the following: $$\text{ Replace } Y \text{ currently written on the board with either } Y + a_n \text{ or } Y \cdot a_n.$$ Abed wins if at some point the number on the board is a multiple of $p$. Determine whether Abed can win, regardless of Troy’s choices, if $a) p = 10^9 + 7$; $b) p = 10^9 + 9$. [i]Remark[/i]: Both $10^9 + 7$ and $10^9 + 9$ are prime. [i]Proposed by Ivan Novak[/i]

If $f(x)=4^x$ then $f(x+1)-f(x)$ equals: $ \text{(A)}\ 4\qquad\text{(B)}\ f(x)\qquad\text{(C)}\ 2f(x)\qquad\text{(D)}\ 3f(x)\qquad\text{(E)}\ 4f(x) $

Determine the natural number $a =\frac{p+q}{r}+\frac{q+r}{p}+\frac{r+p}{q}$ where $p, q$ and $r$ are prime positive numbers.

Let $\omega$ be a circle with center $A$ and radius $R$. On the circumference of $\omega$ four distinct points $B, C, G, H$ are taken in that order in such a way that $G$ lies on the extended $B$-median of the triangle $ABC$, and H lies on the extension of altitude of $ABC$ from $B$. Let $X$ be the intersection of the straight lines $AC$ and $GH$. Show that the segment $AX$ has length $2R$.

Let $ABC$ be an acute triangle with $D, E, F$ the feet of the altitudes lying on $BC, CA, AB$ respectively. One of the intersection points of the line $EF$ and the circumcircle is $P.$ The lines $BP$ and $DF$ meet at point $Q.$ Prove that $AP = AQ.$ [i]Proposed by Christopher Bradley, United Kingdom[/i]

In triangle $ABC$ given is point $P$ such that $\angle ACP = \angle ABP = 10^{\circ}$, $\angle CAP = 20^{\circ}$ and $\angle BAP = 30^{\circ}$. Prove that $AC=BC$

Consider the string of length $6$ composed of three characters $a, b, c$. For each string, if two $a$s are next to each other, or two $b$s are next to each other, then replace $aa$ by $b$, and replace $bb$ by $a$. Also, if $a$ and $b$ are next to each other, or two $c$s are next to each other, remove all two of them (i.e. delete $ab, ba, cc$). Determine the number of strings that can be reduced to $c$, the string of length $1$, by the reducing processes mentioned above.

Suppose you have $15$ circles of radius $1$. Compute the side length of the smallest equilateral triangle that could possibly contain all the circles, if you are free to arrange them in any shape, provided they don’t overlap.

Consider a board on $2013 \times 2013$ squares, what is the maximum number of chess knights that can be placed so that no $2$ attack each other?

Find all $a,b \in \mathbb{N}$ such that $$2049^ba^{2048}-2048^ab^{2049}=1.$$ [i]Proposed by fattypiggy123 and 61plus[/i]

Determine all pairs $(m, n)$ of positive integers, for which cube $K$ with edges of length $n$, can be build in with cuboids of shape $m \times 1 \times 1$ to create cube with edges of length $n + 2$, which has the same center as cube $K$.

In $\triangle ABC\ T$ is a point lies on the internal angle bisector of $B$. Let $\omega$ be circle with diameter $BT$. $\omega$ intersects with $BA$ and $BC$ at $P$ and $Q$,respectively. A circle passes through $A$ and tangent to $\omega$ at $P$ intersects with $AC$ again at $X$ . A circle passes through $B$ and tangent to $\omega$ at $Q$ intersects with $AC$ again at $Y$ . Prove that $TX=TY$

Let $P(x)$ be a polynomial of odd degree. Prove that the equation $P(P(x)) = 0$ has at least as many different real roots as the equation $P(x) = 0$ [hide=original wording]Пусть P(x) — многочлен нечетной степени. Докажите, что уравнение P(P(x)) = 0 имеет не меньше различных действительных корней, чем уравнение P(x) = 0[/hide]

Let $ABC$ be a triangle inscribed in a circle $\omega$ and $\ell$ be the tangent to $\omega$ at $A$. The line through $B$ parallel to $AC$ meets $\ell$ at $P$, and the line through $C$ parallel to $AB$ meets $\ell$ at $Q$. The circumcircles of $ABP$ and $ACQ$ meet at $S\neq A$. Show that $AS$ bisects $BC$. [i]Proposed by Andrew Gu.[/i]