Found problems: 143
2001 China Team Selection Test, 3
MO Space City plans to construct $n$ space stations, with a unidirectional pipeline connecting every pair of stations. A station directly reachable from station P without passing through any other station is called a directly reachable station of P. The number of stations jointly directly reachable by the station pair $\{P, Q\}$ is to be examined. The plan requires that all station pairs have the same number of jointly directly reachable stations.
(1) Calculate the number of unidirectional cyclic triangles in the space city constructed according to this requirement. (If there are unidirectional pipelines among three space stations A, B, C forming $A \rightarrow B \rightarrow C \rightarrow A$, then triangle ABC is called a unidirectional cyclic triangle.)
(2) Can a space city with $n$ stations meeting the above planning requirements be constructed for infinitely many integers $n \geq 3$?
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.
2018 China Team Selection Test, 3
Two positive integers $p,q \in \mathbf{Z}^{+}$ are given. There is a blackboard with $n$ positive integers written on it. A operation is to choose two same number $a,a$ written on the blackboard, and replace them with $a+p,a+q$. Determine the smallest $n$ so that such operation can go on infinitely.
2019 China Team Selection Test, 1
Given complex numbers $x,y,z$, with $|x|^2+|y|^2+|z|^2=1$. Prove that: $$|x^3+y^3+z^3-3xyz| \le 1$$
2015 China Team Selection Test, 6
There are some players in a Ping Pong tournament, where every $2$ players play with each other at most once. Given:
\\(1) Each player wins at least $a$ players, and loses to at least $b$ players. ($a,b\geq 1$)
\\(2) For any two players $A,B$, there exist some players $P_1,...,P_k$ ($k\geq 2$) (where $P_1=A$,$P_k=B$), such that $P_i$ wins $P_{i+1}$ ($i=1,2...,k-1$).
\\Prove that there exist $a+b+1$ distinct players $Q_1,...Q_{a+b+1}$, such that $Q_i$ wins $Q_{i+1}$ ($i=1,...,a+b$)
2017 China Team Selection Test, 2
Let $ABCD$ be a non-cyclic convex quadrilateral. The feet of perpendiculars from $A$ to $BC,BD,CD$ are $P,Q,R$ respectively, where $P,Q$ lie on segments $BC,BD$ and $R$ lies on $CD$ extended. The feet of perpendiculars from $D$ to $AC,BC,AB$ are $X,Y,Z$ respectively, where $X,Y$ lie on segments $AC,BC$ and $Z$ lies on $BA$ extended. Let the orthocenter of $\triangle ABD$ be $H$. Prove that the common chord of circumcircles of $\triangle PQR$ and $\triangle XYZ$ bisects $BH$.
2001 China Team Selection Test, 2
Find the largest positive real number \( c \) such that for any positive integer \( n \), satisfies \(\{ \sqrt{7n} \} \geq \frac{c}{\sqrt{7n}}\).
2019 China Team Selection Test, 6
Let $k$ be a positive real. $A$ and $B$ play the following game: at the start, there are $80$ zeroes arrange around a circle. Each turn, $A$ increases some of these $80$ numbers, such that the total sum added is $1$. Next, $B$ selects ten consecutive numbers with the largest sum, and reduces them all to $0$. $A$ then wins the game if he/she can ensure that at least one of the number is $\geq k$ at some finite point of time.
Determine all $k$ such that $A$ can always win the game.
2024 China Team Selection Test, 23
$P(z)=a_nz^n+\dots+a_1z+z_0$, with $a_n\neq 0$ is a polynomial with complex coefficients, such that when $|z|=1$, $|P(z)|\leq 1$. Prove that for any $0\leq k\leq n-1$, $|a_k|\leq 1-|a_n|^2$.
[i]Proposed by Yijun Yao[/i]
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.
2023 China Team Selection Test, P8
In non-isosceles acute ${}{\triangle ABC}$, $AP$, $BQ$, $CR$ is the height of the triangle. $A_1$ is the midpoint of $BC$, $AA_1$ intersects $QR$ at $K$, $QR$ intersects a straight line that crosses ${A}$ and is parallel to $BC$ at point ${D}$, the line connecting the midpoint of $AH$ and ${K}$ intersects $DA_1$ at $A_2$. Similarly define $B_2$, $C_2$. ${}\triangle A_2B_2C_2$ is known to be non-degenerate, and its circumscribed circle is $\omega$. Prove that: there are circles $\odot A'$, $\odot B'$, $\odot C'$ tangent to and INSIDE $\omega$ satisfying:
(1) $\odot A'$ is tangent to $AB$ and $AC$, $\odot B'$ is tangent to $BC$ and $BA$, and $\odot C'$ is tangent to $CA$ and $CB$.
(2) $A'$, $B'$, $C$' are different and collinear.
[i]Created by Sihui Zhang[/i]
2014 China Team Selection Test, 5
Let $n$ be a given integer which is greater than $1$ . Find the greatest constant $\lambda(n)$ such that for any non-zero complex $z_1,z_2,\cdots,z_n$ ,have that \[\sum_{k\equal{}1}^n |z_k|^2\geq \lambda(n)\min\limits_{1\le k\le n}\{|z_{k+1}-z_k|^2\},\] where $z_{n+1}=z_1$.
2019 China Team Selection Test, 6
Let $k$ be a positive real. $A$ and $B$ play the following game: at the start, there are $80$ zeroes arrange around a circle. Each turn, $A$ increases some of these $80$ numbers, such that the total sum added is $1$. Next, $B$ selects ten consecutive numbers with the largest sum, and reduces them all to $0$. $A$ then wins the game if he/she can ensure that at least one of the number is $\geq k$ at some finite point of time.
Determine all $k$ such that $A$ can always win the game.
2023 China Team Selection Test, P6
Prove that: (1) In the complex plane, each line (except for the real axis) that crosses the origin has at most one point ${z}$, satisfy $$\frac {1+z^{23}}{z^{64}}\in\mathbb R.$$
(2) For any non-zero complex number ${a}$ and any real number $\theta$, the equation $1+z^{23}+az^{64}=0$ has roots in $$S_{\theta}=\left\{ z\in\mathbb C\mid\operatorname{Re}(ze^{-i\theta })\geqslant |z|\cos\frac{\pi}{20}\right\}.$$
[i]Proposed by Yijun Yao[/i]
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.
2023 China Team Selection Test, P24
Let $n$ be a positive integer. Initially, a $2n \times 2n$ grid has $k$ black cells and the rest white cells. The following two operations are allowed :
(1) If a $2\times 2$ square has exactly three black cells, the fourth is changed to a black cell;
(2) If there are exactly two black cells in a $2 \times 2$ square, the black cells are changed to white and white to black.
Find the smallest positive integer $k$ such that for any configuration of the $2n \times 2n$ grid with $k$ black cells, all cells can be black after a finite number of operations.
2001 China Team Selection Test, 3
Given $a$, $b$ are positive integers greater than $1$, and for every positive integer $n$, $b^{n}-1$ divides $a^{n}-1$. Define the polynomial $p_{n}(x)$ as follows: $p_0{x}=-1$, $p_{n+1}(x)=b^{n+1}(x-1)p_{n}(bx)-a(b^{n+1}-1)p_{n}(x)$, for $n \ge 0$. Prove that there exist integers $C$ and positive integer $k$ such that $p_{k}(x)=Cx^k$.
2018 China Team Selection Test, 3
Prove that there exists a constant $C>0$ such that
$$H(a_1)+H(a_2)+\cdots+H(a_m)\leq C\sqrt{\sum_{i=1}^{m}i a_i}$$
holds for arbitrary positive integer $m$ and any $m$ positive integer $a_1,a_2,\cdots,a_m$, where $$H(n)=\sum_{k=1}^{n}\frac{1}{k}.$$
2018 China Team Selection Test, 6
Let $A_1$, $A_2$, $\cdots$, $A_m$ be $m$ subsets of a set of size $n$. Prove that $$ \sum_{i=1}^{m} \sum_{j=1}^{m}|A_i|\cdot |A_i \cap A_j|\geq \frac{1}{mn}\left(\sum_{i=1}^{m}|A_i|\right)^3.$$
2008 China Team Selection Test, 3
Let $ S$ be a set that contains $ n$ elements. Let $ A_{1},A_{2},\cdots,A_{k}$ be $ k$ distinct subsets of $ S$, where $ k\geq 2, |A_{i}| \equal{} a_{i}\geq 1 ( 1\leq i\leq k)$. Prove that the number of subsets of $ S$ that don't contain any $ A_{i} (1\leq i\leq k)$ is greater than or equal to $ 2^n\prod_{i \equal{} 1}^k(1 \minus{} \frac {1}{2^{a_{i}}}).$
2023 China Team Selection Test, P11
Let $n\in\mathbb N_+.$ For $1\leq i,j,k\leq n,a_{ijk}\in\{ -1,1\} .$ Prove that: $\exists x_1,x_2,\cdots ,x_n,y_1,y_2,\cdots ,y_n,z_1,z_2,\cdots ,z_n\in \{-1,1\} ,$ satisfy
$$\left| \sum\limits_{i=1}^n\sum\limits_{j=1}^n\sum\limits_{k=1}^na_{ijk}x_iy_jz_k\right| >\frac {n^2}3.$$
[i]Created by Yu Deng[/i]
2024 China Team Selection Test, 1
It is known that each vertex of the convex polyhedron $P$ belongs to three different faces, and each vertex of $P$ can be dyed black and white, so that the two endpoints of each edge of $P$ are different colors. Proof: The interior of each edge of $P$ can be dyed red, yellow, and blue, so that the colors of the three edges connected to each vertex are different, and each face contains two colors of edges.
[i]Created by Liang Xiao[/i]
2019 China Team Selection Test, 4
Call a sequence of positive integers $\{a_n\}$ good if for any distinct positive integers $m,n$, one has
$$\gcd(m,n) \mid a_m^2 + a_n^2 \text{ and } \gcd(a_m,a_n) \mid m^2 + n^2.$$
Call a positive integer $a$ to be $k$-good if there exists a good sequence such that $a_k = a$. Does there exists a $k$ such that there are exactly $2019$ $k$-good positive integers?
2024 China Team Selection Test, 4
Let $n$ be a positive square free integer, $S$ is a subset of $[n]:=\{1,2,\ldots ,n\}$ such that $|S|\ge n/2.$ Prove that there exists three elements $a,b,c\in S$ (can be same), satisfy $ab\equiv c\pmod n.$
[i]Created by Zhenhua Qu[/i]
2023 China Team Selection Test, P1
Given an integer $n \geqslant 2$. Suppose there is a point $P$ inside a convex cyclic $2n$-gon $A_1 \ldots A_{2n}$ satisfying $$\angle PA_1A_2 = \angle PA_2A_3 = \ldots = \angle PA_{2n}A_1,$$prove that $$ \prod_{i=1}^{n} \left|A_{2i - 1}A_{2i} \right| = \prod_{i=1}^{n} \left|A_{2i}A_{2i+1} \right|,$$where $A_{2n + 1} = A_1$.