Found problems: 143
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
Consider the problem of expressing $42$ as \(42 = x^3 + y^3 + z^3 - w^2\), where \(x, y, z, w\) are integers. Determine the number of ways to represent $42$ in this form and prove your conclusion.
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?
2019 China Team Selection Test, 3
Let $n$ be a given even number, $a_1,a_2,\cdots,a_n$ be non-negative real numbers such that $a_1+a_2+\cdots+a_n=1.$ Find the maximum possible value of $\sum_{1\le i<j\le n}\min\{(i-j)^2,(n+i-j)^2\}a_ia_j .$
2001 China Team Selection Test, 2
Let \( \varphi \) be the Euler's totient function.
1. For any given integer \( a > 1 \), does there exist \( l \in \mathbb{N}_+ \) such that for any \( k \in \mathbb{N}_+ \), \( l \mid k \) and \( a^2 \nmid l \), \( \frac{\varphi(k)}{\varphi(l)} \) is a non-negative power of \( a \)?
2. For integer \( x > a \), are there integers \( k_1 \) and \( k_2 \) satisfying:
\[
\varphi(k_i) \in \left ( \frac{x}{a} ,x \right ], i = 1,2; \quad \varphi(k_1) \neq \varphi(k_2).
\]
And these two different \( k_i \) correspond to the same \( l_1 \) and \( l_2 \) as described in (1), yet \( \varphi(l_1) = \varphi(l_2) \).
3. Define \( \#E \) as the number of elements in set \( E \). For integer \( x > a \), let \( V(x) = \#\{v \in \mathbb{N}_+ \mid v = \varphi(k) \leq x\} \) and \( W(x) = \#\{w \in \mathbb{N}_+ \mid w = \varphi(l) \leq x, a^2 \mid l\} \). Compare \( V\left( \frac{x}{a} \right) \) with \( W(x) \).
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.
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$?
2019 China Team Selection Test, 6
Given coprime positive integers $p,q>1$, call all positive integers that cannot be written as $px+qy$(where $x,y$ are non-negative integers) [i]bad[/i], and define $S(p,q)$ to be the sum of all bad numbers raised to the power of $2019$. Prove that there exists a positive integer $n$, such that for any $p,q$ as described, $(p-1)(q-1)$ divides $nS(p,q)$.
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$.
2015 China Team Selection Test, 2
Let $a_1,a_2,a_3, \cdots $ be distinct positive integers, and $0<c<\frac{3}{2}$ . Prove that : There exist infinitely many positive integers $k$, such that $[a_k,a_{k+1}]>ck $.
2025 China Team Selection Test, 23
Let \( n \geq 2 \) be an integer. Two players, Alice and Bob, play the following game on the complete graph \( K_n \): They take turns to perform operations, where each operation consists of coloring one or two edges that have not been colored yet. The game terminates if at any point there exists a triangle whose three edges are all colored.
Prove that there exists a positive number \(\varepsilon\), Alice has a strategy such that, no matter how Bob colors the edges, the game terminates with the number of colored edges not exceeding
\[
\left( \frac{1}{4} - \varepsilon \right) n^2 + n.
\]
2023 China Team Selection Test, P17
Whether there are integers $a_1$, $a_2$, $\cdots$, that are different from each other, satisfying:
(1) For $\forall k\in\mathbb N_+$, $a_{k^2}>0$ and $a_{k^2+k}<0$;
(2) For $\forall n\in\mathbb N_+$, $\left| a_{n+1}-a_n\right|\leqslant 2023\sqrt n$?
2017 China Team Selection Test, 5
A(x,y), B(x,y), and C(x,y) are three homogeneous real-coefficient polynomials of x and y with degree 2, 3, and 4 respectively. we know that there is a real-coefficient polinimial R(x,y) such that $B(x,y)^2-4A(x,y)C(x,y)=-R(x,y)^2$. Proof that there exist 2 polynomials F(x,y,z) and G(x,y,z) such that $F(x,y,z)^2+G(x,y,z)^2=A(x,y)z^2+B(x,y)z+C(x,y)$ if for any x, y, z real numbers $A(x,y)z^2+B(x,y)z+C(x,y)\ge 0$
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?
2013 China Team Selection Test, 3
Let $n>1$ be an integer and let $a_0,a_1,\ldots,a_n$ be non-negative real numbers. Definite $S_k=\sum_{i\equal{}0}^k \binom{k}{i}a_i$ for $k=0,1,\ldots,n$. Prove that\[\frac{1}{n} \sum_{k\equal{}0}^{n-1} S_k^2-\frac{1}{n^2}\left(\sum_{k\equal{}0}^{n} S_k\right)^2\le \frac{4}{45} (S_n-S_0)^2.\]
2021 China Team Selection Test, 3
Find all positive integer $n(\ge 2)$ and rational $\beta \in (0,1)$ satisfying the following:
There exist positive integers $a_1,a_2,...,a_n$, such that for any set $I \subseteq \{1,2,...,n\}$ which contains at least two elements,
$$ S(\sum_{i\in I}a_i)=\beta \sum_{i\in I}S(a_i). $$
where $S(n)$ denotes sum of digits of decimal representation of $n$.
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}\]
2001 China Team Selection Test, 2
If the sum of all positive divisors (including itself) of a positive integer $n$ is $2n$, then $n$ is called a perfect number. For example, the sum of the positive divisors of 6 is $1 + 2 + 3 + 6 = 2 \times 6$, hence 6 is a perfect number.
Prove: There does not exist a perfect number of the form $p^a q^b r^c$, where $a, b, c$ are positive integers, and $p, q, r$ are odd primes.