Define the sequence $a_0,a_1,a_2,\hdots$ by $a_n=2^n+2^{\lfloor n/2\rfloor}$. Prove that there are infinitely many terms of the sequence which can be expressed as a sum of (two or more) distinct terms of the sequence, as well as infinitely many of those which cannot be expressed in such a way.

Define a sequence $\{a_n\}_{n\ge 1}$ such that $a_1=1,a_2=2$ and $a_{n+1}$ is the smallest positive integer $m$ such that $m$ hasn't yet occurred in the sequence and also $\text{gcd}(m,a_n)\neq 1$. Show all positive integers occur in the sequence.

All the rationals are coloured with $n$ colours so that, if rationals $a$ and $b$ are colored with different colours then $\frac{a+b}2$ is coloured with a colour different from both $a$ and $b$. Prove that every rational is coloured with the same colour.

Find $\lim_{a\rightarrow +0} \int_a^1 \frac{x\ln x}{(1+x)^3}dx.$ [i]2010 Nara Medical University entrance exam[/i]

Let $k$ be a positive integer. A positive integer $n$ is called a $k$-good number if it satisfies the following two conditions: 1. $n$ has exactly $2k$ digits in decimal representation (it cannot have leading zeros). 2. If the first $k$ digits and the last $k$ digits of $n$ are considered as two separate $k$-digit numbers (which may have leading zeros), the square of their sum is equal to $n$. For example, $2025$ is a $2$-good number because \[(20 + 25)^2 = 2025.\] Find all $3$-good numbers.

Bugs Bunny plays a game in the Euclidean plane. At the $n$-th minute $(n \geq 1)$, Bugs Bunny hops a distance of $F_n$ in the North, South, East, or West direction, where $F_n$ is the $n$-th Fibonacci number (defined by $F_1 = F_2 =1$ and $F_n = F_{n-1} + F_{n-2}$ for $n \geq 3$). If the first two hops were perpendicular, prove that Bugs Bunny can never return to where he started. [i]Proposed by Dylan Toh[/i]

On a line a set of segments is given of total length less than $n$. Prove that every set of $n$ points of the line can be translated in some direction along the line for a distance smaller than $\frac{n}{2}$ so that none of the points remain on the segments.

Solve in nonnegative integers the following equation : $$21^x+4^y=z^2$$

Let $ABCD$ be a rectangle with $AB=10$ and $BC=26$. Let $\omega_1$ be the circle with diameter $\overline{AB}$ and $\omega_2$ be the circle with diameter $\overline{CD}$. Suppose $\ell$ is a common internal tangent to $\omega_1$ and $\omega_2$ and that $\ell$ intersects $AD$ and $BC$ at $E$ and $F$ respectively. What is $EF$? [asy] size(10cm); draw((0,0)--(26,0)--(26,10)--(0,10)--cycle); draw((1,0)--(25,10)); draw(circle((0,5),5)); draw(circle((26,5),5)); dot((1,0)); dot((25,10)); label("$E$",(1,0),SE); label("$F$",(25,10),NW); label("$A$", (0,0), SW); label("$B$", (0,10), NW); label("$C$", (26,10), NE); label("$D$", (26,0), SE); dot((0,0)); dot((0,10)); dot((26,0)); dot((26,10)); [/asy] [i]Proposed by Nathan Xiong[/i]

Two circles in a plane intersect. $A$ is one of the points of intersection. Starting simultaneously from $A$ two points move with constant speed, each travelling along its own circle in the same sense. The two points return to $A$ simultaneously after one revolution. Prove that there is a fixed point $P$ in the plane such that the two points are always equidistant from $P.$

Suppose that $\{a_n\}$ is a sequence such that $a_{n+1}=(1+\frac{k}{n})a_{n}+1$ with $a_{1}=1$.Find all positive integers $k$ such that any $a_n$ be integer.

For the several values of the parameter $m\in \mathbb{N^{*}}$,find the pairs of integers $(a,b)$ that satisfy the relation $\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \frac{[a,m]+[b,m]}{(a+b)m}=\frac{10}{11}$, and,moreover,on the Cartesian plane $Oxy$ the lie in the square $D=\{(x,y):1\leq x\leq 36,1\leq y\leq 36\}$. [i][u]Note:[/u]$[k,l]$ denotes the least common multiple of the positive integers $k,l$.[/i]

Find the number of sets $A$ that satisfy the three conditions: $\star$ $A$ is a set of two positive integers $\star$ each of the numbers in $A$ is at least $22$ percent the size of the other number $\star$ $A$ contains the number $30.$

A permutation of $\{1, 2, \dots, 7\}$ is chosen uniformly at random. A partition of the permutation into contiguous blocks is correct if, when each block is sorted independently, the entire permutation becomes sorted. For example, the permutation $(3, 4, 2, 1, 6, 5, 7)$ can be partitioned correctly into the blocks $[3, 4, 2, 1]$ and $[6, 5, 7]$, since when these blocks are sorted, the permutation becomes $(1, 2, 3, 4, 5, 6, 7)$. Find the expected value of the maximum number of blocks into which the permutation can be partioned correctly.

Find all $(x, y, z, n) \in {\mathbb{N}}^4$ such that $ x^3 +y^3 +z^3 =nx^2 y^2 z^2$.

Suppose point $P$ is inside triangle $ABC.$ Let $AP, BP,$ and $CP$ intersect sides $BC, CA,$ and $AB$ at points $D,$ $E,$ and $F,$ respectively. Suppose $\angle APB = \angle BPC = \angle CPA, PD = \tfrac{1}{4}, PE = \tfrac{1}{5},$ and $PF = \tfrac{1}{7}.$ Compute $AP +BP +CP.$

The vertices of a regular $13$-gon are colored in three different colors. Show that there are three vertices which have the same color and are also the vertices of an isosceles triangle.

A circle is divided into $2n$ equal arcs by $2n$ points. Find all $n>1$ such that these points can be joined in pairs using $n$ segments, all of different lengths and such that each point is the endpoint of exactly one segment.

The circumference with the radius $100$ cm is drawn on the cross-lined paper with the side of the squares $1$ cm. It neither comes through the vertices of the squares, nor touches the lines. How many squares can it pass through?

A uniform disk is being pulled by a force F through a string attached to its center of mass. Assume that the disk is rolling smoothly without slipping. At a certain instant of time, in which region of the disk (if any) is there a point moving with zero total acceleration? A Region I B Region II C Region III D Region IV E All points on the disk have a nonzero acceleration

A cow lives on a cubic planet of side length $12$. It is tied on a leash $12$ units long that is staked at the center of one of the faces of the cube. The total surface area that the cow can graze is $A \pi+B( \sqrt3 -1)$. Find $A + B$.

Consider a checkered $3m\times 3m$ square, where $m$ is an integer greater than $1.$ A frog sits on the lower left corner cell $S$ and wants to get to the upper right corner cell $F.$ The frog can hop from any cell to either the next cell to the right or the next cell upwards. Some cells can be [i]sticky[/i], and the frog gets trapped once it hops on such a cell. A set $X$ of cells is called [i]blocking[/i] if the frog cannot reach $F$ from $S$ when all the cells of $X$ are sticky. A blocking set is [i] minimal[/i] if it does not contain a smaller blocking set.[list=a][*]Prove that there exists a minimal blocking set containing at least $3m^2-3m$ cells. [*]Prove that every minimal blocking set containing at most $3m^2$ cells.

$x\equiv\left(\sum_{k=1}^{2007}k\right)\mod{2016}$, where $0\le x\le 2015$. Solve for $x$.

Prove that, for any integers $a,b,c$, there exists a positive integer $n$ such that $\sqrt{n^3+an^2+bn+c}$ is not an integer.

Find all triples $(a,b,c)$ of positive real numbers satisfying the system of equations \[ a\sqrt{b}-c \&= a,\qquad b\sqrt{c}-a \&= b,\qquad c\sqrt{a}-b \&= c. \]