For a positive integer n the number $P(n)$ is the product of the positive divisors of $n$. For example, $P(20) = 8000$, as the positive divisors of $20$ are $1, 2, 4, 5, 10$ and $20$, whose product is $1 \cdot 2 \cdot 4 \cdot 5 \cdot 10 \cdot 20 = 8000$. (a) Find all positive integers $n$ satisfying $P(n) = 15n$. (b) Show that there exists no positive integer $n$ such that $P(n) = 15n^2$.

In the rectangular coordinate system every point with integer coordinates is called laticeal point. Let $P_n(n, n + 5)$ be a laticeal point and denote by $f(n)$ the number of laticeal points on the open segment $(OP_n)$, where the point $0(0,0)$ is the coordinates system origine. Calculate the number $f(1) +f(2) + f(3) + ...+ f(2002) + f(2003)$.

An isosceles trapezium is called [i]right[/i] if only one pair of its sides are parallel (i.e parallelograms are not right). A dissection of a rectangle into $n$ (can be different shapes) right isosceles trapeziums is called [i]strict[/i] if the union of any $i,(2\leq i \leq n)$ trapeziums in the dissection do not form a right isosceles trapezium. Prove that for any $n, n\geq 9$ there is a strict dissection of a $2017 \times 2018$ rectangle into $n$ right isosceles trapeziums. [i]Proposed by Bojan Basic[/i]

Determine all pairs of positive integers $(a,b)$ such that the following fraction is an integer: \[\frac{(a+b)^2}{4+4a(a-b)^2}.\]

The sequence $ \{ a_n \} _ { n \ge 0 } $ is defined by $ a_0 = 2 , a_1 = 4 $ and \[ a_{n+1} = \frac{a_n a_{n-1}}{2} + a_n + a_{n-1} \] for all positive integers $ n $. Determine all prime numbers $ p $ for which there exists a positive integer $ m $ such that $ p $ divides the number $ a_m - 1 $.

Let A and B be fixed points in the plane with distance AB = 1. An ant walks on a straight line from point A to some point C in the plane and notices that the distance from itself to B always decreases at any time during this walk. Compute the area of the region in the plane containing all points where point C could possibly be located.

Evaluate $ \int_0^1 \frac{t}{(1\plus{}t^2)(1\plus{}2t\minus{}t^2)}\ dt$.

In $\triangle ABC$ let $I$ be the center of the inscribed circle, and let the bisector of $\angle ACB$ intersect $AB$ at $L$. The line through $C$ and $L$ intersects the circumscribed circle of $\triangle ABC$ at the two points $C$ and $D$. If $LI = 2$ and $LD = 3$, then $IC = \tfrac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p + q$.

Keiko tosses one penny and Ephraim tosses two pennies. The probability that Ephraim gets the same number of heads that Keiko gets is $\text{(A)}\ \dfrac{1}{4} \qquad \text{(B)}\ \dfrac{3}{8} \qquad \text{(C)}\ \dfrac{1}{2} \qquad \text{(D)}\ \dfrac{2}{3} \qquad \text{(E)}\ \dfrac{3}{4}$

In $\Delta ABC$ $(AB>BC)$ $BM$ and $BL$ $(M,L\in AC)$ are a median and an angle bisector respectively. Let the line through $M$, parallel to $AB$, intersect $BL$ in point $D$ and the line through $L$, parallel to $BC$, intersect $BM$ in point $E$. Prove that $DE\perp BL$.

Charlotte writes the integers $1,2,3,\ldots,2025$ on the board. Charlotte has two operations available: the GCD operation and the LCM operation. [list] [*]The GCD operation consists of choosing two integers $a$ and $b$ written on the board, erasing them, and writing the integer $\operatorname{gcd}(a, b)$. [*]The LCM operation consists of choosing two integers $a$ and $b$ written on the board, erasing them, and writing the integer $\operatorname{lcm}(a, b)$. [/list] An integer $N$ is called a [i]winning number[/i] if there exists a sequence of operations such that, at the end, the only integer left on the board is $N$. Find all winning integers among $\{1,2,3,\ldots,2025\}$ and, for each of them, determine the minimum number of GCD operations Charlotte must use. [b]Note:[/b] The number $\operatorname{gcd}(a, b)$ denotes the [i]greatest common divisor[/i] of $a$ and $b$, while the number $\operatorname{lcm}(a, b)$ denotes the [i]least common multiple[/i] of $a$ and $b$.

Give a square of side $1$. Show that for each finite set of points of the sides of the square you can find a vertex of the square with the following property: the arithmetic mean of the squares of the distances from this vertex to the points of the set is greater than or equal to $3/4$.

Find all functions $f(x)$ with the domain of all positive real numbers, such that for any positive numbers $x$ and $y$, we have $f(x^y)=f(x)^{f(y)}$.

Let $ABC$ be a triangle with $AB < BC$, and let $E$ and $F$ be points in $AC$ and $AB$ such that $BF = BC = CE$, both on the same halfplane as $A$ with respect to $BC$. Let $G$ be the intersection of $BE$ and $CF$. Let $H$ be a point in the parallel through $G$ to $AC$ such that $HG = AF$ (with $H$ and $C$ in opposite halfplanes with respect to $BG$). Show that $\angle EHG = \frac{\angle BAC}{2}$.

A given tetrahedron $ ABCD$ is isoceles, that is, $ AB\equal{}CD$, $ AC\equal{}BD$, $ AD\equal{}BC$. Show that the faces of the tetrahedron are acute-angled triangles.

Let $R$ be the rectangle in the Cartesian plane with vertices at $(0,0), (2,0), (2,1),$ and $(0,1)$. $R$ can be divided into two unit squares, as shown; the resulting figure has seven edges. [asy] size(3cm); draw((0,0)--(2,0)--(2,1)--(0,1)--cycle); draw((1,0)--(1,1)); [/asy] Compute the number of ways to choose one or more of the seven edges such that the resulting figure is traceable without lifting a pencil. (Rotations and reflections are considered distinct.)

The product $$\frac12 \cdot \frac24 \cdot \frac38 \cdot \frac{4}{16} \cdot ... \cdot \frac{99}{2^{99}} \cdot \frac{100}{2^{100}}$$ is written in its most simplified form. What is the last digit of the denominator?

Define a sequence by $a_1=1,a_2=\frac12$, and $a_{n+2}=a_{n+1}-\frac{a_na_{n+1}}2$ for $n$ a positive integer. Find $\lim_{n\to\infty}na_n$.

In the coordinate plane, a closed lattice loop of length $2n$ is a sequence of lattice points $P_0, P_1, P_2, \ldots, \ldots, P_{2n}$ such that $P_0$ and $P_{2n}$ are both the origin and $P_{i}P_{i+1}=1$ for each $i.$ A closed lattice loop of length $2026$ is chosen uniformly at random from all such loops. Let $k$ be the maximum integer such that the line $\ell$ with equation $x+y=k$ passes through at least one point of the loop. Compute the expected number of indices $i$ such that $0 \le i \le 2025$ and $P_i$ lies on $\ell.$ (A lattice point is a point with integer coordinates.)

Find all pairs of positive integers $(m,n)$ such that one can partition a $m\times n$ board with $1\times 2$ or $2\times 1$ dominoes and draw one of the diagonals on each of the dominos so that none of the diagonals share endpoints.

Prove for any $M>2$, there exists an increasing sequence of positive integers $a_1<a_2<\ldots $ satisfying: 1) $a_i>M^i$ for any $i$; 2) There exists a positive integer $m$ and $b_1,b_2,\ldots ,b_m\in\left\{ -1,1\right\}$, satisfying $n=a_1b_1+a_2b_2+\ldots +a_mb_m$ if and only if $n\in\mathbb{Z}/ \{0\}$.

With the medians of an acute-angled triangle another triangle is constructed. If $R$ and $R_m$ are the radii of the circles circumscribed about the first and the second triangle, respectively, prove that \[R_m>\frac{5}{6}R\]

Let $S(n)$ equal the sum of the digits of positive integer $n$. For example, $S(1507) = 13$. For a particular positive integer $n$, $S(n) = 1274$. Which of the following could be the value of $S(n+1)$? $\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 1239\qquad\textbf{(E)}\ 1265$

Prove that any function that maps the integers to themselves is a sum of any finite number of injective functions that map the integers to themselves. [i]Sorin Rădulescu[/i] and [i]Ion Savu[/i]

Points $X$ and $Y$ on the unit circle centered at $O = (0,0)$ are at $(-1,0)$ and $(0,-1)$ respectively. Points $P$ and $Q$ are on the unit circle such that $\angle P XO = \angle QY O = 30^o$. Let $Z$ be the intersection of line $X P$ and line $Y Q$. The area bounded by segment $Z P$, segment $ZQ$, and arc $PQ$ can be expressed as $a\pi -b$ where $a$ and $b$ are rational numbers. Find $\frac{1}{ab}$ .