Suppose that $S$ is a finite set of at least five points in the plane; some are coloured red, the others are coloured blue. No subset of three or more similarly coloured points is collinear. Show that there is a triangle (i) whose vertices are all the same colour, and (ii) at least one side of the triangle does not contain a point of the opposite colour.

On a table lie 2022 matches and a regular dice that has the number $a$ on top. Now Max and Moritz play the following game: Alternately, they take away matches according to the following rule, where Max begins: The player to make a move rolls the dice over one of its edges and then takes a way as many matches as the top number shows. The player that cannot make legal move after some number of moves loses. For which $a$ can Moritz force Max to lose?

Let $f(x)$ be a continuous function, whose first and second derivatives are continuous on $[0,2\pi]$ and $f''(x) \geq 0$ for all $x$ in $[0,2\pi]$. Show that \[\int_{0}^{2\pi} f(x)\cos x dx \geq 0\]

Given a fixed acute angle $\theta$ and a pair of internally tangent circles, let the line $l$ which passes through the point of tangency, $A$, cut the larger circle again at $B$ ($l$ does not pass through the centers of the circles). Let $M$ be a point on the major arc $AB$ of the larger circle, $N$ the point where $AM$ intersects the smaller circle, and $P$ the point on ray $MB$ such that $\angle MPN = \theta$. Find the locus of $P$ as $M$ moves on major arc $AB$ of the larger circle.

Given a triangle $ABC$ let \begin{eqnarray*} x &=& \tan\left(\dfrac{B-C}{2}\right) \tan \left(\dfrac{A}{2}\right) \\ y &=& \tan\left(\dfrac{C-A}{2}\right) \tan \left(\dfrac{B}{2}\right) \\ z &=& \tan\left(\dfrac{A-B}{2}\right) \tan \left(\dfrac{C}{2}\right). \end{eqnarray*} Prove that $x+ y + z + xyz = 0$.

Positive reals $a,b,c \leq 1$ satisfy $\frac{a+b+c-abc}{1-ab-bc-ca} = 1$. Find the minimum value of $$\bigg(\frac{a+b}{1-ab} + \frac{b+c}{1-bc} + \frac{c+a}{1-ca}\bigg)^{2}$$ Proposed by Harry Chen (Extile)

[b]carpeting[/b] suppose that $S$ is a figure in the plane such that it's border doesn't contain any lattice points. suppose that $x,y$ are two lattice points with the distance $1$ (we call a point lattice point if it's coordinates are integers). suppose that we can cover the plane with copies of $S$ such that $x,y$ always go on lattice points ( you can rotate or reverse copies of $S$). prove that the area of $S$ is equal to lattice points inside it. time allowed for this question was 1 hour.

If $a$ and $b$ are real numbers, the equation $3x-5+a=bx+1$ has a unique solution $x$ [The symbol $a \neq 0$ means that $a$ is different from zero]: $ \textbf{(A) }\text{for all a and b} \qquad\textbf{(B) }\text{if a }\neq\text{2b}\qquad\textbf{(C) }\text{if a }\neq 6\qquad$ $\textbf{(D) }\text{if b }\neq 0\qquad\textbf{(E) }\text{if b }\neq 3 $

The order of $\log_{\sin1}\cos1,\log_{\sin1}\tan1,\log_{\cos1}\sin1,\log_{\cos1}\tan1$ is (form small to large) $\text{(A)}\log_{\sin1}\cos1<\log_{\cos1}\sin1<\log_{\sin1}\tan1<\log_{\cos1}\tan1$ $\text{(B)}\log_{\cos1}\sin1<\log_{\cos1}\tan1<\log_{\sin1}\cos1<\log_{\sin1}\tan1$ $\text{(C)}\log_{\sin1}\tan1<\log_{\cos1}\tan1<\log_{\cos1}\sin1<\log_{\sin1}\cos1$ $\text{(D)}\log_{\cos1}\tan1<\log_{\sin1}\tan1<\log_{\sin1}\cos1<\log_{\cos1}\sin1$

Let $ABCDE$ be a convex pentagon such that $AB=BC=CD$, $\angle{EAB}=\angle{BCD}$, and $\angle{EDC}=\angle{CBA}$. Prove that the perpendicular line from $E$ to $BC$ and the line segments $AC$ and $BD$ are concurrent.

Let $S$ be the number of ordered pairs of integers $(a,b)$ with $1 \leq a \leq 100$ and $b \geq 0$ such that the polynomial $x^2+ax+b$ can be factored into the product of two (not necessarily distinct) linear factors with integer coefficients. Find the remainder when $S$ is divided by $1000$.

In a village with at least one inhabitant, there are several associations. Each inhabitant is a member of at least $ k$ associations, and any two associations have at most one common member. Prove that at least $ k$ associations have the same number of members.

Let $A,B,C$ be nonempty sets in $\mathbb R^n$. Suppose that $A$ is bounded, $C$ is closed and convex, and $A+B\subseteq A+C$. Prove that $B\subseteq C$. Recall that $E+F=\{e+f:e\in E,f\in F\}$ and $D\subseteq\mathbb R^n$ is convex iff $tx+(1-t)y\in D$ for all $x,y\in D$ and any $t\in[0,1]$.

The positive integrer number $n$ has $1994$ digits. $14$ of its digits are $0$'s and the number of times that the other digits: $1, 2, 3, 4, 5, 6, 7, 8, 9$ appear are in proportion $1: 2: 3: 4: 5: 6: 7: 8: 9$, respectively. Prove that $n$ is not a perfect square.

Let $E$ and $F$ be points on the side $AB$ of a rectangle $ABCD$ such that $AE = EF$. The line through $E$ perpendicular to $AB$ intersects the diagonal $AC$ at $G$, and the segments $FD$ and $BG$ intersect at $H$. Prove that the areas of the triangles $FBH$ and $GHD$ are equal.

For positive integers $n$ and $k \geq 2$, define $E_k(n)$ as the greatest exponent $r$ such that $k^r$ divides $n!$. Prove that there are infinitely many $n$ such that $E_{10}(n) > E_9(n)$ and infinitely many $m$ such that $E_{10}(m) < E_9(m)$.

Suppose that $a$ and $b$ are two distinct positive real numbers such that $\lfloor na\rfloor$ divides $\lfloor nb\rfloor$ for any positive integer $n$. Prove that $a$ and $b$ are positive integers.

Three given circles have the same radius and pass through a common point $ P$. Their other points of pairwise intersections are $ A$, $ B$, $ C$. We define triangle $ A'B'C'$, each of whose sides is tangent to two of the three circles. The three circles are contained in $ \triangle A'B'C'$. Prove that the area of $ \triangle A'B'C'$ is at least nine times the area of $ \triangle ABC$

What is the maximum number of triangles with vertices on the points of the fork/graph which is possible to construct?

Let $R $ be the circumradius of a circumscribed quadrilateral $ABCD $. Let $h_1$ and $h_2$ be the altitudes from $A $ to $BC $ and $CD $ respectively. Similarly $h_3$ and $h_4$ are the altitudes from $C $ to $AB $ and $AD$. Prove that $$\frac {h_1+h_2- 2R}{h_1h_2}=\frac {h_3+h_4-2R}{h_3h_4} $$

Let $P$ be a polygon that is convex and symmetric to some point $O$. Prove that for some parallelogram $R$ satisfying $P\subset R$ we have \[\frac{|R|}{|P|}\leq \sqrt 2\] where $|R|$ and $|P|$ denote the area of the sets $R$ and $P$, respectively. [i]Proposed by Witold Szczechla, Poland[/i]

[b]p1.[/b] Prove that $x = 2$ is the only real number satisfying $3^x + 4^x = 5^x$. [b]p2.[/b] Show that $\sqrt{9 + 4\sqrt5} -\sqrt{9 - 4\sqrt5}$ is an integer. [b]p3.[/b] Two players $A$ and $B$ play a game on a round table. Each time they take turn placing a round coin on the table. The coin has a uniform size, and this size is at least $10$ times smaller than the table size. They cannot place the coin on top of any part of other coins, and the whole coin must be on the table. If a player cannot place a coin, he loses. Suppose $A$ starts first. If both of them plan their moves wisely, there will be one person who will always win. Determine whether $A$ or $B$ will win, and then determine his winning strategy. [b]p4.[/b] Suppose you are given $4$ pegs arranged in a square on a board. A “move” consists of picking up a peg, reflecting it through any other peg, and placing it down on the board. For how many integers $1 \le n \le 2013$ is it possible to arrange the $4$ pegs into a [i]larger [/i] square using exactly $n$ moves? Justify your answers. [b]p5.[/b] Find smallest positive integer that has a remainder of $1$ when divided by $2$, a remainder of $2$ when divided by $3$, a remainder of $3$ when divided by $5$, and a remainder of $5$ when divided by $7$. [b]p6.[/b] Find the value of $$\sum_{m|496,m>0} \frac{1}{m},$$ where $m|496$ means $496$ is divisible by $m$. [b]p7.[/b] What is the value of $${100 \choose 0}+{100 \choose 4}+{100 \choose 8}+ ... +{100 \choose 100}?$$ [b]p8.[/b] An $n$-term sequence $a_0, a_1, ...,a_n$ will be called [i]sweet [/i] if, for each $0 \le i \le n -1$, $a_i$ is the number of times that the number $i$ appears in the sequence. For example, $1, 2, 1,0$ is a sweet sequence with $4$ terms. Given that $a_0$, $a_1$, $...$, $a_{2013}$ is a sweet sequence, find the value of $a^2_0+ a^2_1+ ... + a^2_{2013}.$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let be three polynomials of degree two $ p_1,p_2,p_3\in\mathbb{R} [X] $ and the function $$ f:\mathbb{R}\longrightarrow\mathbb{R} ,\quad f(x)=\max\left( p_1(x),p_2(x),p_3(x)\right) . $$ Then, $ f $ is differentiable if and only if any of these three polynomials dominates the other two.

Let $D \subseteq \mathbb{C}$ be an open set containing the closed unit disk $\{z : |z| \leq 1\}$. Let $f : D \rightarrow \mathbb{C}$ be a holomorphic function, and let $p(z)$ be a monic polynomial. Prove that $$ |f(0)| \leq \max_{|z|=1} |f(z)p(z)| $$

For a positive integer $n$, define $f(n)$ to be the number of sequences $(a_1,a_2,\dots,a_k)$ such that $a_1a_2\cdots a_k=n$ where $a_i\geq 2$ and $k\ge 0$ is arbitrary. Also we define $f(1)=1$. Now let $\alpha>1$ be the unique real number satisfying $\zeta(\alpha)=2$, i.e $ \sum_{n=1}^{\infty}\frac{1}{n^\alpha}=2 $ Prove that [list] (a) \[ \sum_{j=1}^{n}f(j)=\mathcal{O}(n^\alpha) \] (b) There is no real number $\beta<\alpha$ such that \[ \sum_{j=1}^{n}f(j)=\mathcal{O}(n^\beta) \] [/list]