For each positive integer $k,$ let $A(k)$ be the number of odd divisors of $k$ in the interval $\left[1,\sqrt{2k}\right).$ Evaluate: \[\sum_{k=1}^{\infty}(-1)^{k-1}\frac{A(k)}k.\]

MO Space City plans to construct $n$ space stations, with a unidirectional pipeline connecting every pair of stations. A station directly reachable from station P without passing through any other station is called a directly reachable station of P. The number of stations jointly directly reachable by the station pair $\{P, Q\}$ is to be examined. The plan requires that all station pairs have the same number of jointly directly reachable stations. (1) Calculate the number of unidirectional cyclic triangles in the space city constructed according to this requirement. (If there are unidirectional pipelines among three space stations A, B, C forming $A \rightarrow B \rightarrow C \rightarrow A$, then triangle ABC is called a unidirectional cyclic triangle.) (2) Can a space city with $n$ stations meeting the above planning requirements be constructed for infinitely many integers $n \geq 3$?

Let $A$ be Abelian group of order $p^4$, where $p$ is a prime number, and which has a subgroup $N$ with order $p$ such that $A/N\approx\mathbb{Z}/p^3\mathbb{Z}$. Find all $A$ expect isomorphic.

Evaluate $ \int_0^{\frac{\pi}{4}} \frac{\sin ^ 2 x}{\cos ^ 3 x}\ dx$.

Find the value of $\frac{\log_59\log_75\log_37}{\log_2\sqrt{6}}+\frac{1}{\log_9\sqrt{6}}$ $ \textbf{(A) }2\qquad\textbf{(B) }3\qquad\textbf{(C) }4\qquad\textbf{(D) }6\qquad\textbf{(E) }7 $

On the equal $ AC $ and $ BC $ of an isosceles right triangle $ ABC $ , points $ D $ and $ E $ are marked respectively, so that $ CD = CE $. Perpendiculars on the straight line $ AE $, passing through the points $ C $ and $ D $, intersect the side $ AB $ at the points $ P $ and $ Q $.Prove that $ BP = PQ $.

On a table, we have ten thousand matches, two of which are inside a bowl. Anna and Bernd play the following game: They alternate taking turns and Anna begins. A turn consists of counting the matches in the bowl, choosing a proper divisor $d$ of this number and adding $d$ matches to the bowl. The game ends when more than $2024$ matches are in the bowl. The person who played the last turn wins. Prove that Anna can win independently of how Bernd plays. [i](Richard Henner)[/i]

For integers $a$, $b$, $c$, and $d$, let $f(x) = x^2 + ax + b$ and $g(x) = x^2 + cx + d$. Find the number of ordered triples $(a,b,c)$ of integers with absolute values not exceeding $10$ for which there is an integer $d$ such that $g(f(2)) = g(f(4)) = 0$.

Two obvious approximations to the length of the perimeter of the ellipse with semi-axes $a$ and $b$ are $\pi (a + b)$ and $2 \pi (ab)^{1/2}.$ Which one comes nearer the truth when the ratio $b/a$ is very close to $1?$

An angle with vertex $O$ and a point $A$ inside it are placed on a plane. Points $M$ and $N$ are chosen on different sides of the angle so that the angles $CAM$ and $CAN$ are equal. Prove that the straight line $MN$ always passes through a fixed point (or is always parallel to a fixed line). (S Tokarev)

How many integers between $2$ and $100$ have only odd numbers in their prime factorizations?

Let $p$ be a prime and $n$ a positive integer below $100$. What’s the probability that $p$ divides $n$?

Solve \[\left\{ \begin{array}{l} y(x+y)^2 = 9 \\ y(x^3-y^3) = 7 \\ \end{array} \right. \]

Determine all non-negative real numbers $a$, for which $f(a)=0$ for all functions $f: \mathbb{R}_{\ge 0}\to \mathbb{R}_{\ge 0} $, who satisfy the equation $f(f(x) + f(y)) = yf(1 + yf(x))$ for all non-negative real numbers $x$ and $y$.

One convex quadrilateral is inside another. Can it turn out that the sum of the lengths of the diagonals of the outer quadrilateral is less than the sum of the lengths of the diagonals of the inner?

Prove that there exist infinitely many positive integers that can't be represented in form $a^{bc} - b^{ad}$, where $a, b, c, d$ are positive integers and $a, b>1$. [i]Proposed by Anton Trygub, Oleksii Masalitin[/i]

Given an integer $m\ge 2$, find the smallest integer $k > m$ such that for any partition of the set $\{m,m + 1,..,k\}$ into two classes $A$ and $B$ at least one of the classes contains three numbers $a,b,c$ (not necessarily distinct) such that $a^b = c$.

Let $a,b,c,m$ be integers, where $m>1$. Prove that if $$a^n+bn+c\equiv0\pmod m$$for each natural number $n$, then $b^2\equiv0\pmod m$. Must $b\equiv0\pmod m$ also hold?

Let $ABCD$ be a quadrilateral with $AC = BD$. Diagonals $AC$ and $BD$ meet at $P$. Let $\omega_1$ and $O_1$ denote the circumcircle and the circumcenter of triangle $ABP$. Let $\omega_2$ and $O_2$ denote the circumcircle and circumcenter of triangle $CDP$. Segment $BC$ meets $\omega_1$ and $\omega_2$ again at $S$ and $T$ (other than $B$ and $C$), respectively. Let $M$ and $N$ be the midpoints of minor arcs $\widehat {SP}$ (not including $B$) and $\widehat {TP}$ (not including $C$). Prove that $MN \parallel O_1O_2$.

Let $ABC$ be an equilateral triangle of side length $6$. Points $D, E$ and $F$ are on sides $AB$, $BC$, and $AC$ respectively such that $AD = BE = CF = 2$. Let circle $O$ be the circumcircle of $DEF$, that is, the circle that passes through points $D, E$, and $F$. What is the area of the region inside triangle $ABC$ but outside circle $O$?

Let $n$ a natural number and $A=\{1, 2, 3, \cdots, 2^{n+1}-1\}$. Prove that if we choose $2n+1$ elements differents of the set $A$, then among them are three distinct number $a,b$ and $c$ such that $$bc<2a^2<4bc$$

Determine all positive integers $n{}$ and $m{}$ such that $m^n=n^{3m}$. [i]Proposed by I. Dorofeev[/i]

Consider the Harmonic Table \[\begin{array}{c@{\hspace{15pt}}c@{\hspace{15pt}}c@{\hspace{15pt}}c@{\hspace{15pt}}c@{\hspace{15pt}}c@{\hspace{15pt}}c}&&&1&&&\\&&\tfrac12&&\tfrac12&&\\&\tfrac13&&\tfrac16&&\tfrac13&\\\tfrac14&&\tfrac1{12}&&\tfrac1{12}&&\tfrac14\\&&&\vdots&&&\end{array}\] where $a_{n,1}=1/n$ and \[a_{n,k+1}=a_{n-1,k}-a_{n,k}.\] Find the remainder when the sum of the reciprocals of the $2007$ terms on the $2007^\text{th}$ row gets divided by $2008$.

Determine if there exists a strictly increasing sequence of positive integers $a_1$, $a_2$, ... such that $a_n \le n^3$ for every positive integer $n$ and that every positive integer can be written uniquely as the difference of two terms in the sequence.

Which of the following choices is an even number? $\textbf{(A) }2 \cdot 0 + 2 - 1\qquad\textbf{(B) }20 + 21\qquad\textbf{(C) }2^0 - 2 + 1\qquad\textbf{(D) }2 - 0 \cdot 2 + 1\qquad\textbf{(E) }2 \cdot 0 + 2 + 1$