$a,b,c $ are positive real numbers . Prove that $\sqrt[7]{\frac{a}{b+c}+\frac{b}{c+a}} +\sqrt[7]{\frac{b}{c+a}+\frac{c}{b+a}}+\sqrt[7]{\frac{c}{a+b}+\frac{a}{b+c}}\geq 3$

The sets $A$ and $B$ are subsets of the positive integers. The sum of any two distinct elements of $A$ is an element of $B$. The quotient of any two distinct elements of $B$ (where we divide the largest by the smallest of the two) is an element of $A$. Determine the maximum number of elements in $A\cup B$.

Joy has $30$ thin rods, one each of every integer length from $1$ cm through $30$ cm. She places the rods with lengths $3$ cm, $7$ cm, and $15$ cm on a table. She then wants to choose a fourth rod that she can put with these three to form a quadrilateral with positive area. How many of the remaining rods can she choose as the fourth rod? $\textbf{(A) }16\qquad\textbf{(B) }17\qquad\textbf{(C) }18\qquad\textbf{(D) }19\qquad\textbf{(E) }20$

Find the max and minimum without using dervivate: $\sqrt{x} +4 \cdot \sqrt{\frac{1}{2} - x}$

Suppose that a cubic function with respect to $x$, $f(x)=ax^3+bx^2+cx+d$ satisfies all of 3 conditions: \[f(1)=1,\ f(-1)=-1,\ \int_{-1}^1 (bx^2+cx+d)\ dx=1\]. Find $f(x)$ for which $I=\int_{-1}^{\frac 12} \{f''(x)\}^2\ dx$ is minimized, the find the minimum value. [i]2011 Tokyo University entrance exam/Humanities, Problem 1[/i]

Let $n$ be a natural number. A sequence $x_1,x_2, \cdots ,x_{n^2}$ of $n^2$ numbers is called $n-\textit{good}$ if each $x_i$ is an element of the set $\{1,2,\cdots ,n\}$ and the ordered pairs $\left(x_i,x_{i+1}\right)$ are all different for $i=1,2,3,\cdots ,n^2$ (here we consider the subscripts modulo $n^2$). Two $n-$good sequences $x_1,x_2,\cdots ,x_{n^2}$ and $y_1,y_2,\cdots ,y_{n^2}$ are called $\textit{similar}$ if there exists an integer $k$ such that $y_i=x_{i+k}$ for all $i=1,2,\cdots,n^2$ (again taking subscripts modulo $n^2$). Suppose that there exists a non-trivial permutation (i.e., a permutation which is different from the identity permutation) $\sigma$ of $\{1,2,\cdots ,n\}$ and an $n-$ good sequence $x_1,x_2,\cdots,x_{n^2}$ which is similar to $\sigma\left(x_1\right),\sigma\left(x_2\right),\cdots ,\sigma\left(x_{n^2}\right)$. Show that $n\equiv 2\pmod{4}$.

Let $a, b, c$ and $d$ be four integers such that $7a + 8b = 14c + 28d$. Prove that the product $a\cdot b$ is always divisible by $14$.

Let $N \ge 5$ be given. Consider all sequences $(e_1,e_2,...,e_N)$ with each $e_i$ equal to $1$ or $-1$. Per move one can choose any five consecutive terms and change their signs. Two sequences are said to be similar if one of them can be transformed into the other in finitely many moves. Find the maximum number of pairwise non-similar sequences of length $N$.

Let $n$ be a positive integer, set $S_n = \{ (a_1,a_2,\cdots,a_{2^n}) \mid a_i=0 \ \text{or} \ 1, 1 \leq i \leq 2^n\}$. For any two elements $a=(a_1,a_2,\cdots,a_{2^n})$ and $b=(b_1,b_2,\cdots,b_{2^n})$ of $S_n$, define \[ d(a,b)= \sum_{i=1}^{2^n} |a_i - b_i| \] We call $A \subseteq S_n$ a $\textsl{Good Subset}$ if $d(a,b) \geq 2^{n-1}$ holds for any two distinct elements $a$ and $b$ of $A$. How many elements can the $\textsl{Good Subset}$ of $S_n$ at most have?

Right triangle $ACD$ with right angle at $C$ is constructed outwards on the hypotenuse $\overline{AC}$ of isosceles right triangle $ABC$ with leg length $1$, as shown, so that the two triangles have equal perimeters. What is $\sin(2\angle BAD)$? [asy] /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */ import graph; size(8.016233639805293cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -4.001920114613276, xmax = 4.014313525192017, ymin = -2.552570341575814, ymax = 5.6249093771911145; /* image dimensions */ draw((-1.6742337260757447,-1.)--(-1.6742337260757445,-0.6742337260757447)--(-2.,-0.6742337260757447)--(-2.,-1.)--cycle, linewidth(2.)); draw((-1.7696484586262846,2.7696484586262846)--(-1.5392969172525692,3.)--(-1.7696484586262846,3.2303515413737154)--(-2.,3.)--cycle, linewidth(2.)); /* draw figures */ draw((-2.,3.)--(-2.,-1.), linewidth(2.)); draw((-2.,-1.)--(2.,-1.), linewidth(2.)); draw((2.,-1.)--(-2.,3.), linewidth(2.)); draw((-0.6404058554606791,4.3595941445393205)--(-2.,3.), linewidth(2.)); draw((-0.6404058554606791,4.3595941445393205)--(2.,-1.), linewidth(2.)); label("$D$",(-0.9382446143428628,4.887784444795223),SE*labelscalefactor,fontsize(14)); label("$A$",(1.9411496528285788,-1.0783204767840298),SE*labelscalefactor,fontsize(14)); label("$B$",(-2.5046350956841272,-0.9861798602345433),SE*labelscalefactor,fontsize(14)); label("$C$",(-2.5737405580962416,3.5747806589650395),SE*labelscalefactor,fontsize(14)); label("$1$",(-2.665881174645728,1.2712652452278765),SE*labelscalefactor,fontsize(14)); label("$1$",(-0.3393306067712029,-1.3547423264324894),SE*labelscalefactor,fontsize(14)); /* dots and labels */ dot((-2.,3.),linewidth(4.pt) + dotstyle); dot((-2.,-1.),linewidth(4.pt) + dotstyle); dot((2.,-1.),linewidth(4.pt) + dotstyle); dot((-0.6404058554606791,4.3595941445393205),linewidth(4.pt) + dotstyle); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy] $\textbf{(A) } \dfrac{1}{3} \qquad\textbf{(B) } \dfrac{\sqrt{2}}{2} \qquad\textbf{(C) } \dfrac{3}{4} \qquad\textbf{(D) } \dfrac{7}{9} \qquad\textbf{(E) } \dfrac{\sqrt{3}}{2}$

A board $64$ inches long and $4$ inches high is inclined so that the long side of the board makes a $30$ degree angle with the ground. The distance from the ground to the highest point on the board can be expressed in the form $a+b\sqrt{c}$ where $a,b,c$ are positive integers and $c$ is not divisible by the square of any prime. What is $a+b+c$? [i]Author: Ray Li[/i] [hide="Clarification"]The problem is intended to be a two-dimensional problem. The board's dimensions are 64 by 4. The long side of the board makes a 30 degree angle with the ground. One corner of the board is touching the ground.[/hide]

There are $5$ students on a team for a math competition. The math competition has $5$ subject tests. Each student on the team must choose $2$ distinct tests, and each test must be taken by exactly two people. In how many ways can this be done?

The colonizers of a spherical planet have decided to build $N$ towns, each having area $1/1000$ of the total area of the planet. They also decided that any two points belonging to different towns will have different latitude and different longitude. What is the maximal value of $N$?

An acute $\triangle ABC$ with circumcircle $\Gamma$ is given. $I$ and $I_a$ are the incenter and $A-$excenter of $\triangle ABC$ respectively. The line $AI$ intersects $\Gamma$ again at $D$ and $A'$ is the antipode of $A$ with respect to $\Gamma$. $X$ and $Y$ are point on $\Gamma$ such that $\angle IXD = \angle I_aYD = 90^\circ$. The tangents to $\Gamma$ at $X$ and $Y$ intersect in point $Z$. Prove that $A', D$ and $Z$ are collinear. [i]Proposed by Nikola Velov[/i]

Let $\Gamma_1, \Gamma_2, \Gamma_3$ be three pairwise externally tangent circles with radii $1,2,3,$ respectively. A circle passes through the centers of $\Gamma_2$ and $\Gamma_3$ and is externally tangent to $\Gamma_1$ at a point $P.$ Suppose $A$ and $B$ are the centers of $\Gamma_2$ and $\Gamma_3,$ respectively. What is the value of $\frac{{PA}^2}{{PB}^2}?$ [i]Proposed by Kyle Lee[/i]

The sequence $(a_n)$ is given by $a_1=2$, $a_2=500$, $a_3=2000$ and $$\frac{a_{n+2}+a_{n+1}}{a_{n+1}+a_{n-1}}=\frac{a_{n+1}}{a_{n-1}}\qquad\text{for }n\ge2$$Prove that all terms of this sequence are positive integers and that $a_{2000}$ is divisible by $2^{2000}$.

Let $t$ and $n$ be fixed integers each at least $2$. Find the largest positive integer $m$ for which there exists a polynomial $P$, of degree $n$ and with rational coefficients, such that the following property holds: exactly one of \[ \frac{P(k)}{t^k} \text{ and } \frac{P(k)}{t^{k+1}} \] is an integer for each $k = 0,1, ..., m$. [i]Proposed by Michael Kural[/i]

Let $\mathbb Q_{\geq 0}$ be the non-negative rational numbers, $f: \mathbb Q_{\geq 0} \to \mathbb Q_{\geq 0}$ such that $f(z+1) = f(z)+1$, $f(1/z) = f(z)$ for $z\neq 0$, and $f(0) = 0.$ Define a sequence $P_n$ of non-negative integers recursively via $$P_0 = 0,\quad P_1 = 1,\quad P_n = 2 P_{n-1}+P_{n-2}$$ for every $n \geq 2$. Find $f\left(\frac{P_{20}}{P_{24}}\right).$ [i]Proposed by Robert Trosten[/i]

Given an integer $n \ge 3$. Find the largest positive integer $k $ with the following property: For $n$ points in general position, there exists $k$ ways to draw a non-intersecting polygon with those $n$ points as it’s vertices. [hide=Different wording]Given $n$, find the maximum $k$ so that for every general position of $n$ points , there are at least $k$ ways of connecting the points to form a polygon.[/hide]

Choose positive integers $b_1, b_2, \dotsc$ satisfying \[1=\frac{b_1}{1^2} > \frac{b_2}{2^2} > \frac{b_3}{3^2} > \frac{b_4}{4^2} > \dotsb\] and let $r$ denote the largest real number satisfying $\tfrac{b_n}{n^2} \geq r$ for all positive integers $n$. What are the possible values of $r$ across all possible choices of the sequence $(b_n)$? [i]Carl Schildkraut and Milan Haiman[/i]

Calculate $ \left\lfloor \frac{(a^2+b^2+c^2)(a+b+c)}{a^3+b^3+c^3} \right\rfloor , $ where $ a,b,c $ are the lengths of the side of a triangle. [i]Costel Anghel[/i]

Let $ 0<a_k<1$ for $ k=1,2,... .$ Give a necessary and sufficient condition for the existence, for every $ 0<x<1$, of a permutation $ \pi_x$ of the positive integers such that \[ x= \sum_{k=1}^{\infty} \frac{a_{\pi_x}(k)}{2^k}.\] [i]P. Erdos[/i]

Let $ABC$ be a triangle and $L$, $M$, $N$ be the midpoints of $BC$, $CA$ and $AB$, respectively. The tangent to the circumcircle of $ABC$ at $A$ intersects $LM$ and $LN$ at $P$ and $Q$, respectively. Show that $CP$ is parallel to $BQ$.

Let $ABC$ be a triangle with $AB<AC$ and with its incircle touching the sides $AB$ and $BC$ at $M$ and $J$ respectively. A point $D$ lies on the extension of $AB$ beyond $B$ such that $AD=AC$. Let $O$ be the midpoint of $CD$. Prove that the points $J$, $O$, $M$ are collinear. [i](Proposed by Tan Rui Xuen)[/i]

Let $p$ be a prime number and $F=\left \{0,1,2,...,p-1 \right \}$. Let $A$ be a proper subset of $F$ that satisfies the following property: if $a,b \in A$, then $ab+1$ (mod $p$) $ \in A$. How many elements can $A$ have? (Justify your answer.)