This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 126

2019 China Girls Math Olympiad, 6

Let $0\leq x_1\leq x_2\leq \cdots \leq x_n\leq 1 $ $(n\geq 2).$ Prove that $$\sqrt[n]{x_1x_2 \cdots x_n}+ \sqrt[n]{(1-x_1)(1-x_2)\cdots (1-x_n)}\leq \sqrt[n]{1-(x_1- x_n)^2}.$$

2001 China Team Selection Test, 1

Tags: geometry , China
$E$ and $F$ are interior points of convex quadrilateral $ABCD$ such that $AE = BE$, $CE = DE$, $\angle AEB = \angle CED$, $AF = DF$, $BF = CF$, $\angle AFD = \angle BFC$. Prove that $\angle AFD + \angle AEB = \pi$.

2022 China Second Round, 3

Let $a_1,a_2,\cdots ,a_{100}$ be non-negative integers such that $(1)$ There are positive integers$ k\leq 100$ such that $a_1\leq a_2\leq \cdots\leq a_{k}$ and $a_i=0$ $(i>k);$ $(2)$ $ a_1+a_2+a_3+\cdots +a_{100}=100;$ $(3)$ $ a_1+2a_2+3a_3+\cdots +100a_{100}=2022.$ Find the minimum of $ a_1+2^2a_2+3^2a_3+\cdots +100^2a_{100}.$

2014 China Second Round Olympiad, 3

Let $S=\{1,2,3,\cdots,100\}$. Find the maximum value of integer $k$, such that there exist $k$ different nonempty subsets of $S$ satisfying the condition: for any two of the $k$ subsets, if their intersection is nonemply, then the minimal element of their intersection is not equal to the maximal element of either of the two subsets.

2010 China National Olympiad, 1

Tags: geometry , incenter , China
Two circles $\Gamma_1$ and $\Gamma_2$ meet at $A$ and $B$. A line through $B$ meets $\Gamma_1$ and $\Gamma_2$ again at $C$ and $D$ repsectively. Another line through $B$ meets $\Gamma_1$ and $\Gamma_2$ again at $E$ and $F$ repsectively. Line $CF$ meets $\Gamma_1$ and $\Gamma_2$ again at $P$ and $Q$ respectively. $M$ and $N$ are midpoints of arc $PB$ and arc $QB$ repsectively. Show that if $CD = EF$, then $C,F,M,N$ are concyclic.

1992 China Team Selection Test, 1

16 students took part in a competition. All problems were multiple choice style. Each problem had four choices. It was said that any two students had at most one answer in common, find the maximum number of problems.

1998 China Team Selection Test, 1

Find $k \in \mathbb{N}$ such that [b]a.)[/b] For any $n \in \mathbb{N}$, there does not exist $j \in \mathbb{Z}$ which satisfies the conditions $0 \leq j \leq n - k + 1$ and $\left( \begin{array}{c} n\\ j\end{array} \right), \left( \begin{array}{c} n\\ j + 1\end{array} \right), \ldots, \left( \begin{array}{c} n\\ j + k - 1\end{array} \right)$ forms an arithmetic progression. [b]b.)[/b] There exists $n \in \mathbb{N}$ such that there exists $j$ which satisfies $0 \leq j \leq n - k + 2$, and $\left( \begin{array}{c} n\\ j\end{array} \right), \left( \begin{array}{c} n\\ j + 1\end{array} \right), \ldots , \left( \begin{array}{c} n\\ j + k - 2\end{array} \right)$ forms an arithmetic progression. Find all $n$ which satisfies part [b]b.)[/b]

the 9th XMO, 2

Given a $\triangle ABC$ with circumcenter $O$ and orthocenter $H(O\ne H)$. Denote the midpoints of $BC, AC$ as $D, E$ and let $D', E'$ be the reflections of $D, E$ w.r.t. point $H$, respectively. If lines $AD'$ and $BE'$ meet at $K$, compute $\frac{KO}{KH}$.

1987 China Team Selection Test, 1

a.) For all positive integer $k$ find the smallest positive integer $f(k)$ such that $5$ sets $s_1,s_2, \ldots , s_5$ exist satisfying: [b]i.[/b] each has $k$ elements; [b]ii.[/b] $s_i$ and $s_{i+1}$ are disjoint for $i=1,2,...,5$ ($s_6=s_1$) [b]iii.[/b] the union of the $5$ sets has exactly $f(k)$ elements. b.) Generalisation: Consider $n \geq 3$ sets instead of $5$.

1987 China Team Selection Test, 2

A closed recticular polygon with 100 sides (may be concave) is given such that it's vertices have integer coordinates, it's sides are parallel to the axis and all it's sides have odd length. Prove that it's area is odd.

2014 China Western Mathematical Olympiad, 1

Let $x,y$ be positive real numbers .Find the minimum of $x+y+\frac{|x-1|}{y}+\frac{|y-1|}{x}$.

1986 China Team Selection Test, 4

Mark $4 \cdot k$ points in a circle and number them arbitrarily with numbers from $1$ to $4 \cdot k$. The chords cannot share common endpoints, also, the endpoints of these chords should be among the $4 \cdot k$ points. [b]i.[/b] Prove that $2 \cdot k$ pairwisely non-intersecting chords can be drawn for each of whom its endpoints differ in at most $3 \cdot k - 1$. [b]ii.[/b] Prove that the $3 \cdot k - 1$ cannot be improved.

2017 South East Mathematical Olympiad, 3

Let $a_1,a_2,\cdots,a_{n+1}>0$. Prove that$$\sum_{i-1}^{n}a_i\sum_{i=1}^{n}a_{i+1}\geq \sum_{i=1}^{n}\frac{a_i a_{i+1}}{a_i+a_{i+1}}\cdot \sum_{i=1}^{n}(a_i+a_{i+1})$$

2019 China Team Selection Test, 5

Find all integer $n$ such that the following property holds: for any positive real numbers $a,b,c,x,y,z$, with $max(a,b,c,x,y,z)=a$ , $a+b+c=x+y+z$ and $abc=xyz$, the inequality $$a^n+b^n+c^n \ge x^n+y^n+z^n$$ holds.

2019 Federal Competition For Advanced Students, P2, 4

Let $a, b, c$ be the positive real numbers such that $a+b+c+2=abc .$ Prove that $$(a+1)(b+1)(c+1)\geq 27.$$

2014 Contests, 3

Let $S=\{1,2,3,\cdots,100\}$. Find the maximum value of integer $k$, such that there exist $k$ different nonempty subsets of $S$ satisfying the condition: for any two of the $k$ subsets, if their intersection is nonemply, then the minimal element of their intersection is not equal to the maximal element of either of the two subsets.

the 9th XMO, 1

For any $n$ consecutive integers $a_1, \cdots, a_n$, prove that $$(a_1+\cdots+a_n)\cdot\left(\frac{1}{a_1}+\cdots+\frac{1}{a_n}\right)\leqslant \frac{n(n+1)\ln(\text{e}n)}{2}.$$

2016 China Second Round Olympiad, 1

Let $a_1, a_2, \ldots, a_{2016}$ be real numbers such that $9a_i\ge 11a^2_{i+1}$ $(i=,2,\cdots,2015)$. Find the maximum value of $(a_1-a^2_2)(a_2-a^2_3)\cdots (a_{2015}-a^2_{2016})(a_{2016}-a^2_{1}).$

2015 China Team Selection Test, 2

Let $X$ be a non-empty and finite set, $A_1,...,A_k$ $k$ subsets of $X$, satisying: (1) $|A_i|\leq 3,i=1,2,...,k$ (2) Any element of $X$ is an element of at least $4$ sets among $A_1,....,A_k$. Show that one can select $[\frac{3k}{7}] $ sets from $A_1,...,A_k$ such that their union is $X$.

the 9th XMO, 3

A sequence $\{a_n\} $ satisfies $a_1$ is a positive integer and $a_{n+1}$ is the largest odd integer that divides $2^n-1+a_n$ for all $n\geqslant 1$. Given a positive integer $r$ which is greater than $1$. Is it possible that there exists infinitely many pairs of ordered positive integers $(m,n)$ for which $m>n$ and $a_m = ra_n$? In other words, if you successfully find [b]an[/b] $a_1$ that yields infinitely many pairs of $(m,n)$ which work fine, you win and the answer is YES. Otherwise you have to proof NO for every possible $a_1$. @below, XMO stands for Xueersi Mathematical Olympiad, where Xueersi (学而思) is a famous tutoring camp in China.

1996 China Team Selection Test, 1

Let side $BC$ of $\bigtriangleup ABC$ be the diameter of a semicircle which cuts $AB$ and $AC$ at $D$ and $E$ respectively. $F$ and $G$ are the feet of the perpendiculars from $D$ and $E$ to $BC$ respectively. $DG$ and $EF$ intersect at $M$. Prove that $AM \perp BC$.

1986 China Team Selection Test, 3

Given a positive integer $A$ written in decimal expansion: $(a_{n},a_{n-1}, \ldots, a_{0})$ and let $f(A)$ denote $\sum^{n}_{k=0} 2^{n-k}\cdot a_k$. Define $A_1=f(A), A_2=f(A_1)$. Prove that: [b]I.[/b] There exists positive integer $k$ for which $A_{k+1}=A_k$. [b]II.[/b] Find such $A_k$ for $19^{86}.$

2020 China Second Round Olympiad, 3

Let $a_1=1,$ $a_2=2,$ $a_n=2a_{n-1}+a_{n-2},$ $n=3,4,\cdots.$ Prove that for any integer $n\geq5,$ $a_n$ has at least one prime factor $p,$ such that $p\equiv 1\pmod{4}.$

2018 China Northern MO, 1

In triangle $ABC$, let the circumcenter, incenter, and orthocenter be $O$, $I$, and $H$ respectively. Segments $AO$, $AI$, and $AH$ intersect the circumcircle of triangle $ABC$ at $D$, $E$, and $F$. $CD$ intersects $AE$ at $M$ and $CE$ intersects $AF$ at $N$. Prove that $MN$ is parallel to $BC$.

1989 China Team Selection Test, 3

Find the greatest $n$ such that $(z+1)^n = z^n + 1$ has all its non-zero roots in the unitary circumference, e.g. $(\alpha+1)^n = \alpha^n + 1, \alpha \neq 0$ implies $|\alpha| = 1.$