Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.) [i]Proposed by Hong Kong[/i]

Given positive reals $ a, b, c $ that satisfy $ a + b + c = 1 $, show that $$ \displaystyle \sum^{}_{cyc}\frac{a^3+bc}{a^2+bc}\ge 2 $$

A sequence of numbers is defined by $ u_1\equal{}a, u_2\equal{}b$ and $ u_{n\plus{}1}\equal{}\frac{u_n\plus{}u_{n\minus{}1}}{2}$ for $ n \ge 2$. Prove that $ \displaystyle\lim_{n\to\infty}u_n$ exists and express its value in terms of $ a$ and $ b$.

An object moves $ 8$ cm in a straight line from $ A$ to $ B$, turns at an angle $ \alpha$, measured in radians and chosen at random from the interval $ (0,\pi)$, and moves $ 5$ cm in a straight line to $ C$. What is the probability that $ AC<7$? $ \textbf{(A)}\ \frac{1}{6} \qquad \textbf{(B)}\ \frac{1}{5} \qquad \textbf{(C)}\ \frac{1}{4} \qquad \textbf{(D)}\ \frac{1}{3} \qquad \textbf{(E)}\ \frac{1}{2}$

Solve the system of equations in real numbers: \[ \begin{cases*} (x - 1)(y - 1)(z - 1) = xyz - 1,\\ (x - 2)(y - 2)(z - 2) = xyz - 2.\\ \end{cases*} \] [i]Vladimir Bragin[/i]

While exploring a cave, Carl comes across a collection of $5$-pound rocks worth $\$14$ each, $4$-pound rocks worth $\$11$ each, and $1$-pound rocks worth $\$2$ each. There are at least $20$ of each size. He can carry at most $18$ pounds. What is the maximum value, in dollars, of the rocks he can carry out of the cave? $\textbf{(A) } 48 \qquad \textbf{(B) } 49 \qquad \textbf{(C) } 50 \qquad \textbf{(D) } 51 \qquad \textbf{(E) } 52 $

Each of the letters $W$, $X$, $Y$,and $Z$ represents a different integer in the set $ \{ 1,2,3,4\} $, but not necessarily in that order. If , $ \frac{\text{W}}{\text{X}}-\frac{\text{Y}}{\text{Z}}=1 $ then the sum of $W$ and $Y$ is $ \text{(A)}\ 3\qquad\text{(B)}\ 4\qquad\text{(C)}\ 5\qquad\text{(D)}\ 6\qquad\text{(E)}\ 7 $

We know that there exists a positive integer with $7$ distinct digits which is multiple of each of them. What are its digits? (Paolo Leonetti)

We are given three nuggets of weights $ 1$ kg, $ 2$ kg and $ 3$ kg, containing different percentages of gold, and need to cut each nugget into two parts so that the obtained parts can be alloyed into two ingots of weights $ 1$ kg ande $ 5$ kg containing the same proportion of gold. How we can do that?

Let $D=\{ (x,y) \mid x>0, y\neq 0\}$ and let $u\in C^1(\overline {D})$ be a bounded function that is harmonic on $D$ and for which $u=0$ on the $y$-axis. Prove that $u$ is identically zero. (translated by Miklós Maróti)

Consider $9$ points in space, no four of which are coplanar. Each pair of points is joined by an edge (that is, a line segment) and each edge is either colored blue or red or left uncolored. Find the smallest value of $\,n\,$ such that whenever exactly $\,n\,$ edges are colored, the set of colored edges necessarily contains a triangle all of whose edges have the same color.

In a row written in increasing order all the irreducible positive rational numbers, such that the product of the numerator and the denominator is less than 1988. Prove that any two adjacent fractions $\frac{a}{b}$ and $\frac{c}{d},$ $\frac{a}{b} < \frac{c}{d},$ satisfy the equation $b \cdot c - a \cdot d = 1.$

Let $n$ be a positive integer and let $x_1\le x_2\le\cdots\le x_n$ be real numbers. Prove that \[ \left(\sum_{i,j=1}^{n}|x_i-x_j|\right)^2\le\frac{2(n^2-1)}{3}\sum_{i,j=1}^{n}(x_i-x_j)^2. \] Show that the equality holds if and only if $x_1, \ldots, x_n$ is an arithmetic sequence.

$2$ identical red tokens and $2$ identical black tokens are placed on distinct cells of a $5\times5$ grid. Suppose it is impossible to color some additional cells of the grid red or black such that there exists a red path between the red tokens and a black path between the black tokens. Find the number of possible arrangements of the tokens on the grid. (A red path is a path of edge adjacent red cells, and same for a black path.)

Let \( n \geq 4 \). Proof that \[ (2^x - 1)(5^x - 1) = y^n \] have no positive integer solution \((x, y)\).

Given a positive integer $n$, let $M$ be the set of all points in space with integer coordinates $(a, b, c)$ such that $0 \le a, b, c \le n$. A frog must go to the point $(0, 0, 0)$ to the point $(n, n, n)$ according to the following rules: $\bullet$ The frog can only jump to points of M. $\bullet$ In each jump, the frog can go from point $(a, b, c)$ to one of the following points: $(a + 1, b, c)$, $(a, b + 1, c)$, $(a, b, c + 1)$, or $(a, b, c - 1)$. $\bullet$ The frog cannot pass through the same point more than once. In how many different ways can the frog achieve its goal?

Determine all integers $m$, for which it is possible to dissect the square $m\times m$ into five rectangles, with the side lengths being the integers $1, 2, … ,10$ in some order.

Prove that the sum of angles at the longer base of a trapezoid is less than the sum of angles at the shorter base.

$10$ children each have a lunchbox which they store in a basket before entering their classroom. However, being messy children, their lunchboxes get mixed up. When leaving the classroom each student picks up a lunchbox at random. Define a [i]cyclic triple[/i] of students $(A, B, C)$ to be three distinct students such that $A$ has $B$’s lunchbox, $B$ has $C$’s lunchbox, and $C$ has $A$’s lunchbox. Two cyclic triples are considered the same if they contain the same three students (even if in a different order). Determine the expected value of the number of cyclic triples. [i]2015 CCA Math Bonanza Individual Round #14[/i]

Find all prime numbers $p$ such that the number $$3^p+4^p+5^p+9^p-98$$ has at most $6$ positive divisors.

A strip of width $w$ is the set of all points which lie on, or between, two parallel lines distance $w$ apart. Let $S$ be a set of $n$ ($n \ge 3$) points on the plane such that any three different points of $S$ can be covered by a strip of width $1$. Prove that $S$ can be covered by a strip of width $2$.

Find all prime numbers $p$ such that $ p = m^2 + n^2$ and $p\mid m^3+n^3-4$.

A number $N_k$ is defined as [i]periodic[/i] if it is composed in number base $N$ of a repeated $k$ times . Prove that $7$ divides to infinite periodic numbers of the set $N_1, N_2, N_3,...$

(a) Decide whether the fields of the $8 \times 8$ chessboard can be numbered by the numbers $1, 2, \dots , 64$ in such a way that the sum of the four numbers in each of its parts of one of the forms [list][img]http://www.artofproblemsolving.com/Forum/download/file.php?id=28446[/img][/list] is divisible by four. (b) Solve the analogous problem for [list][img]http://www.artofproblemsolving.com/Forum/download/file.php?id=28447[/img][/list]

Sequence $ \{ f_n(a) \}$ satisfies $ \displaystyle f_{n\plus{}1}(a) \equal{} 2 \minus{} \frac{a}{f_n(a)}$, $ f_1(a) \equal{} 2$, $ n\equal{}1,2, \cdots$. If there exists a natural number $ n$, such that $ f_{n\plus{}k}(a) \equal{} f_{k}(a), k\equal{}1,2, \cdots$, then we call the non-zero real $ a$ a $ \textbf{periodic point}$ of $ f_n(a)$. Prove that the sufficient and necessary condition for $ a$ being a $ \textbf{periodic point}$ of $ f_n(a)$ is $ p_n(a\minus{}1)\equal{}0$, where $ \displaystyle p_n(x)\equal{}\sum_{k\equal{}0}^{\left[ \frac{n\minus{}1}{2} \right]} (\minus{}1)^k C_n^{2k\plus{}1}x^k$, here we define $ \displaystyle \frac{a}{0}\equal{} \infty$ and $ \displaystyle \frac{a}{\infty} \equal{} 0$.