Given are the odd integers $m> 1$, $k$, and a prime $p$ such that $p> mk +1$. Prove that $p^{2}\mid {\binom{k}{k}}^{m}+{\binom{k+1}{k}}^{m}+\cdots+{\binom{p-1}{k}}^{m}$.

$f: (0,1) \rightarrow [0, \infty)$ is zero except at a countable set of points $a_{1}, a_2, a_3, ... $ . Let $b_n = f(a_n)$. Show that if $\sum b_{n}$ converges, then $f$ is differentiable at at least one point. Show that for any sequence $b_{n}$ of non-negative reals with $\sum b_{n} =\infty$ , we can find a sequence $a_{n}$ such that the function $f$ defined as above is nowhere differentiable.

How many (nondegenerate) tetrahedrons can be formed from the vertices of an $n$-dimensional hypercube?

Isosceles triangles $A_3A_1O_2$ and $A_1A_2O_3$ are constructed on the sides of a triangle $A_1A_2A_3$ as the bases, outside the triangle. Let $O_1$ be a point outside $\Delta A_1A_2A_3$ such that $\angle O_1A_3A_2 =\frac 12\angle A_1O_3A_2$ and $\angle O_1A_2A_3 =\frac 12\angle A_1O_2A_3$. Prove that $A_1O_1\perp O_2O_3$, and if $T$ is the projection of $O_1$ onto $A_2A_3$, then $\frac{A_1O_1}{O_2O_3} = 2\frac{O_1T}{A_2A_3}$.

What is the maximum distance between the particle and the origin? (A) $\text{2.00 m}$ (B) $\text{2.50 m}$ (C) $\text{3.50 m}$ (D) $\text{5.00 m}$ (E) $\text{7.00 m}$

There are $68$ coins , each coin having a different weight than that of each other . Show how to find the heaviest and lightest coin in $100$ weighings on a balance beam. (S. Fomin, Leningrad)

Let $\triangle ABC$ be an arbitary triangle, and construct $P,Q,R$ so that each of the angles marked is $30^\circ$. Prove that $\triangle PQR$ is an equilateral triangle. [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair ext30(pair pt1, pair pt2) { pair r1 = pt1+rotate(-30)*(pt2-pt1), r2 = pt2+rotate(30)*(pt1-pt2); draw(anglemark(r1,pt1,pt2,25)); draw(anglemark(pt1,pt2,r2,25)); return intersectionpoints(pt1--r1, pt2--r2)[0]; } pair A = (0,0), B=(10,0), C=(3,7), P=ext30(B,C), Q=ext30(C,A), R=ext30(A,B); draw(A--B--C--A--R--B--P--C--Q--A); draw(P--Q--R--cycle, linetype("8 8")); label("$A$", A, SW); label("$B$", B, SE); label("$C$", C, N); label("$P$", P, NE); label("$Q$", Q, NW); label("$R$", R, S);[/asy]

3. Six points A, B, C, D, E, F are connected with segments length of $1$. Each segment is painted red or black probability of $\frac{1}{2}$ independence. When point A to Point E exist through segments painted red, let $X$ be. Let $X=0$ be non-exist it. Then, for $n=0,2,4$, find the probability of $X=n$.

Let $ABC$ be an acute triangle with incircle $\omega$, incenter $I$, and $A$-excircle $\omega_{a}$. Let $\omega$ and $\omega_{a}$ meet $BC$ at $X$ and $Y$, respectively. Let $Z$ be the intersection point of $AY$ and $\omega$ which is closer to $A$. The point $H$ is the foot of the altitude from $A$. Show that $HZ$, $IY$ and $AX$ are concurrent. [i]Proposed by Nikola Velov[/i]

Given that $5r+4s+3t+6u =100$, where $r\ge s\ge t\ge u\ge 0.$ are real numbers, find, with proof, the maximum and minimum possible values of $r+s+t+u$.

Joe finally asked Kathryn out. They go out on a date on a Friday night, racing at the local go-kart track. They take turns racing across an $8 \times 8$ square grid composed of $64$ unit squares. If Joe and Kathryn start in the lower left-hand corner of the $8\times 8$ square, and can move either up or right along any side of any unit square, what is the probability that Joe and Kathryn take the same exact path to reach the upper right-hand corner of the $8\times 8$ square grid?

Define $\phi^!(n)$ as the product of all positive integers less than or equal to $n$ and relatively prime to $n$. Compute the remainder when \[ \sum_{\substack{2 \le n \le 50 \\ \gcd(n,50)=1}} \phi^!(n) \] is divided by $50$.

The positive integers $ \alpha, \beta, \gamma$ are the roots of a polynomial $ f(x)$ with degree $ 4$ and the coefficient of the first term is $ 1$. If there exists an integer such that $ f(\minus{}1)\equal{}f^2(s)$. Prove that $ \alpha\beta$ is not a perfect square.

Let $n > 2$ be an integer and let $m = \sum k^3$, where the sum is taken over all integers $k$ with $1 \leq k < n$ that are relatively prime to $n$. Prove that $n$ divides $m$.

Cut the $10$ cm $x 20$ cm rectangle into two pieces with one straight cut so that they can be placed inside the $19.4$ cm diameter circle without intersecting.

Let $x,y,z$ be positive real numbers with $x+y+z \ge 3$. Prove that $\frac{1}{x+y+z^2} + \frac{1}{y+z+x^2} + \frac{1}{z+x+y^2} \le 1$ When does equality hold? (Karl Czakler)

What is the largest integer $n$ for which $\frac{2008!}{31^n}$ is an integer?

A sample consisting of five observations has an arithmetic mean of $10$ and a median of $12$. The smallest value that the range (largest observation minus smallest) can assume for such a sample is $ \textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 10 $

At first all $2^n$ rows of a $2^n \times n$ table were filled with all different $n$-tuples of numbers $+1$ and $-1$. Then some of the numbers were replaced by Os. Prove that one can choose a (non-empty) set of rows such that: (a) the sum of all the numbers in all the chosen rows is $0$; (b) the sum of all the chosen rows equals the zero row, that is, the sum of numbers in each column of the chosen rows equals $0$. (G Kondakov, V Chernorutskii)

Let $c_n$ be the first digit of $2^n$ (in decimal representation). Prove that the number of different $13$-tuples $< c_k$,$...$, $c_{k+12}>$ is equal to $57$. (AY Belov,)

Let $ABC$ be a triangle such that $AB=2$, $CA=3$, and $BC=4$. A semicircle with its diameter on $BC$ is tangent to $AB$ and $AC$. Compute the area of the semicircle.

The sequence $\{a_n\}_{n\ge 1}$ of real numbers is defined as follows: $$a_1=1, \quad \text{and}\quad a_{n+1}=\frac{1}{2\lfloor a_n \rfloor -a_n+1} \quad \text{for all} \quad n\ge 1$$ Find $a_{2024}$.

Suppose that a professor has $n \ge 4$ students. Let $P$ denote the set of all ordered pairs $(n, k)$ such that the number of ways for the professor to choose one pair of students equals the number of ways for the professor to choose $k > 1$ pairs of students. For each such ordered pair $(n, k) \in P$, consider the sum $n+k=s$. Find the sum of all $s$ over all ordered pairs $(n, k)$ in $P$. [i]If the same value of $s$ appears in multiple distinct elements $(n, k)$ in $P$, count this value multiple times.[/i]

Define the sequence of integers $a_1, a_2, a_3, \ldots$ by $a_1 = 1$, and \[ a_{n+1} = \left(n+1-\gcd(a_n,n) \right) \times a_n \] for all integers $n \ge 1$. Prove that $\frac{a_{n+1}}{a_n}=n$ if and only if $n$ is prime or $n=1$. [i]Here $\gcd(s,t)$ denotes the greatest common divisor of $s$ and $t$.[/i]

2. Prove that for any $2\le n \in \mathbb{N}$ there exists positive integers $a_1,a_2,\cdots,a_n$ such that $\forall i\neq j: \text{gcd}(a_i,a_j) = 1$ and $\forall i: a_i \ge 1402$ and the given relation holds. $$[\frac{a_1}{a_2}]+[\frac{a_2}{a_3}]+\cdots+[\frac{a_n}{a_1}] = [\frac{a_2}{a_1}]+[\frac{a_3}{a_2}]+\cdots+[\frac{a_1}{a_n}]$$