Find the largest positive integer $n$ such that $\sigma(n) = 28$, where $\sigma(n)$ is the sum of the divisors of $n$, including $n$.

A magic square is a square with side 3 consisting of 9 unit squares, such that the numbers written in the unit squares (one number in each square) satisfy the following property: the sum of the numbers in each row is equal to the sum of the numbers in each column and is equal to the sum of all the numbers written in any of the two diagonals. A rectangle with sides $m\ge3$ and $n\ge3$ consists of $mn$ unit squares. If in each of those unit squares exactly one number is written, such that any square with side $3$ is a magic square, then find the number of most different numbers that can be written in that rectangle.

Given a natural number $k>1$. Find the smallest number $\alpha$ satisfying the following condition. Suppose that the table $(2k + 1) \times (2k + 1)$ is filled with real numbers not exceeding $1$ in absolute value, and the sums of the numbers in all lines are equal to zero. Then you can rearrange the numbers so that each number remains in its row and all the sums over the columns will be at most $\alpha$.

Oliver is at a carnival. He is offered to play a game where he rolls a fair dice and receives $\$1$ if his roll is a $1$ or $2$, receives $\$2$ if his roll is a $3$ or $4$, and receives $\$3$ if his roll is a $5$ or $6$. Oliver plays the game repeatedly until he has received a total of at least $\$2$. What is the probability that he ends with $\$3$?

Find the volume of the solid of the domain expressed by the inequality $x^2-x\leq y\leq x$, generated by a rotation about the line $y=x.$

The coefficients $a,b,c$ of a polynomial $f:\mathbb{R}\to\mathbb{R}, f(x)=x^3+ax^2+bx+c$ are mutually distinct integers and different from zero. Furthermore, $f(a)=a^3$ and $f(b)=b^3.$ Determine $a,b$ and $c$.

Two toads named Gamakichi and Gamatatsu are sitting at the points $(0,0)$ and $(2,0)$ respectively. Their goal is to reach $(5,5)$ and $(7,5)$ respectively by making one unit jumps in positive $x$ or $y$ direction at a time. How many ways can they do this while ensuring that there is no point on the plane where both Gamakichi And Gamatatsu land on?

Assume $n$ is a positive integer and integer $a$ is the root of the equation $$x^4+3ax^2+2ax-2\times 3^n=0.$$ Find all $n$ and $ a$ that satisfy the conditions.

We are given 5040 balls in k different colors, where the number of balls of each color is the same. The balls are put into 2520 bags so that each bag contains two balls of different colors. Find the smallest k such that, however the balls are distributed into the bags, we can arrange the bags around a circle so that no two balls of the same color are in two neighboring bags.

Three segments $2$ cm, $5$ cm and $12$ cm long are constructed on the plane. Construct a trapezoid with bases of $2$ cm and $5$ cm, the sum of the sides of which is $12$ cm, and one of the angles is $60^o$. (Bogdan Rublev)

The square table $ 10\times 10$ is divided in squares $ 1\times1$. In each square $ 1\times1$ is written one of the numers $ \{1,2,3,...,9,10\}$. Numbers from any two adjacent or diagonally adjacent squares are reciprocal prime. Prove, that there exists a number, which is written in this table at least 17 times.

The value of $\left(256\right)^{.16}\left(256\right)^{.09}$ is: $ \textbf{(A)}\ 4 \qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 64\qquad\textbf{(D)}\ 256.25\qquad\textbf{(E)}\ -16$

Let $S$ be a finite set of positive integers. Assume that there are precisely 2023 ordered pairs $(x,y)$ in $S\times S$ so that the product $xy$ is a perfect square. Prove that one can find at least four distinct elements in $S$ so that none of their pairwise products is a perfect square. [i]Note:[/i] As an example, if $S=\{1,2,4\}$, there are exactly five such ordered pairs: $(1,1)$, $(1,4)$, $(2,2)$, $(4,1)$, and $(4,4)$. [i]Proposed by Sutanay Bhattacharya[/i]

Let $a_1$, $a_2$, $a_3$, $a_4$, $a_5$ be real numbers whose sum is $20$. Determine with proof the smallest possible value of \[ \displaystyle\sum_{1\le i \le j \le 5} \lfloor a_i + a_j \rfloor. \]

A set of numbers $a_1, a_2 , . . . , a_{100}$ is obtained by rearranging the numbers $1 , 2,..., 100$ . Form the numbers $b_1=a_1$ $b_2= a_1 + a_2$ $b_3=a_1 + a_2 + a_3$ ... $b_{100}=a_1 + a_2 + ...+a_{100}$ Prove that among the remainders on dividing the numbers by $100 , 11$ of them are different . ( L . D . Kurlyandchik , Leningrad)

Let $x$ be an irrational number between 0 and 1 and $x = 0.a_1a_2a_3\cdots$ its decimal representation. For each $k \ge 1$, let $p(k)$ denote the number of distinct sequences $a_{j+1} a_{j+2} \cdots a_{j+k}$ of $k$ consecutive digits in the decimal representation of $x$. Prove that $p(k) \ge k+1$ for every positive integer $k$.

Let $a_k$ be the number of ordered $10$-tuples $(x_1, x_2, ..., x_{10})$ of nonnegative integers such that $$x^2_1+ x^2_2+ ... + x^2_{10} = k.$$ Let $b_k = 0$ if $a_k$ is even and $b_k = 1$ if $a_k$ is odd. Find $\sum^{2012}_{i=1} b_{4i}$.

Find the maximum value of \[ \sin{2\alpha} + \sin{2\beta} + \sin{2\gamma} \] where $\alpha,\beta$ and $\gamma$ are positive and $\alpha + \beta + \gamma = 180^{\circ}$.

One of the boxes that Joshua and Wendy unpack has Joshua's collection of board games. Michael, Wendy, Alexis, and Joshua decide to play one of them, a game called $\textit{Risk}$ that involves rolling ordinary six-sided dice to determine the outcomes of strategic battles. Wendy has never played before, so early on Michael explains a bit of strategy. "You have the first move and you occupy three of the four territories in the Australian continent. You'll want to attack Joshua in Indonesia so that you can claim the Australian continent which will give you bonus armies on your next turn." "Don't tell her $\textit{that!}$" complains Joshua. Wendy and Joshua begin rolling dice to determine the outcome of their struggle over Indonesia. Joshua rolls extremely well, overcoming longshot odds to hold off Wendy's attack. Finally, Wendy is left with one chance. Wendy and Joshua each roll just one six-sided die. Wendy wins if her roll is $\textit{higher}$ than Joshua's roll. Let $a$ and $b$ be relatively prime positive integers so that $a/b$ is the probability that Wendy rolls higher, giving her control over the continent of Australia. Find the value of $a+b$.

Consider the set $M=\{1,2,...,n\},n\in\mathbb N$. Find the smallest positive integer $k$ with the following property: In every $k$-element subset $S$ of $M$ there exist two elements, one of which divides the other one.

Determine all positive integers $n>1$ such that for any divisor $d$ of $n,$ the numbers $d^2-d+1$ and $d^2+d+1$ are prime. [i]Lucian Petrescu[/i]

It is known that in the triangle $ABC$ the smallest side is $BC$. Let $X, Y, K$ and $L$ - points on the sides $AB, AC$ and on the rays $CB, BC$, respectively, are such that $BX = BK = BC =CY =CL$. The line $KX$ intersects the line $LY$ at the point $M$. Prove that the intersection point of the medians $\vartriangle KLM$ coincides with the center of the inscribed circle $\vartriangle ABC$.

Given triangle $ABC$ and point $P$. Points $A', B', C'$ are the projections of $P$ to $BC, CA, AB$. A line passing through $P$ and parallel to $AB$ meets the circumcircle of triangle $PA'B'$ for the second time in point $C_{1}$. Points $A_{1}, B_{1}$ are defined similarly. Prove that a) lines $AA_{1}, BB_{1}, CC_{1}$ concur; b) triangles $ABC$ and $A_{1}B_{1}C_{1}$ are similar.

In triangle $ABC$, we consider the concurrent lines $AA_1$, $BB_1$ and $CC_1$, with $A_1$, $B_1$ and $C_1$ lying on the segments $BC$, $CA$ and respectively $AB$. If the point of intersection of the lines is the incenter of $\triangle A_1B_1C_1$, prove that it is also the orthocenter of $\triangle ABC$.

Compute the number of permutations $(a,b,c,x,y,z)$ of $(1,2,3,4,5,6)$ which satisfy the five inequalities \[ a < b < c, \quad x < y < z, \quad a < x, \quad b < y, \quad\text{and}\quad c < z. \] [i]Proposed by Evan Chen[/i]