Found problems: 143
2001 China Team Selection Test, 1
In \( \triangle ABC \) with \( AB > BC \), a tangent to the circumcircle of \( \triangle ABC \) at point \( B \) intersects the extension of \( AC \) at point \( D \). \( E \) is the midpoint of \( BD \), and \( AE \) intersects the circumcircle of \( \triangle ABC \) at \( F \). Prove that \( \angle CBF = \angle BDF \).
2021 China Team Selection Test, 3
Determine the greatest real number $ C $, such that for every positive integer $ n\ge 2 $, there exists $ x_1, x_2,..., x_n \in [-1,1]$, so that
$$\prod_{1\le i<j\le n}(x_i-x_j) \ge C^{\frac{n(n-1)}{2}}$$.
2016 China Team Selection Test, 2
Find the smallest positive number $\lambda $ , such that for any complex numbers ${z_1},{z_2},{z_3}\in\{z\in C\big| |z|<1\}$ ,if $z_1+z_2+z_3=0$, then $$\left|z_1z_2 +z_2z_3+z_3z_1\right|^2+\left|z_1z_2z_3\right|^2 <\lambda .$$
2001 China Team Selection Test, 2
Let \(L_3 = \{3\}\), \(L_n = \{3, 4, \ldots, h\}\) (where \(h > 3\)). For any given integer \(n \geq 3\), consider a graph \(G\) with \(n\) vertices that contains a Hamiltonian cycle \(C\) and has more than \(\frac{n^2}{4}\) edges. For which lengths \(l \in L_n\) must the graph \(G\) necessarily contain a cycle of length \(l\)?
2001 China Team Selection Test, 3
Given sets $A = \{1, 4, 5, 6, 7, 9, 11, 16, 17\}$, $B = \{2, 3, 8, 10, 12, 13, 14, 15, 18\}$, if a positive integer leaves a remainder (the smallest non-negative remainder) that belongs to $A$ when divided by 19, then that positive integer is called an $\alpha$ number. If a positive integer leaves a remainder that belongs to $B$ when divided by 19, then that positive integer is called a $\beta$ number.
(1) For what positive integer $n$, among all its positive divisors, are the numbers of $\alpha$ divisors and $\beta$ divisors equal?
(2) For which positive integers $k$, are the numbers of $\alpha$ divisors less than the numbers of $\beta$ divisors? For which positive integers $l$, are the numbers of $\alpha$ divisors greater than the numbers of $\beta$ divisors?
2014 China Team Selection Test, 4
For any real numbers sequence $\{x_n\}$ ,suppose that $\{y_n\}$ is a sequence such that:
$y_1=x_1, y_{n+1}=x_{n+1}-(\sum\limits_{i = 1}^{n} {x^2_i})^{ \frac{1}{2}}$ ${(n \ge 1})$ .
Find the smallest positive number $\lambda$ such that for any real numbers sequence $\{x_n\}$ and all positive integers $m$ , have $\frac{1}{m}\sum\limits_{i = 1}^{m} {x^2_i}\le\sum\limits_{i = 1}^{m} {\lambda^{m-i}y^2_i} .$
(High School Affiliated to Nanjing Normal University )
2001 China Team Selection Test, 1
Let $k$ be a given integer, $3 < k \leq n$. Consider a graph $G$ with $n$ vertices satisfying the condition: for any two non-adjacent vertices $x$ and $y$ in graph $G$, the sum of their degrees must satisfy $d(x) + d(y) \geq k$. Please answer the following questions and prove your conclusions.
(1) Suppose the length of the longest path in graph $G$ is $l$ satisfying the inequality $3 \leq l < k$, does graph $G$ necessarily contain a cycle of length $l+1$? (The length of a path or cycle refers to the number of edges that make up the path or cycle.)
(2) For the case where $3 < k \leq n-1$ and graph $G$ is connected, can we determine that the length of the longest path in graph $G$, $l \geq k$?
(3) For the case where $3 < k = n-1$, is it necessary for graph $G$ to have a path of length $n-1$ (i.e., a Hamiltonian path)?
2023 China Team Selection Test, P4
Given $m,n\in\mathbb N_+,$ define
$$S(m,n)=\left\{(a,b)\in\mathbb N_+^2\mid 1\leq a\leq m,1\leq b\leq n,\gcd (a,b)=1\right\}.$$
Prove that: for $\forall d,r\in\mathbb N_+,$ there exists $m,n\in\mathbb N_+,m,n\geq d$ and $\left|S(m,n)\right|\equiv r\pmod d.$
1999 China Team Selection Test, 1
For non-negative real numbers $x_1, x_2, \ldots, x_n$ which satisfy $x_1 + x_2 + \cdots + x_n = 1$, find the largest possible value of $\sum_{j = 1}^{n} (x_j^{4} - x_j^{5})$.
2014 China Team Selection Test, 2
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 )
2001 China Team Selection Test, 1
In an acute-angled triangle $\triangle ABC$, construct $\triangle ACD$ and $\triangle BCE$ externally on sides $CA$ and $CB$ respectively, such that $AD=CD$. Let $M$ be the midpoint of $AB$, and connect $DM$ and $EM$. Given that $DM$ is perpendicular to $EM$, set $\frac{AC}{BC} =u$ and $\frac{DM}{EM}=v$. Express $\frac{DC}{EC}$ in terms of $u$ and $v$.
2017 China Team Selection Test, 3
Let $X$ be a set of $100$ elements. Find the smallest possible $n$ satisfying the following condition: Given a sequence of $n$ subsets of $X$, $A_1,A_2,\ldots,A_n$, there exists $1 \leq i < j < k \leq n$ such that
$$A_i \subseteq A_j \subseteq A_k \text{ or } A_i \supseteq A_j \supseteq A_k.$$
2001 China Team Selection Test, 1
In \( \triangle ABC \) with \( AB > BC \), a tangent to the circumcircle of \( \triangle ABC \) at point \( B \) intersects the extension of \( AC \) at point \( D \). \( E \) is the midpoint of \( BD \), and \( AE \) intersects the circumcircle of \( \triangle ABC \) at \( F \). Prove that \( \angle CBF = \angle BDF \).
2015 China Team Selection Test, 2
Let $a_1,a_2,a_3, \cdots ,a_n$ be positive real numbers. For the integers $n\ge 2$, prove that\[ \left (\frac{\sum_{j=1}^{n} \left (\prod_{k=1}^{j}a_k \right )^{\frac{1}{j}}}{\sum_{j=1}^{n}a_j} \right )^{\frac{1}{n}}+\frac{\left (\prod_{i=1}^{n}a_i \right )^{\frac{1}{n}}}{\sum_{j=1}^{n} \left (\prod_{k=1}^{j}a_k \right )^{\frac{1}{j}}}\le \frac{n+1}{n}\]
2015 China Team Selection Test, 4
Prove that : For each integer $n \ge 3$, there exists the positive integers $a_1<a_2< \cdots <a_n$ , such that for $ i=1,2,\cdots,n-2 $ , With $a_{i},a_{i+1},a_{i+2}$ may be formed as a triangle side length , and the area of the triangle is a positive integer.
2016 China Team Selection Test, 2
In the coordinate plane the points with both coordinates being rational numbers are called rational points. For any positive integer $n$, is there a way to use $n$ colours to colour all rational points, every point is coloured one colour, such that any line segment with both endpoints being rational points contains the rational points of every colour?
2017 China Team Selection Test, 2
Let $x>1$ ,$n$ be positive integer. Prove that$$\sum_{k=1}^{n}\frac{\{kx \}}{[kx]}<\sum_{k=1}^{n}\frac{1}{2k-1}$$
Where $[kx ]$ be the integer part of $kx$ ,$\{kx \}$ be the decimal part of $kx$.
2018 China Team Selection Test, 2
A number $n$ is [i]interesting[/i] if 2018 divides $d(n)$ (the number of positive divisors of $n$). Determine all positive integers $k$ such that there exists an infinite arithmetic progression with common difference $k$ whose terms are all interesting.
2013 China Team Selection Test, 1
Let $n$ and $k$ be two integers which are greater than $1$. Let $a_1,a_2,\ldots,a_n,c_1,c_2,\ldots,c_m$ be non-negative real numbers such that
i) $a_1\ge a_2\ge\ldots\ge a_n$ and $a_1+a_2+\ldots+a_n=1$;
ii) For any integer $m\in\{1,2,\ldots,n\}$, we have that $c_1+c_2+\ldots+c_m\le m^k$.
Find the maximum of $c_1a_1^k+c_2a_2^k+\ldots+c_na_n^k$.
2023 China Team Selection Test, P12
Prove that there exists some positive real number $\lambda$ such that for any $D_{>1}\in\mathbb{R}$, one can always find an acute triangle $\triangle ABC$ in the Cartesian plane such that [list] [*] $A, B, C$ lie on lattice points; [*] $AB, BC, CA>D$; [*] $S_{\triangle ABC}<\frac{\sqrt 3}{4}D^2+\lambda\cdot D^{4/5}$.
2019 China Team Selection Test, 4
Does there exist a finite set $A$ of positive integers of at least two elements and an infinite set $B$ of positive integers, such that any two distinct elements in $A+B$ are coprime, and for any coprime positive integers $m,n$, there exists an element $x$ in $A+B$ satisfying $x\equiv n \pmod m$ ?
Here $A+B=\{a+b|a\in A, b\in B\}$.
2023 China Team Selection Test, P2
$n$ people attend a party. There are no more than $n$ pairs of friends among them.
Two people shake hands if and only if they have at least $1$ common friend.
Given integer $m\ge 3$ such that $n\leq m^3$.
Prove that there exists a person $A$, the number of people that shake hands with $A$ is no more than $m-1$ times of the number of $A$‘S friends.
2001 China Team Selection Test, 1
In an acute-angled triangle $\triangle ABC$, construct $\triangle ACD$ and $\triangle BCE$ externally on sides $CA$ and $CB$ respectively, such that $AD=CD$. Let $M$ be the midpoint of $AB$, and connect $DM$ and $EM$. Given that $DM$ is perpendicular to $EM$, set $\frac{AC}{BC} =u$ and $\frac{DM}{EM}=v$. Express $\frac{DC}{EC}$ in terms of $u$ and $v$.
2017 China Team Selection Test, 3
Find the numbers of ordered array $(x_1,...,x_{100})$ that satisfies the following conditions:
($i$)$x_1,...,x_{100}\in\{1,2,..,2017\}$;
($ii$)$2017|x_1+...+x_{100}$;
($iii$)$2017|x_1^2+...+x_{100}^2$.
2013 China Team Selection Test, 2
Let $k\ge 2$ be an integer and let $a_1 ,a_2 ,\cdots ,a_n,b_1 ,b_2 ,\cdots ,b_n$ be non-negative real numbers. Prove that\[\left(\frac{n}{n-1}\right)^{n-1}\left(\frac{1}{n} \sum_{i\equal{}1}^{n} a_i^2\right)+\left(\frac{1}{n} \sum_{i\equal{}1}^{n} b_i\right)^2\ge\prod_{i=1}^{n}(a_i^{2}+b_i^{2})^{\frac{1}{n}}.\]