We say that distinct positive integers $n, m$ are $friends$ if $\vert n-m \vert$ is a divisor of both ${}n$ and $m$. Prove that, for any positive integer $k{}$, there exist $k{}$ distinct positive integers such that any two of these integers are friends.

Define $a*b=\frac{a-b}{1-ab}$. What is $(1*(2*(3*\cdots (n*(n+1))\cdots )))$?

Prove that in every convex hexagon of area $S$ one can draw a diagonal that cuts off a triangle of area not exceeding $\frac{1}{6}S.$

Let $a$, $b$, $c$ be positive reals such that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}=1$. Show that $$a^abc+b^bca+c^cab\ge 27bc+27ca+27ab.$$ [i]Proposed by Milan Haiman[/i]

Let $a$ and $b$ be coprime integers, greater than or equal to $1$. Prove that all integers $n$ greater than or equal to $(a - 1)(b - 1)$ can be written in the form: \[n = ua + vb, \qquad \text{with} (u, v) \in \mathbb N \times \mathbb N.\]

Mr. Jones has eight children of different ages. On a family trip his oldest child, who is 9, spots a license plate with a 4-digit number in which each of two digits appears two times. "Look, daddy!" she exclaims. "That number is evenly divisible by the age of each of us kids!" "That's right," replies Mr. Jones, "and the last two digits just happen to be my age." Which of the following is not the age of one of Mr. Jones's children? $ \textbf{(A) } 4 \qquad \textbf{(B) } 5 \qquad \textbf{(C) } 6 \qquad \textbf{(D) } 7 \qquad \textbf{(E) } 8$

Let $\mathbb{Z}$ be the set of integers. Determine all functions $f: \mathbb{Z} \rightarrow \mathbb{Z}$ such that, for all integers $a$ and $b$, $$f(2a)+2f(b)=f(f(a+b)).$$ [i]Proposed by Liam Baker, South Africa[/i]

Prove that there exists a natural number $b$ such that for any natural $n>b$ the sum of the digits of $n!$ is not less than $10^{100}$. [i]Proposed by D. Khramtsov[/i]

We are given an arbitrary $\bigtriangleup ABC$. a) Can we dissect $\bigtriangleup ABC$ in $4$ pieces, from which we can make two triangle similar to $\bigtriangleup ABC$ (each piece can be used only once)? Justify your answer! b) Is it possible that for every positive integer $n \ge 2$ , we are able to dissect $\bigtriangleup ABC$ in $2n$ pieces, from which we can make two triangles similar to $\bigtriangleup ABC$ (each piece can be used only once)? Justify your answer!

Jane has two bags $X$ and $Y$. Bag $X$ contains 4 red marbles and 5 blue marbles (and nothing else). Bag $Y$ contains 7 red marbles and 6 blue marbles (and nothing else). Jane will choose one of her bags at random (each bag being equally likely). From her chosen bag, she will then select one of the marbles at random (each marble in that bag being equally likely). What is the probability that she will select a red marble?

Let $a$, $b$ and $c$ be real numbers larger than $1$. Prove the inequality $$\frac{ab}{c-1}+\frac{bc}{a - 1}+\frac{ca}{b -1} \ge 12.$$ When does equality hold? [i](Karl Czakler)[/i]

Prove that: $\int_{-1}^1f^2(x)dx\ge \frac 1 2 (\int_{-1}^1f(x)dx)^2 +\frac 3 2(\int_{-1}^1xf(x)dx)^2$ Please give a proof without using even and odd functions. (the oficial proof uses those and seems to be un-natural) :D

A positive integer $n$ satisfies the equation $(n+1)! + (n+2)! = n! \cdot 440$. What is the sum of the digits of $n$? $\textbf{(A) }2\qquad\textbf{(B) }5\qquad\textbf{(C) }10\qquad\textbf{(D) }12\qquad\textbf{(E) }15$

A positive integer $b\geq 2$ is [i]neat[/i] if and only if there exist positive base-$b$ digits $x$ and $y$ (that is, $x$ and $y$ are integers, $0<x<b$ and $0<y<b$) such that the number $x.y$ base $b$ (that is, $x+\tfrac yb$) is an integer multiple of $x/y$. Find the number of [i]neat[/i] integers less than or equal to $100$.

Let $P$ be a point inside a triangle $ABC$ with $\angle C = 90^o$ such that $AP = AC$, and let $M$ be the midpoint of $AB$ and $CH$ be the altitude. Prove that $PM$ bisects $\angle BPH$ if and only if $\angle A = 60^o$.

Let $n \geqslant 3$ be a positive integer and let $\left(a_{1}, a_{2}, \ldots, a_{n}\right)$ be a strictly increasing sequence of $n$ positive real numbers with sum equal to 2. Let $X$ be a subset of $\{1,2, \ldots, n\}$ such that the value of \[ \left|1-\sum_{i \in X} a_{i}\right| \] is minimised. Prove that there exists a strictly increasing sequence of $n$ positive real numbers $\left(b_{1}, b_{2}, \ldots, b_{n}\right)$ with sum equal to 2 such that \[ \sum_{i \in X} b_{i}=1. \]

In a right triangle $ABC$, the lengths of the legs satisfy the condition: $BC =\sqrt2 AC$. Prove that the medians $AN$ and $CM$ are perpendicular. (Hilko Danilo)

Alice has an integer $N > 1$ on the blackboard. Each minute, she deletes the current number $x$ on the blackboard and writes $2x+1$ if $x$ is not the cube of an integer, or the cube root of $x$ otherwise. Prove that at some point of time, she writes a number larger than $10^{100}$. [i]Proposed by Anant Mudgal and Rohan Goyal[/i]

In the triangle $ABC$, the circle with the center at the point $O$ touches the pages $AB, BC$ and $CA$ in the points $C_1, A_1$ and $B_1$, respectively. Lines $AO, BO$ and $CO$ cut the inscribed circle at points $A_2, B_2$ and $C_2,$ respectively. Prove that it is the area of the triangle $A_2B_2C_2$ is double from the surface of the hexagon $B_1A_2C_1B_2A_1C_2$. (Moldova)

A mass $m$ is resting at equilibrium suspended from a vertical spring of natural length $L$ and spring constant $k$ inside a box as shown: [asy] //The Spring import graph; size(10cm); guide coil(path g, real width=0.1, real margin = 1*width) { real L = arclength(g); real r = width / 2; pair startpoint = arcpoint(g, margin); real[][] isectiontimes = intersections(g, circle(c=startpoint,r=r)); real initialcirclecentertime = (isectiontimes.length == 1 ? isectiontimes[0][0] : isectiontimes[1][0]); pair startdir = dir(startpoint - point(g,initialcirclecentertime)); real startangle = atan2(startdir.y, startdir.x); real startarctime = arclength(subpath(g, 0, initialcirclecentertime)); write(startarctime); pair endpoint = arcpoint(g, L - margin); real finalcirclecentertime = intersections(g, circle(c=endpoint,r=r))[0][0]; pair enddir = dir(endpoint - point(g,finalcirclecentertime)); real endangle = atan2(enddir.y, enddir.x); real endarctime = arclength(subpath(g, 0, finalcirclecentertime)); write(endarctime); real coillength = 2r; real lengthalongcoils = L - 2*margin; int numcoils = ceil(lengthalongcoils / coillength); real anglesubtended = 2pi * numcoils - startangle + endangle; real angleat(real arctime) { return (arctime - startarctime) * (anglesubtended / (endarctime - startarctime)) + startangle; } pair f(real t) { return arcpoint(g,t) + r * expi(angleat(t)); } return subpath(g, 0, arctime(g, margin)) & graph(f, startarctime, endarctime, n=max(length(g), 20*numcoils+2), operator..) & subpath(g, arctime(g, L-margin), length(g)); } draw(coil((0,0.25)--(0,1))); //Outer Box draw((-1,1)--(1,1),linewidth(2)); draw((-1,1)--(-1,-1.2),linewidth(2)); draw((-1,-1.2)--(1,-1.2),linewidth(2)); draw((1,1)--(1,-1.2),linewidth(2)); //Inner Box draw((-0.2,0.25)--(0.2,0.25),linewidth(2)); path arc1=arc((-0.2,0.15),(-0.2,0.25),(-0.3,0.15)); path arc2=arc((0.2,0.15),(0.3,0.15),(0.2,0.25)); draw(arc1,linewidth(2)); draw(arc2,linewidth(2)); draw((-0.3,0.15)--(-0.3,-0.3),linewidth(2)); draw((0.3,0.15)--(0.3,-0.3),linewidth(2)); path arc3=arc((-0.2,-0.3),(-0.3,-0.3),(-0.2,-0.4)); draw(arc3,linewidth(2)); path arc4=arc((0.2,-0.3),(0.2,-0.4),(0.3,-0.3)); draw((-0.2,-0.4)--(0.2,-0.4),linewidth(2)); draw(arc4,linewidth(2)); [/asy] The box begins accelerating upward with acceleration $a$. How much closer does the equilibrium position of the mass move to the bottom of the box? (a) $(a/g)L$ (b) $(g/a)L$ (c) $m(g + a)/k$ (d) $m(g - a)/k$ (e) $ma/k$

Let $ p(x) $ be a quadratic polynomial for which : \[ |p(x)| \leq 1 \qquad \forall x \in \{-1,0,1\} \] Prove that: \[ \ |p(x)|\leq\frac{5}{4} \qquad \forall x \in [-1,1]\]

Let $f$ be a function that associates a positive integer $(x, y)$ with each pair of positive integers $f(x, y)$. Suppose that $f(x, y) \le xy$ for all positive integers $x$, $y$. Show that there are $2023$ different pairs $(x_1, y_1)$,$...$, $ (x_{2023}, y_{2023}$) such that $$f(x_1, y_1) = f(x_2, y_2) = ....= f(x_{2023}, y_{2023}).$$

A [i]domino[/i] is a $2 \times 1$ or $1 \times 2$ tile. Determine in how many ways exactly $n^2$ dominoes can be placed without overlapping on a $2n \times 2n$ chessboard so that every $2 \times 2$ square contains at least two uncovered unit squares which lie in the same row or column.

Let $L_1$ and $L_2$ be distinct lines in the plane. Prove that $L_1$ and $L_2$ intersect if and only if, for every real number $\lambda\ne 0$ and every point $P$ not on $L_1$ or $L_2,$ there exist points $A_1$ on $L_1$ and $A_2$ on $L_2$ such that $\overrightarrow{PA_2}=\lambda\overrightarrow{PA_1}.$

A sequence of integers $a_0,\ a_1,\dots a_n \dots $ is defined by the following rules: $a_0=0,\ a_1=1,\ a_{n+1} > a_n$ for each $n\in \mathbb{N}$, and $a_{n+1}$ is the minimum number such that no three numbers among $a_0,\ a_1,\dots a_{n+1}$ form an arithmetical progression. Prove that $a_{2^n}=3^n$ for each $n \in \mathbb{N}.$