Given the sequence $(u_n)_{n=1}^{\infty}$, where $u_1 = 1, u_2 = 2$, and $u_{n + 2} = u_{n + 1} +u_ n+ \frac{(-1)^n-1}{2}$ for any positive integers $n$. Prove that every positive integers can be expressed as the sum of some distinguished numbers of the sequence of numbers $(u_n)_{n=1}^{\infty}$ Nguyen Duy Thai Son, The University of Danang, Da Nang.

In a convex quadrilateral $ABCD$, $\angle ABC = \angle ADC = 90^\circ$. A point $P$ is chosen from the diagonal $BD$ such that $\angle APB = 2\angle CPD$, points $X$, $Y$ is chosen from the segment $AP$ such that $\angle AXB = 2\angle ADB$, $\angle AYD = 2\angle ABD$. Prove that: $BD = 2XY$.

Find all nonnegative integers $x,y$ such that \[ 2 \cdot 3^{x} +1 = 7 \cdot 5^{y}. \]

Let $\{a_n\}$ be a sequence defined by $a_1=0$ and $$a_n=\frac{1}{n}+\frac{1}{\lceil \frac{n}{2} \rceil}\sum_{k=1}^{\lceil \frac{n}{2} \rceil}a_k$$ for any positive integer $n$. Find the maximal term of this sequence.

Let $P$ be a point chosen on the interior of side $\overline{BC}$ of triangle $\triangle ABC$ with side lengths $\overline{AB} = 10, \overline{BC} = 10, \overline{AC} = 12$. If $X$ and $Y$ are the feet of the perpendiculars from $P$ to the sides $AB$ and $AC$, then the minimum possible value of $PX^2 + PY^2$ can be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [i]Proposed by Andrew Wen[/i]

Each vertex of a convex polygon has integer coordinates, and no side of this polygon is horizontal or vertical. Prove that the sum of the lengths of the segments of lines of the form $x = m$, $m$ an integer, that lie within the polygon is equal to the sum of the lengths of the segments of lines of the form $y = n$, $n$ an integer, that lie within the polygon. (G Galperin)

Let $ABCD$ be a parallelogram. Let $M$ be the midpoint of the arc $AC$ containing $B$ of the circumcircle of $ABC$ . Let $E$ be a point on segment $AD$ and $F$ a point on segment $CD$ such that $ME=MD=MF$. Show that $BMEF$ is cyclic. [i]Proposed by A. Tereshin[/i]

Let $f$ be a smooth function on $\mathbb{R}^n$, denote by $G_f=\{(x,f(x)) \in \mathbb{R}^{n+1}: x \in \mathbb{R}^n\}$. Let $g$ be the restriction of the Euclidean metric on $G_f$. (1) Prove that $g$ is a complete metric. (2) If there exists $\Lambda>0$, such that $-\Lambda I_n \le \text{Hess}(f) \le \Lambda I_n$, where $I_n$ is the unit matrix of order $n$, and $\text{Hess}8f)$ is the Hessian matrix of $f$, then the injectivity radius of $(G_f,g)$ is at least $\frac{\pi}{2\Lambda}$.

Let $ABC$ an acute triangle and $D$ and $E$ the feet of heights by $A$ and $B$, respectively, and let $M$ be the midpoint of $AC$. The circle that passes through $D$ and $B$ and is tangent to $BE$ in $B$ intersects the line $BM$ in $F, F\neq B$. Show that $FM$ is the angle bisector of $\angle AFD$.

Suppose that $x, y, z$ are non-zero real numbers such that $$\begin{cases}x = 2 - \dfrac{y}{z} \\ \\ y = 2 -\dfrac{z}{x} \\ \\ z = 2 -\dfrac{x}{y}.\end{cases}$$ Find all possible values of $T = x + y + z$

Let $ABCC_1B_1A_1$ be a convex hexagon such that $AB=BC$, and suppose that the line segments $AA_1, BB_1$, and $CC_1$ have the same perpendicular bisector. Let the diagonals $AC_1$ and $A_1C$ meet at $D$, and denote by $\omega$ the circle $ABC$. Let $\omega$ intersect the circle $A_1BC_1$ again at $E \neq B$. Prove that the lines $BB_1$ and $DE$ intersect on $\omega$.

[b]p1.[/b] James has $8$ Instagram accounts, $3$ Facebook accounts, $4$ QQ accounts, and $3$ YouTube accounts. If each Instagram account has $19$ pictures, each Facebook account has $5$ pictures and $9$ videos, each QQ account has a total of $17$ pictures, and each YouTube account has $13$ videos and no pictures, how many pictures in total does James have in all these accounts? [b]p2.[/b] If Poonam can trade $7$ shanks for $4$ shinks, and she can trade $10$ shinks for $17$ shenks. How many shenks can Poonam get if she traded all of her $105$ shanks? [b]p3.[/b] Jerry has a bag with $3$ red marbles, $5$ blue marbles and $2$ white marbles. If Jerry randomly picks two marbles from the bag without replacement, the probability that he gets two different colors can be expressed as a fraction $\frac{m}{n}$ in lowest terms. What is $m + n$? [b]p4.[/b] Bob's favorite number is between $1200$ and $4000$, divisible by $5$, has the same units and hundreds digits, and the same tens and thousands digits. If his favorite number is even and not divisible by $3$, what is his favorite number? [b]p5.[/b] Consider a unit cube $ABCDEFGH$. Let $O$ be the center of the face $EFGH$. The length of $BO$ can be expressed in the form $\frac{\sqrt{a}}{b}$, where $a$ and $b$ are simplified to lowest terms. What is $a + b$? [b]p6.[/b] Mr. Eddie Wang is a crazy rich boss who owns a giant company in Singapore. Even though Mr. Wang appears friendly, he finds great joy in firing his employees. His immediately fires them when they say "hello" and/or "goodbye" to him. It is well known that $1/2$ of the total people say "hello" and/or "goodbye" to him everyday. If Mr. Wang had $2050$ employees at the end of yesterday, and he hires $2$ new employees at the beginning of each day, in how many days will Mr. Wang first only have $6$ employees left? [b]p7.[/b] In $\vartriangle ABC$, $AB = 5$, $AC = 6$. Let $D,E,F$ be the midpoints of $\overline{BC}$, $\overline{AC}$, $\overline{AB}$, respectively. Let $X$ be the foot of the altitude from $D$ to $\overline{EF}$. Let $\overline{AX}$ intersect $\overline{BC}$ at $Y$ . Given $DY = 1$, the length of $BC$ is $\frac{p}{q}$ for relatively prime positive integers $p, q$: Find $p + q$. [b]p8.[/b] Given $\frac{1}{2006} = \frac{1}{a} + \frac{1}{b}$ where $a$ is a $4$ digit positive integer and $b$ is a $6$ digit positive integer, find the smallest possible value of $b$. [b]p9.[/b] Pocky the postman has unlimited stamps worth $5$, $6$ and $7$ cents. However, his post office has two very odd requirements: On each envelope, an odd number of $7$ cent stamps must be used, and the total number of stamps used must also be odd. What is the largest amount of postage money Pocky cannot make with his stamps, in cents? [b]p10.[/b] Let $ABCDEF$ be a regular hexagon with side length $2$. Let $G$ be the midpoint of side $DE$. Now let $O$ be the intersection of $BG$ and $CF$. The radius of the circle inscribed in triangle $BOC$ can be expressed in the form $\frac{a\sqrt{b}-\sqrt{c}}{d} $ where $a$, $b$, $c$, $d$ are simplified to lowest terms. What is $a + b + c + d$? [b]p11.[/b] Estimation (Tiebreaker): What is the total number of characters in all of the participants' email addresses in the Accuracy Round? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Nine identical spheres of radius $r$ are packed into a unit cube. One sphere is centered at the center of the cube and is tangent to the other eight spheres, each of which is located in a corner of the cube and is tangent to three faces of the cube. Compute the radius of the spheres $r$.

The circumference of a circle is arbitrarily divided into four arcs. The midpoints of the arcs are connected by segments. Show that two of these segments are perpendicular.

Examine the behavior of the expression $ \sum_{\nu\equal{}1}^{n\minus{}1}\frac{\log(n\minus{}\nu)}{\nu}\minus{}\log^2 n$ as $ n\rightarrow \infty$

Which formula represents n-butane? $ \textbf{(A) }\ce{CH3CH2CH2CH3} \qquad\textbf{(B) } \ce{CH2=CHCH2CH3} \qquad\textbf{(C) } \ce{(CH3)2CHCH3} \qquad\textbf{(D) } \ce{(CH3)3CH}\qquad $

The degree of the polynomial $P(x)$ is $2017.$ Prove that the number of distinct real roots of the equation $P(P(x)) = 0$ is not less than the number of distinct real roots of the equation $P(x) = 0.$

Let $\pi (n)$ denote the largest prime divisor of $n$ for any positive integer $n > 1$. Let $q$ be an odd prime. Show that there exists a positive integer $k$ such that $$\pi \left(q^{2^k}-1\right)< \pi\left(q^{2^k}\right)<\pi \left( q^{2^k}+1\right).$$

Let $v(n)$ be the order of $2$ in $n!$. Prove that for any positive integers $a$ and $m$ there exists $n$ ($n>1$) such that $v(n) \equiv a (\mod m)$. I have a book with Mongolian problems from this year, and this problem appeared in it. Perhaps I am terribly misinterpreting this problem, but it seems like it is wrong. Any ideas?

Given an alfabet of $n$ letters. A sequence of letters such that between any 2 identical letters there are no 2 identical letters is called a [i]word[/i]. a) Find the maximal possible length of a [i]word[/i]. b) Find the number of the [i]words[/i] of maximal length.

Given two odd natural numbers $ a,b$ prove that for each $ n\in\mathbb{N}$ there exists $ m\in\mathbb{N}$ such that either $ a^mb^2-1$ or $ b^ma^2-1$ is multiple of $ 2^n.$

Let $n$ be a positive integer. Aslı and Zehra are playing a game on an $n\times n$ grid. Initially, $10n^2$ stones are placed on some of the unit squares of this grid. On each move (starting with Aslı), Aslı chooses a row or a column that contains at least two squares with different numbers of stones, and Zehra redistributes the stones in that row or column so that after redistribution, the difference in the number of stones between any two squares in that row or column is at most one. Furthermore, this move must change the number of stones in at least one square. For which values of $n$, regardless of the initial placement of the stones, can Aslı guarantee that every square ends up with the same number of stones?

$A, B, C, D$ are consecutive vertices of a regular $7$-gon. $AL$ and $AM$ are tangents to the circle center $C$ radius $CB$. $N$ is the intersection point of $AC$ and $BD$. Show that $L, M, N$ are collinear.

Stekel and Prick play a game on an $ m \times n$ board, where $m$ and $n$ are positive are integers. They alternate turns, with Stekel starting. Spine bets on his turn, he always takes a pawn on a square where there is no pawn yet. Prick does his turn the same, but his pawn must always come into a square adjacent to the square that Spike just placed a pawn in on his previous turn. Prick wins like the whole board is full of pawns. Spike wins if Prik can no longer move a pawn on his turn, while there is still at least one empty square on the board. Determine for all pairs $(m, n)$ who has a winning strategy.

Given a regular tetrahedron $PQRS$ with side length $d$. Find the volume of the solid generated by a rotation around the line passing through $P$ and the midpoint $M$ of $QR$.