Quadrilateral $ALEX,$ pictured below (but not necessarily to scale!) can be inscribed in a circle; with $\angle LAX = 20^{\circ}$ and $\angle AXE = 100^{\circ}:$

Find the sum of all products $a_1a_2...a_{50}$ , where $a_1,a_2,...,a_{50}$ are distinct positive integers, less than or equal to $101$, and such that no two of them add up to $101$.

Define a positive number sequence sequence $\{a_n\}$ by \[a_{1}=1,(n^2+1)a^2_{n-1}=(n-1)^2a^2_{n}.\]Prove that\[\frac{1}{a^2_1}+\frac{1}{a^2_2}+\cdots +\frac{1}{a^2_n}\le 1+\sqrt{1-\frac{1}{a^2_n}} .\]

The polynomial $P(x) = x^3 + \sqrt{6} x^2 - \sqrt{2} x - \sqrt{3}$ has three distinct real roots. Compute the sum of all $0 \le \theta < 360$ such that $P(\tan \theta^\circ) = 0$. [i]Proposed by Lewis Chen[/i]

For two given positive integers $ m,n > 1$, let $ a_{ij} (i = 1,2,\cdots,n, \; j = 1,2,\cdots,m)$ be nonnegative real numbers, not all zero, find the maximum and the minimum values of $ f$, where \[ f = \frac {n\sum_{i = 1}^{n}(\sum_{j = 1}^{m}a_{ij})^2 + m\sum_{j = 1}^{m}(\sum_{i= 1}^{n}a_{ij})^2}{(\sum_{i = 1}^{n}\sum_{j = 1}^{m}a_{ij})^2 + mn\sum_{i = 1}^{n}\sum_{j=1}^{m}a_{ij}^2}. \]

Denote by $\mathbb{N}$ the set of all positive integers. Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all positive integers $m$ and $n$, the integer $f(m)+f(n)-mn$ is nonzero and divides $mf(m)+nf(n)$. [i]Proposed by Dorlir Ahmeti, Albania[/i]

Find all functions $f: \mathbb{R} \to \mathbb{R}$ such that for all real number $x,y$, $$(y+1)f(yf(x))=yf(x(y+1)).$$

Let $m,n\in\mathbb{Z_{+}}$ be such numbers that set $\{1,2,\ldots,n\}$ contains exactly $m$ different prime numbers. Prove that if we choose any $m+1$ different numbers from $\{1,2,\ldots,n\}$ then we can find number from $m+1$ choosen numbers, which divide product of other $m$ numbers.

If the line $y=mx+1$ intersects the ellipse $x^2+4y^2=1$ exactly once, then the value of $m^2$ is $\textbf{(A) }\textstyle\frac{1}{2}\qquad\textbf{(B) }\frac{2}{3}\qquad\textbf{(C) }\frac{3}{4}\qquad\textbf{(D) }\frac{4}{5}\qquad \textbf{(E) }\frac{5}{6}$

Let $ S$ be the set of all real numbers strictly greater than −1. Find all functions $ f: S \to S$ satisfying the two conditions: (a) $ f(x \plus{} f(y) \plus{} xf(y)) \equal{} y \plus{} f(x) \plus{} yf(x)$ for all $ x, y$ in $ S$; (b) $ \frac {f(x)}{x}$ is strictly increasing on each of the two intervals $ \minus{} 1 < x < 0$ and $ 0 < x$.

Let $M$ be the set of integer coordinate points situated on the line $d$ of real numbers. We color the elements of M in black or white. Show that at least one of the following statements is true: (a) there exists a finite subset $F \subset M$ and a point $M \in d$ so that the elements of the set $M - F$ that are lying on one of the rays determined by $M$ on $d$ are all white, and the elements of $M - F$ that are situated on the opposite ray are all black, (b) there exists an infinite subset $S \subset M$ and a point $T \in d$ so that for each $A \in S$ the reflection of A about $T$ belongs to $S$ and has the same color as $A$

Let $\omega_1$ and $\omega_2$ be intersecting circles in the plane with radii $12$ and $15$, respectively. Suppose $\Gamma$ is a circle such that $\omega_1$ and $\omega_2$ are internally tangent to $\Gamma$ at $X_1$ and $X_2$, respectively. Similarly, $\ell$ is a line that is tangent to $\omega_1$ and $\omega_2$ at $Y_1$ and $Y_2$, respectively. If $X_1X_2=18$ and $Y_1Y_2=9$, what is the radius of $\Gamma$?

Let $ABC$ and $DEF$ be acute-angled triangles. Write $d = EF, e = FD, f = DE.$ Show that there exists a point $P$ in the interior of $ABC$ for which the value of the expression $X=d \cdot AP +e \cdot BP +f \cdot CP$ attains a minimum.

For any polynomial $P(x)=a_0+a_1x+\ldots+a_kx^k$ with integer coefficients, the number of odd coefficients is denoted by $o(P)$. For $i-0,1,2,\ldots$ let $Q_i(x)=(1+x)^i$. Prove that if $i_1,i_2,\ldots,i_n$ are integers satisfying $0\le i_1<i_2<\ldots<i_n$, then: \[ o(Q_{i_1}+Q_{i_2}+\ldots+Q_{i_n})\ge o(Q_{i_1}). \]

Evaluate the following definite integrals. (1) $ \int_0^{\frac {1}{2}} \frac {x^2}{\sqrt {1 \minus{} x^2}}\ dx$ (2) $ \int_0^1 \frac {1 \minus{} x}{(1 \plus{} x^2)^2}\ dx$ (3) $ \int_{ \minus{} 1}^7 \frac {dx}{1 \plus{} \sqrt [3]{1 \plus{} x}}$

In a convex quadrilateral it is known $ABCD$ that $\angle ADB + \angle ACB = \angle CAB + \angle DBA = 30^{\circ}$ and $AD = BC$. Prove that from the lengths $DB$, $CA$ and $DC$, you can make a right triangle.

Let $A$ be a finite set of positive numbers , $B=\{\frac{a+b}{c+d} |a,b,c,d \in A \}$. Show that: $\left | B \right | \ge 2\left | A \right |^2-1 $, where $|X| $ be the number of elements of the finite set $X$. (High School Affiliated to Nanjing Normal University )

[u]Round 1[/u] [b]p1.[/b] Tom and Jerry stole a chain of $7$ sausages and are now trying to divide the bounty. They take turns biting the sausages at one of the connections. When one of them breaks a connection, he may eat any single sausages that may fall out. Tom takes the first bite. Each of them is trying his best to eat more sausages than his opponent. Who will succeed? [b]p2. [/b]The King of the Mountain Dwarves wants to light his underground throne room by placing several torches so that the whole room is lit. The king, being very miserly, wants to use as few torches as possible. What is the least number of torches he could use? (You should show why he can't do it with a smaller number of torches.) This is the shape of the throne room: [img]https://cdn.artofproblemsolving.com/attachments/b/2/719daafd91fc9a11b8e147bb24cb66b7a684e9.png[/img] Also, the walls in all rooms are lined with velvet and do not reflect the light. For example, the picture on the right shows how another room in the castle is partially lit. [img]https://cdn.artofproblemsolving.com/attachments/5/1/0f6971274e8c2ff3f2d0fa484b567ff3d631fb.png[/img] [b]p3.[/b] In the Hundred Acre Wood, all the animals are either knights or liars. Knights always tell the truth and liars always lie. One day in the Wood, Winnie-the-Pooh, a knight, decides to visit his friend Rabbit, also a noble knight. Upon arrival, Pooh finds his friend sitting at a round table with $5$ other guests. One-by-one, Pooh asks each person at the table how many of his two neighbors are knights. Surprisingly, he gets the same answer from everybody! "Oh bother!" proclaims Pooh. "I still don't have enough information to figure out how many knights are at this table." "But it's my birthday," adds one of the guests. "Yes, it's his birthday!" agrees his neighbor. Now Pooh can tell how many knights are at the table. Can you? [b]p4.[/b] Several girls participate in a tennis tournament in which each player plays each other player exactly once. At the end of the tournament, it turns out that each player has lost at least one of her games. Prove that it is possible to find three players $A$, $B$, and $C$ such that $A$ defeated $B$, $B$ defeated $C$, and $C$ defeated $A$. [b]p5.[/b] There are $40$ piles of stones with an equal number of stones in each. Two players, Ann and Bob, can select any two piles of stones and combine them into one bigger pile, as long as this pile would not contain more than half of all the stones on the table. A player who can’t make a move loses. Ann goes first. Who wins? [u]Round 2[/u] [b]p6.[/b] In a galaxy far, far away, there is a United Galactic Senate with $100$ Senators. Each Senator has no more than three enemies. Tired of their arguments, the Senators want to split into two parties so that each Senator has no more than one enemy in his own party. Prove that they can do this. (Note: If $A$ is an enemy of $B$, then $B$ is an enemy of $A$.) [b]p7.[/b] Harry has a $2012$ by $2012$ chessboard and checkers numbered from $1$ to $2012 \times 2012$. Can he place all the checkers on the chessboard in such a way that whatever row and column Professor Snape picks, Harry will be able to choose three checkers from this row and this column such that the product of the numbers on two of the checkers will be equal to the number on the third? [img]https://cdn.artofproblemsolving.com/attachments/b/3/a87d559b340ceefee485f41c8fe44ae9a59113.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ p \ge 3$ be a prime number. The sequence $ \{a_{n}\}_{n \ge 0}$ is defined by $ a_{n}=n$ for all $ 0 \le n \le p-1$, and $ a_{n}=a_{n-1}+a_{n-p}$ for all $ n \ge p$. Compute $ a_{p^{3}}\; \pmod{p}$.

The polyhedron $PABCDQ$ has the form shown in the figure. It is known that $ABCD$ is parallelogram, the planes of the triangles of the $PAC$ and $PBD$ mutually perpendicular, and also mutually perpendicular are the planes of triangles $QAC$ and $QBC$. Each face of this polyhedron is painted black or white so that the faces that have a common edge are painted in different colors. Prove that the sum of the squares of the areas of the black faces is equal to the sum of the squares of the areas of the white faces. [img]https://1.bp.blogspot.com/-UM5PKEGGWqc/X1V2cXAFmwI/AAAAAAAAMdw/V-Qr94tZmqkj3_q-5mkSICGF1tMu-b_VwCLcBGAsYHQ/s0/2007.5%2Bchampions%2Btourn.png[/img]

Let \(a,b,c\) be positive real numbers such that \(\dfrac{ab}{1+bc}+\dfrac{bc}{1+ca}+\dfrac{ca}{1+ab}=1\). Prove that $$\dfrac{1}{a^3}+\dfrac{1}{b^3}+\dfrac{1}{c^3} \ge 6\sqrt{2}$$

Prove that there exist infinitely many pairs of real numbers $(x,y)$ such that $\sqrt{1+2x-xy}+\sqrt{1+2y-xy}=2.$

A canister contains two and a half cups of flour. Greg and Sally have a brownie recipe which calls for one and one third cups of flour. Greg and Sally want to make one and a half recipes of brownies. To the nearest whole percent, what percent of the flour in the canister would they use?

Let $ABC$ be a non-isosceles triangle with circumcenter $O$, in­center $I$, and orthocenter $H$. Prove that angle $\angle OIH$ is obtuse.

Two mathematicians, lost in Berlin, arrived on the corner of Barbarossa street with Martin Luther street and need to arrive on the corner of Meininger street with Martin Luther street. Unfortunately they don't know which direction to go along Martin Luther Street to reach Meininger Street nor how far it is, so they must go fowards and backwards along Martin Luther street until they arrive on the desired corner. What is the smallest value for a positive integer $k$ so that they can be sure that if there are $N$ blocks between Barbarossa street and Meininger street then they can arrive at their destination by walking no more than $kN$ blocks (no matter what $N$ turns out to be)?