The SMO camp has at least four leaders. Any two leaders are either mutual friends or enemies. In every group of four leaders there is at least one who is with the three is friends with others. Is there always one leader who is friends with everyone else?

There are n boys and m girls at Daehan Mathematical High School. Let $d(B)$ a number of girls who know Boy $B$ each other, and let $d(G)$ a number of boys who know Girl $G$ each other. Each girl knows at least one boy each other. Prove that there exist Boy $B$ and Girl $G$ who knows each other in condition that $\frac{d(B)}{d(G)}\ge\frac{m}{n}$.

Find all primes $p$ and $q$ such that $(p+q)^p = (q-p)^{(2q-1)}$

Let $a_1, a_2, a_3, a_4, a_5$ be non-negative real numbers satisfied \[\sum_{k = 1}^{5} a_k = 20 \ \ \ \ \text{and} \ \ \ \ \sum_{k=1}^{5} a_k^2 = 100\] Find the minimum and maximum of $\text{max} \{a_1, a_2, a_3, a_4, a_5\}$

When the parabola which has the axis parallel to $y$ -axis and passes through the origin touch to the rectangular hyperbola $xy=1$ in the first quadrant moves, prove that the area of the figure sorrounded by the parabola and the $x$-axis is constant.

Which regular polygon can be obtained (and how) by cutting a cube with a plane ?

Let $(a_1,b_1),\ldots,(a_n,b_n)$ be $n$ points in $\mathbb R^2$ (where $\mathbb R$ denotes the real numbers), and let $\epsilon>0$ be a positive number. Can we find a real-valued function $f(x,y)$ that satisfies the following three conditions? 1. $f(0,0)=1$; 2. $f(x,y)\ne0$ for only finitely many $(x,y)\in\mathbb R^2$; 3. $\sum_{r=1}^n\left|f(x+a_r,y+b_r)-f(x,y)\right|<\epsilon$ for every $(x,y)\in\mathbb R^2$. Justify your answer.

Passing through the origin of the coordinate plane are $180$ lines, including the coordinate axes, which form $1$ degree angles with one another at the origin. Determine the sum of the x-coordinates of the points of intersection of these lines with the line $y = 100-x$

For any positive integer $n$, let $c(n)$ be the largest divisor of $n$ not greater than $\sqrt{n}$ and let $s(n)$ be the least integer $x$ such that $n < x$ and the product $nx$ is divisible by an integer $y$ where $n < y < x$. Prove that, for every $n$, $s(n) = (c(n) + 1) \cdot \left( \frac{n}{c(n)}+1\right)$

What is the maximum possible score on this contest? Recall that on the NIMO 2013 Summer Contest, problems $1$, $2$, \dots, $15$ are worth $1$, $2$, \dots, $15$ points, respectively. [i]Proposed by Evan Chen[/i]

A convex polygon is partitioned into parallelograms. A vertex of the polygon is called [i]good[/i] if it belongs to exactly one parallelogram. Prove that there are more than two good vertices.

Let $a, b, c$ be integers and let $p$ be an odd prime with \[p \not\vert a \;\; \text{and}\;\; p \not\vert b^{2}-4ac.\] Show that \[\sum_{k=1}^{p}\left( \frac{ak^{2}+bk+c}{p}\right) =-\left( \frac{a}{p}\right).\]

Let $A$ be a point on a circle with center $O$ and $B$ be the midpoint of $[OA]$. Let $C$ and $D$ be points on the circle such that they lie on the same side of the line $OA$ and $\widehat{CBO} = \widehat{DBA}$. Show that the reflection of the midpoint of $[CD]$ over $B$ lies on the circle.

Let $0 < a < 1$ be a real number. Prove that for all finite, strictly increasing sequences $k_1, k_2, \ldots , k_n$ of non-negative integers we have the inequality \[\biggl( \sum_{i=1}^n a^{k_i} \biggr)^2 < \frac{1+a}{1-a} \sum_{i=1}^n a^{2k_i}.\]

(a) Find the smallest number of lines drawn on the plane so that they produce exactly 2022 points of intersection. (Note: For 1 point of intersection, the minimum is 2; for 2 points, minimum is 3; for 3 points, minimum is 3; for 4 points, minimum is 4; for 5 points, the minimum is 4, etc.) (b) What happens if the lines produce exactly 2023 intersections?

Let $ k\equal{}2008^2\plus{}2^{2008}$. What is the units digit of $ k^2\plus{}2^k$? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 8$

15 positive integers, all less than 1998(and no one equal to 1), are relatively prime (no pair has a common factor > 1). Show that at least one of them must be prime.

Let \(\mathcal E\) be an ellipse with foci \(F_1\) and \(F_2\), and let \(P\) be a point on \(\mathcal E\). Suppose lines \(PF_1\) and \(PF_2\) intersect \(\mathcal E\) again at distinct points \(A\) and \(B\), and the tangents to \(\mathcal E\) at \(A\) and \(B\) intersect at point \(Q\). Show that the midpoint of \(\overline{PQ}\) lies on the circumcircle of \(\triangle PF_1F_2\). [i]Proposed by Karthik Vedula[/i]

Let $\Omega=\{z=x+iy~\in\mathbb{C}~:~|y|\leqslant 1\}$. If $f(z)=z^2+2$, then draw a sketch of $$f\Big(\Omega\Big)=\{f(z):z\in\Omega\}$$ Justify your answer.

Set $n = 425425$. Let $S$ be the set of proper divisors of $n$. Compute the remainder when $$ \sum_{k\in S} \phi (k) {2n/k \choose n/k}$$ is divided by $2n$, where $\phi (x)$ is the number of positive integers at most $x$ that are relatively prime to it.

The pages of a book are numbered starting from 1. The total number of pages in this book has three digits. Is it possible that the sum of the numbers on all the pages of the book is divisible by the number of digits used for numbering all the pages of the book?

Let $\triangle{ABC}$ be a scalene triangle with the longest side $AC$. (A ${\textit{scalene triangle}}$ has sides of different lengths.) Let $P$ and $Q$ be the points on the side $AC$ such that $AP=AB$ and $CQ=CB$. Thus we have a new triangle $\triangle{BPQ}$ inside $\triangle{ABC}$. Let $k_1$ be the circle circumscribed around the triangle $\triangle{BPQ}$ (that is, the circle passing through the vertices $B,P,$ and $Q$ of the triangle $\triangle{BPQ}$); and let $k_2$ be the circle inscribed in triangle $\triangle{ABC}$ (that is, the circle inside triangle $\triangle{ABC}$ that is tangent to the three sides $AB,BC$, and $CA$). Prove that the two circles $k_1$ and $k_2$ are concentric, that is, they have the same center.

Among 16 coins there are 8 heavy coins with weight of 11 g, and 8 light coins with weight of 10 g, but it's unknown what weight of any coin is. One of the coins is anniversary. How to know, is anniversary coin heavy or light, via three weighings on scales with two cups and without any weight?

Let \( f: \mathbb{R} \to \mathbb{R} \) be a continuous function. A chord is defined as a segment of integer length, parallel to the x-axis, whose endpoints lie on the graph of \( f \). It is known that the graph of \( f \) contains exactly \( N \) chords, one of which has length 2025. Find the minimum possible value of \( N \).

The number in each box below is the product of the numbers in the two boxes that touch it in the row above. For example, $30 = 6\times5$. What is the missing number in the top row? [asy] unitsize(0.8cm); draw((-1,0)--(1,0)--(1,-2)--(-1,-2)--cycle); draw((-2,0)--(0,0)--(0,2)--(-2,2)--cycle); draw((0,0)--(2,0)--(2,2)--(0,2)--cycle); draw((-3,2)--(-1,2)--(-1,4)--(-3,4)--cycle); draw((-1,2)--(1,2)--(1,4)--(-1,4)--cycle); draw((1,2)--(1,4)--(3,4)--(3,2)--cycle); label("600",(0,-1)); label("30",(-1,1)); label("6",(-2,3)); label("5",(0,3)); [/asy] $\textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 6$