Part 1: Fill-in-the-Blank Problems#
Problem 1#
Question: Among 12 uniformly distributed points on a circle, the number of obtuse triangles that can be formed by choosing any 3 points is 120 ‾ \underline{120} 120 .
An inscribed triangle is obtuse if and only if its three vertices lie within the same open semicircular arc; that is, the span of the three points is no more than 5 equal arc intervals.
Let the first vertex be A A A (12 choices), and let the clockwise span be k ∈ { 2 , 3 , 4 , 5 } k \in \{2, 3, 4, 5\} k ∈ { 2 , 3 , 4 , 5 } , with the farthest endpoint denoted by C C C .
The intermediate vertex B B B can be chosen in k − 1 k - 1 k − 1 ways between A A A and C C C .
Therefore,
12 × ∑ k = 2 5 ( k − 1 ) = 12 × ( 1 + 2 + 3 + 4 ) = 12 × 10 = 120 12 \times \sum_{k=2}^5 (k - 1) = 12 \times (1 + 2 + 3 + 4) = 12 \times 10 = \mathbf{120} 12 × k = 2 ∑ 5 ( k − 1 ) = 12 × ( 1 + 2 + 3 + 4 ) = 12 × 10 = 120
(Alternatively, use the complement method: the total number is ( 12 3 ) = 220 \binom{12}{3} = 220 ( 3 12 ) = 220 , the number of right triangles is 6 × 10 = 60 6 \times 10 = 60 6 × 10 = 60 , and the number of acute triangles is 40 40 40 . Thus, the number of obtuse triangles is 220 − 60 − 40 = 120 220 - 60 - 40 = 120 220 − 60 − 40 = 120 .)
Problem 2#
Question: Let A = { 1 , 2 , 3 , 4 } A = \{1, 2, 3, 4\} A = { 1 , 2 , 3 , 4 } and B = { 5 , 6 , 7 } B = \{5, 6, 7\} B = { 5 , 6 , 7 } . If f : A → B f: A \to B f : A → B , the probability that f f f is non-increasing is 5 27 ‾ \underline{\dfrac{5}{27}} 27 5 .
The total number of functions is the total number of mappings from A A A to B B B :
∣ B ∣ ∣ A ∣ = 3 4 = 81 |B|^{|A|} = 3^4 = 81 ∣ B ∣ ∣ A ∣ = 3 4 = 81
For f f f to be non-increasing, we require
f ( 1 ) ≥ f ( 2 ) ≥ f ( 3 ) ≥ f ( 4 ) f(1) \ge f(2) \ge f(3) \ge f(4) f ( 1 ) ≥ f ( 2 ) ≥ f ( 3 ) ≥ f ( 4 )
This is equivalent to choosing 4 elements from B = { 5 , 6 , 7 } B = \{5, 6, 7\} B = { 5 , 6 , 7 } with repetition allowed and arranging them in non-increasing order:
Number of admissible sequences = ( 4 + 3 − 1 4 ) = ( 6 4 ) = 15 \text{Number of admissible sequences} = \binom{4 + 3 - 1}{4} = \binom{6}{4} = 15 Number of admissible sequences = ( 4 4 + 3 − 1 ) = ( 4 6 ) = 15
Hence,
P = 15 81 = 5 27 P = \dfrac{15}{81} = \mathbf{\dfrac{5}{27}} P = 81 15 = 27 5
Problem 3#
Question: Let f ( x ) = e x + 4 x f(x) = \mathrm{e}^x + 4x f ( x ) = e x + 4 x and g ( x ) = ln x + 2 x g(x) = \ln x + 2x g ( x ) = ln x + 2 x . The number of lines tangent to both curves y = f ( x ) y = f(x) y = f ( x ) and y = g ( x ) y = g(x) y = g ( x ) is 1 ‾ \underline{1} 1 .
Let the tangency points be ( x 1 , f ( x 1 ) ) (x_1, f(x_1)) ( x 1 , f ( x 1 )) and ( x 2 , g ( x 2 ) ) (x_2, g(x_2)) ( x 2 , g ( x 2 )) , where x 2 > 0 x_2 > 0 x 2 > 0 .
Equal slopes give
f ′ ( x 1 ) = g ′ ( x 2 ) ⟹ e x 1 + 4 = 1 x 2 + 2 ⟹ x 2 = 1 e x 1 + 2 f'(x_1) = g'(x_2) \implies \mathrm{e}^{x_1} + 4 = \dfrac{1}{x_2} + 2 \implies x_2 = \dfrac{1}{\mathrm{e}^{x_1} + 2} f ′ ( x 1 ) = g ′ ( x 2 ) ⟹ e x 1 + 4 = x 2 1 + 2 ⟹ x 2 = e x 1 + 2 1
Equal intercepts give
f ( x 1 ) − x 1 f ′ ( x 1 ) = g ( x 2 ) − x 2 g ′ ( x 2 ) f(x_1) - x_1 f'(x_1) = g(x_2) - x_2 g'(x_2) f ( x 1 ) − x 1 f ′ ( x 1 ) = g ( x 2 ) − x 2 g ′ ( x 2 )
After simplification, we obtain the following equation in x 1 x_1 x 1 :
h ( x 1 ) = e x 1 ( 1 − x 1 ) + ln ( e x 1 + 2 ) + 1 = 0 h(x_1) = \mathrm{e}^{x_1}(1 - x_1) + \ln(\mathrm{e}^{x_1} + 2) + 1 = 0 h ( x 1 ) = e x 1 ( 1 − x 1 ) + ln ( e x 1 + 2 ) + 1 = 0
Its derivative is
h ′ ( x ) = e x ( 1 e x + 2 − x ) h'(x) = \mathrm{e}^x\left(\dfrac{1}{\mathrm{e}^x + 2} - x\right) h ′ ( x ) = e x ( e x + 2 1 − x )
It is readily seen that h ′ ( x ) h'(x) h ′ ( x ) has exactly one zero, x 0 x_0 x 0 , in ( 0 , 1 ) (0, 1) ( 0 , 1 ) , so the function first increases and then decreases.
As x → − ∞ x \to -\infty x → − ∞ ,
h ( x ) → ln 2 + 1 > 0 h(x) \to \ln 2 + 1 > 0 h ( x ) → ln 2 + 1 > 0
Moreover, h ( x 0 ) > 0 h(x_0) > 0 h ( x 0 ) > 0 , while as x → + ∞ x \to +\infty x → + ∞ ,
h ( x ) → − ∞ h(x) \to -\infty h ( x ) → − ∞
Therefore, the equation has no solution on ( − ∞ , x 0 ) (-\infty, x_0) ( − ∞ , x 0 ) and exactly one real root on ( x 0 , + ∞ ) (x_0, +\infty) ( x 0 , + ∞ ) , where h h h is strictly decreasing. Thus, there is exactly one common tangent.
Problem 4#
Question: Let a n a_n a n be the integer closest to n \sqrt{n} n . The sum of the first 2026 terms of the sequence { a n } \{a_n\} { a n } is 60810 ‾ \underline{60810} 60810 .
a n = k ⟺ k − 1 2 < n < k + 1 2 ⟺ k 2 − k + 1 ≤ n ≤ k 2 + k a_n = k \iff k - \dfrac{1}{2} < \sqrt{n} < k + \dfrac{1}{2} \iff k^2 - k + 1 \le n \le k^2 + k a n = k ⟺ k − 2 1 < n < k + 2 1 ⟺ k 2 − k + 1 ≤ n ≤ k 2 + k
The value k k k therefore occurs exactly
( k 2 + k ) − ( k 2 − k ) = 2 k (k^2 + k) - (k^2 - k) = 2k ( k 2 + k ) − ( k 2 − k ) = 2 k
times.
The total number of terms in the first m m m groups is
∑ k = 1 m 2 k = m ( m + 1 ) \sum_{k=1}^m 2k = m(m+1) k = 1 ∑ m 2 k = m ( m + 1 )
Taking m = 44 m = 44 m = 44 , the number of terms is
44 × 45 = 1980 44 \times 45 = 1980 44 × 45 = 1980
The sum of the first 44 groups is
∑ k = 1 44 k ⋅ 2 k = 2 ∑ k = 1 44 k 2 = 2 × 44 × 45 × 89 6 = 58740 \sum_{k=1}^{44} k \cdot 2k = 2\sum_{k=1}^{44} k^2 = 2 \times \frac{44 \times 45 \times 89}{6} = 58740 k = 1 ∑ 44 k ⋅ 2 k = 2 k = 1 ∑ 44 k 2 = 2 × 6 44 × 45 × 89 = 58740
The number of remaining terms is
2026 − 1980 = 46 2026 - 1980 = 46 2026 − 1980 = 46
All these 46 terms have value 45. Hence,
S 2026 = 58740 + 46 × 45 = 58740 + 2070 = 60810 S_{2026} = 58740 + 46 \times 45 = 58740 + 2070 = \mathbf{60810} S 2026 = 58740 + 46 × 45 = 58740 + 2070 = 60810
Problem 5#
Question: Suppose ( x 2 − x + 1 ) 2026 = a 0 + a 1 x + a 2 x 2 + ⋯ + a 2026 x 2026 (x^2 - x + 1)^{2026} = a_0 + a_1 x + a_2 x^2 + \cdots + a_{2026}x^{2026} ( x 2 − x + 1 ) 2026 = a 0 + a 1 x + a 2 x 2 + ⋯ + a 2026 x 2026 . Then
2 a 0 + 3 a 1 + 4 a 2 + ⋯ + 2028 a 2026 = ‾ 2a_0 + 3a_1 + 4a_2 + \cdots + 2028a_{2026} = \underline{\qquad} 2 a 0 + 3 a 1 + 4 a 2 + ⋯ + 2028 a 2026 =
Let
P ( x ) = ( x 2 − x + 1 ) 2026 = a 0 + a 1 x + a 2 x 2 + ⋯ + a n x n P(x)=(x^2-x+1)^{2026}=a_0+a_1x+a_2x^2+\cdots+a_nx^n P ( x ) = ( x 2 − x + 1 ) 2026 = a 0 + a 1 x + a 2 x 2 + ⋯ + a n x n
For the expression to be evaluated,
S = 2 a 0 + 3 a 1 + 4 a 2 + ⋯ + ( n + 2 ) a n S=2a_0+3a_1+4a_2+\cdots+(n+2)a_n S = 2 a 0 + 3 a 1 + 4 a 2 + ⋯ + ( n + 2 ) a n
Term decomposition
That is,
S = ∑ k = 0 n k a k + 2 ∑ k = 0 n a k S=\sum\limits_{k=0}^nka_k+2\sum\limits_{k=0}^na_k S = k = 0 ∑ n k a k + 2 k = 0 ∑ n a k
Set x = 1 x=1 x = 1 :
P ( 1 ) = a 0 + a 1 + a 2 + ⋯ + a n = 1 P(1)=a_0+a_1+a_2+\dots+a_n=1 P ( 1 ) = a 0 + a 1 + a 2 + ⋯ + a n = 1
Differentiate P ( x ) P(x) P ( x ) :
P ′ ( x ) = a 1 + 2 a 2 x + 3 a 3 x 2 + ⋯ + n a n x n − 1 P'(x)=a_1+2a_2x+3a_3x^2+\dots+na_nx^{n-1} P ′ ( x ) = a 1 + 2 a 2 x + 3 a 3 x 2 + ⋯ + n a n x n − 1
Substituting x = 1 x=1 x = 1 gives
P ′ ( 1 ) = a 1 + 2 a 2 + 3 a 3 + ⋯ + n a n = ∑ k = 0 n k a k P'(1)=a_1+2a_2+3a_3+\dots+na_n=\sum\limits_{k=0}^nka_k P ′ ( 1 ) = a 1 + 2 a 2 + 3 a 3 + ⋯ + n a n = k = 0 ∑ n k a k
Also,
P ′ ( x ) = 2026 ( x 2 − x + 1 ) 2025 ⋅ ( 2 x − 1 ) P'(x)=2026(x^2-x+1)^{2025}\cdot(2x-1) P ′ ( x ) = 2026 ( x 2 − x + 1 ) 2025 ⋅ ( 2 x − 1 )
Thus, at x = 1 x=1 x = 1 ,
P ′ ( 1 ) = 2026 P'(1)=2026 P ′ ( 1 ) = 2026
Therefore,
S = P ′ ( 1 ) + 2 P ( 1 ) = 2026 + 2 = 2028 S=P'(1)+2P(1)=2026+2=2028 S = P ′ ( 1 ) + 2 P ( 1 ) = 2026 + 2 = 2028
Constructive method
Because the coefficient index differs from the coefficient by 2, multiply both sides by x 2 x^2 x 2 :
x 2 P ( x ) = a 0 x 2 + a 1 x 3 + a 2 x 4 + ⋯ + a n x n + 1 x^2P(x)=a_0x^2+a_1x^3+a_2x^4+\dots+a_nx^{n+1} x 2 P ( x ) = a 0 x 2 + a 1 x 3 + a 2 x 4 + ⋯ + a n x n + 1
Differentiate the left-hand side:
d [ x 2 P ( x ) ] d x = 2 x P ( x ) + x 2 P ′ ( x ) \frac{\mathrm{d}[x^2P(x)]}{\mathrm{d}x}=2xP(x)+x^2P'(x) d x d [ x 2 P ( x )] = 2 x P ( x ) + x 2 P ′ ( x )
Setting x = 1 x=1 x = 1 yields
S = 2 P ( 1 ) + P ′ ( 1 ) = 2 × 1 + 2026 = 2028 S=2P(1)+P'(1)=2\times 1+2026=2028 S = 2 P ( 1 ) + P ′ ( 1 ) = 2 × 1 + 2026 = 2028
Problem 6#
Question: A rectangle has length 12 and width 8. If a semicircle can be placed entirely inside the rectangle, the maximum possible area of the semicircle is ( 296 − 160 3 ) π ‾ \underline{(296 - 160\sqrt{3})\pi} ( 296 − 160 3 ) π .
Oblique placement:
Place the semicircle at an angle such that its arc is tangent simultaneously to one long side and one short side of the rectangle, while the two endpoints of its diameter lie on the other two sides.
Suppose the center of the circle is ( r , r ) (r, r) ( r , r ) , and the two endpoints of the diameter lie on x = m x = m x = m and y = n y = n y = n . The radius satisfies
( m − r ) 2 + ( n − r ) 2 = r 2 (m-r)^2+(n-r)^2=r^2 ( m − r ) 2 + ( n − r ) 2 = r 2
or equivalently,
r 2 − 2 ( m + n ) r + ( m 2 + n 2 ) = 0 r^2-2(m+n)r+(m^2+n^2)=0 r 2 − 2 ( m + n ) r + ( m 2 + n 2 ) = 0
The maximum radius is therefore
r = m + n − 2 m n = 12 + 8 − 192 = 20 − 8 3 ≈ 6.1436 > 6 r=m+n-\sqrt{2mn}=12+8-\sqrt{192}=20-8\sqrt{3}\approx 6.1436>6 r = m + n − 2 mn = 12 + 8 − 192 = 20 − 8 3 ≈ 6.1436 > 6
The maximum area is
S = 1 2 π r 2 = ( 296 − 160 3 ) π ≈ 18.87 π ≈ 59.29 S=\dfrac{1}{2}\pi r^2=\mathbf{(296-160\sqrt{3})\pi}\approx18.87\pi\approx59.29 S = 2 1 π r 2 = ( 296 − 160 3 ) π ≈ 18.87 π ≈ 59.29
Problem 7#
Question: Let f ( x ) f(x) f ( x ) be a function defined on R \mathbf{R} R satisfying f ( 0 ) = 0 f(0)=0 f ( 0 ) = 0 , f ( x ) + f ( 1 − x ) = 1 f(x)+f(1-x)=1 f ( x ) + f ( 1 − x ) = 1 , f ( x ) = 2 f ( x 5 ) f(x)=2f\left(\dfrac{x}{5}\right) f ( x ) = 2 f ( 5 x ) , and, whenever 0 ≤ x 1 ≤ x 2 ≤ 1 0\le x_1\le x_2\le1 0 ≤ x 1 ≤ x 2 ≤ 1 , f ( x 1 ) ≤ f ( x 2 ) f(x_1)\le f(x_2) f ( x 1 ) ≤ f ( x 2 ) . Then
f ( 1 2026 ) = 1 32 ‾ f\left(\dfrac{1}{2026}\right)=\underline{\frac{1}{32}} f ( 2026 1 ) = 32 1
Since f ( 0 ) = 0 f(0)=0 f ( 0 ) = 0 ,
f ( 1 ) = 1 − f ( 0 ) = 1 f(1)=1-f(0)=1 f ( 1 ) = 1 − f ( 0 ) = 1
Then
f ( 1 ) = 2 f ( 1 / 5 ) ⟹ f ( 1 / 5 ) = 1 / 2 f(1)=2f(1/5)\implies f(1/5)=1/2 f ( 1 ) = 2 f ( 1/5 ) ⟹ f ( 1/5 ) = 1/2
By symmetry,
f ( 4 / 5 ) = 1 − f ( 1 / 5 ) = 1 / 2 f(4/5)=1-f(1/5)=1/2 f ( 4/5 ) = 1 − f ( 1/5 ) = 1/2
Combined with monotonicity, this shows that f ( x ) f(x) f ( x ) is identically 1 / 2 1/2 1/2 on [ 1 5 , 4 5 ] \left[\dfrac{1}{5},\dfrac{4}{5}\right] [ 5 1 , 5 4 ] (a Cantor-like quinary staircase function).
By the recursive relation, when
x ∈ [ 1 5 k + 1 , 4 5 k + 1 ] x\in\left[\dfrac{1}{5^{k+1}},\dfrac{4}{5^{k+1}}\right] x ∈ [ 5 k + 1 1 , 5 k + 1 4 ]
we have
5 k x ∈ [ 1 5 , 4 5 ] 5^kx\in\left[\dfrac{1}{5},\dfrac{4}{5}\right] 5 k x ∈ [ 5 1 , 5 4 ]
and therefore
f ( x ) = 1 2 k f ( 5 k x ) = 1 2 k + 1 f(x)=\frac{1}{2^k}f(5^kx)=\frac{1}{2^{k+1}} f ( x ) = 2 k 1 f ( 5 k x ) = 2 k + 1 1
Take k = 4 k=4 k = 4 . Then the interval is
[ 1 3125 , 4 3125 ] = [ 1 3125 , 1 781.25 ] \left[\dfrac{1}{3125},\dfrac{4}{3125}\right]
=
\left[\dfrac{1}{3125},\dfrac{1}{781.25}\right] [ 3125 1 , 3125 4 ] = [ 3125 1 , 781.25 1 ]
Since
781.25 < 2026 < 3125 781.25<2026<3125 781.25 < 2026 < 3125
we have
1 2026 ∈ [ 1 3125 , 4 3125 ] \frac{1}{2026}\in
\left[\dfrac{1}{3125},\dfrac{4}{3125}\right] 2026 1 ∈ [ 3125 1 , 3125 4 ]
Consequently,
f ( 1 2026 ) = 1 2 4 + 1 = 1 32 f\left(\frac{1}{2026}\right)
=
\frac{1}{2^{4+1}}
=
\mathbf{\frac{1}{32}} f ( 2026 1 ) = 2 4 + 1 1 = 32 1
Problem 9#
Question: Let S = { 1 , 2 , ⋯ , 2026 } S=\{1,2,\cdots,2026\} S = { 1 , 2 , ⋯ , 2026 } . The number of two-element sets { A , B } \{A,B\} { A , B } satisfying A , B ⊆ S A,B\subseteq S A , B ⊆ S and A ∩ B = ∅ A\cap B=\emptyset A ∩ B = ∅ is
3 2026 − 1 2 ‾ \underline{\dfrac{3^{2026}-1}{2}} 2 3 2026 − 1
First consider ordered pairs ( A , B ) (A,B) ( A , B ) satisfying A ∩ B = ∅ A\cap B=\emptyset A ∩ B = ∅ . Each element of S S S has three possible assignments: it belongs to A A A , it belongs to B B B , or it belongs to neither. Thus, there are
3 2026 3^{2026} 3 2026
ordered pairs.
The problem requires { A , B } \{A,B\} { A , B } to be a two-element set , meaning that it is unordered and its two elements are distinct, so A ≠ B A\ne B A = B .
If A = B A=B A = B and A ∩ B = ∅ A\cap B=\emptyset A ∩ B = ∅ , then
A = B = ∅ A=B=\emptyset A = B = ∅
Thus, only the pair ( ∅ , ∅ ) (\emptyset,\emptyset) ( ∅ , ∅ ) must be excluded.
After removing this identical case, divide by 2 to account for unordered pairs:
3 2026 − 1 2 \dfrac{3^{2026}-1}{2} 2 3 2026 − 1
Problem 10#
Question: Given { sin θ , sin 2 θ , sin 3 θ } = { cos θ , cos 2 θ , cos 3 θ } \{\sin\theta,\sin 2\theta,\sin 3\theta\} = \{\cos\theta,\cos 2\theta,\cos 3\theta\} { sin θ , sin 2 θ , sin 3 θ } = { cos θ , cos 2 θ , cos 3 θ } , determine θ \theta θ .
The sums of the elements of the two sets are equal:
( sin θ + sin 3 θ ) + sin 2 θ = ( cos θ + cos 3 θ ) + cos 2 θ (\sin\theta+\sin3\theta)+\sin2\theta
=
(\cos\theta+\cos3\theta)+\cos2\theta ( sin θ + sin 3 θ ) + sin 2 θ = ( cos θ + cos 3 θ ) + cos 2 θ
Using the sum-to-product identities,
2 sin 2 θ cos θ + sin 2 θ = 2 cos 2 θ cos θ + cos 2 θ 2\sin2\theta\cos\theta+\sin2\theta
=
2\cos2\theta\cos\theta+\cos2\theta 2 sin 2 θ cos θ + sin 2 θ = 2 cos 2 θ cos θ + cos 2 θ
Therefore,
( 2 cos θ + 1 ) ( sin 2 θ − c o s 2 θ ) = 0 (2\cos\theta+1)(\sin2\theta-\\cos2\theta)=0 ( 2 cos θ + 1 ) ( sin 2 θ − cos 2 θ ) = 0
If
2 cos θ + 1 = 0 2\cos\theta+1=0 2 cos θ + 1 = 0
then cos θ = − 1 / 2 \cos\theta=-1/2 cos θ = − 1/2 . In this case, the resulting collection contains repeated elements and therefore does not satisfy the definition of a set with distinct elements; this case is discarded.
If
sin 2 θ = cos 2 θ \sin2\theta=\cos2\theta sin 2 θ = cos 2 θ
then
tan 2 θ = 1 ⟹ 2 θ = π 4 + k π ⟹ θ = π 8 + k π 2 \tan2\theta=1
\implies
2\theta=\dfrac{\pi}{4}+k\pi
\implies
\theta=\dfrac{\pi}{8}+\dfrac{k\pi}{2} tan 2 θ = 1 ⟹ 2 θ = 4 π + k π ⟹ θ = 8 π + 2 k π
where k ∈ Z k\in\mathbb{Z} k ∈ Z .
Verification: when θ = π / 8 \theta=\pi/8 θ = π /8 , both sets are
{ sin π 8 , 2 2 , cos π 8 } \left\{\sin\dfrac{\pi}{8},\dfrac{\sqrt{2}}{2},\cos\dfrac{\pi}{8}\right\} { sin 8 π , 2 2 , cos 8 π }
whose elements are distinct, so the two sets are indeed equal. Hence,
θ = π 8 + k π 2 , k ∈ Z \boxed{\theta=\dfrac{\pi}{8}+\dfrac{k\pi}{2},\quad k\in\mathbb{Z}} θ = 8 π + 2 k π , k ∈ Z
Part 2: Analytical Problem#
Question: Solve the inequality
1 x + 1 ≤ 1 3 x x − 1 \dfrac{1}{\sqrt{x+1}}
\le
\dfrac{1}{3}\sqrt{\dfrac{x}{x-1}} x + 1 1 ≤ 3 1 x − 1 x
Domain:
x + 1 > 0 ⟹ x > − 1 x+1>0\implies x>-1 x + 1 > 0 ⟹ x > − 1 ;
x x − 1 ≥ 0 ⟹ x ≤ 0 \dfrac{x}{x-1}\ge0\implies x\le0 x − 1 x ≥ 0 ⟹ x ≤ 0 or x > 1 x>1 x > 1 ;
Therefore, the domain is ( − 1 , 0 ] ∪ ( 1 , + i n f t y ) (-1,0]\cup(1,+\\infty) ( − 1 , 0 ] ∪ ( 1 , + in f t y ) .
When x = 0 x=0 x = 0 , the left-hand side is 1 1 1 and the right-hand side is 0 0 0 , so 1 ≤ 0 1\le0 1 ≤ 0 is false. Thus, x = 0 x=0 x = 0 is excluded.
When x ∈ ( − 1 , 0 ) x\in(-1,0) x ∈ ( − 1 , 0 ) , both sides are positive, so we may square both sides:
1 x + 1 ≤ x 9 ( x − 1 ) \dfrac{1}{x+1}\le\dfrac{x}{9(x-1)} x + 1 1 ≤ 9 ( x − 1 ) x
Since x − 1 < 0 x-1<0 x − 1 < 0 , clearing denominators reverses the inequality:
9 ( x − 1 ) ≥ x ( x + 1 ) ⟹ x 2 − 8 x + 9 ≤ 0 9(x-1)\ge x(x+1)
\implies
x^2-8x+9\le0 9 ( x − 1 ) ≥ x ( x + 1 ) ⟹ x 2 − 8 x + 9 ≤ 0
The discriminant is
Δ = 28 \Delta=28 Δ = 28
and the two roots are
4 ± 7 > 1 4\pm\sqrt7>1 4 ± 7 > 1
so there is no solution in ( − 1 , 0 ) (-1,0) ( − 1 , 0 ) .
When x ∈ ( 1 , + ∞ ) x\in(1,+\infty) x ∈ ( 1 , + ∞ ) , clearing denominators preserves the direction of the inequality:
9 ( x − 1 ) ≤ x ( x + 1 ) ⟹ x 2 − 8 x + 9 ≥ 0 9(x-1)\le x(x+1)
\implies
x^2-8x+9\ge0 9 ( x − 1 ) ≤ x ( x + 1 ) ⟹ x 2 − 8 x + 9 ≥ 0
Thus,
x ≤ 4 − 7 or x ≥ 4 + 7 x\le4-\sqrt7
\quad\text{or}\quad
x\ge4+\sqrt7 x ≤ 4 − 7 or x ≥ 4 + 7
Since
4 − 7 ≈ 1.354 > 1 4-\sqrt7\approx1.354>1 4 − 7 ≈ 1.354 > 1
combining this with the domain gives
x ∈ ( 1 , 4 − 7 ] ∪ [ 4 + 7 , + ∞ ) \boxed{x\in(1,4-\sqrt7]\cup[4+\sqrt7,+\infty)} x ∈ ( 1 , 4 − 7 ] ∪ [ 4 + 7 , + ∞ )
Part 3: Analytical Problem#
Question: Find the product of the distances from one vertex of a regular 2026-gon inscribed in the unit circle to the other 2025 vertices.
Place the regular n n n -gon on the unit circle in the complex plane. Its vertices are the roots of
z n − 1 = 0 z^n-1=0 z n − 1 = 0
namely,
ω k = e i 2 k π n ( k = 0 , 1 , … , n − 1 ) \omega_k=\mathrm{e}^{\mathrm{i}\frac{2k\pi}{n}}
\quad
(k=0,1,\dots,n-1) ω k = e i n 2 k π ( k = 0 , 1 , … , n − 1 )
Take the reference vertex to be z = 1 z=1 z = 1 , corresponding to k = 0 k=0 k = 0 . Its distances to the other vertices are ∣ 1 − ω k ∣ |1-\omega_k| ∣1 − ω k ∣ .
Using the algebraic identity
z n − 1 = ( z − 1 ) ( z n − 1 + z n − 2 + ⋯ + z + 1 ) = ( z − 1 ) ∏ k = 1 n − 1 ( z − ω k ) z^n-1
=
(z-1)(z^{n-1}+z^{n-2}+\cdots+z+1)
=
(z-1)\prod_{k=1}^{n-1}(z-\omega_k) z n − 1 = ( z − 1 ) ( z n − 1 + z n − 2 + ⋯ + z + 1 ) = ( z − 1 ) k = 1 ∏ n − 1 ( z − ω k )
for z ≠ 1 z\ne1 z = 1 , divide both sides by z − 1 z-1 z − 1 :
∏ k = 1 n − 1 ( z − ω k ) = z n − 1 + z n − 2 + ⋯ + z + 1 \prod_{k=1}^{n-1}(z-\omega_k)
=
z^{n-1}+z^{n-2}+\cdots+z+1 k = 1 ∏ n − 1 ( z − ω k ) = z n − 1 + z n − 2 + ⋯ + z + 1
Taking the limit as z → 1 z\to1 z → 1 and then taking absolute values on both sides gives
∏ k = 1 n − 1 ∣ 1 − ω k ∣ = ∣ 1 + 1 + ⋯ + 1 ∣ = n \prod_{k=1}^{n-1}|1-\omega_k|
=
|1+1+\cdots+1|
=
n k = 1 ∏ n − 1 ∣1 − ω k ∣ = ∣1 + 1 + ⋯ + 1∣ = n
For n = 2026 n=2026 n = 2026 , the required product is
2026 \boxed{2026} 2026
Part 4: Analytical Problem#
Question: Let the sequence { x n } \{x_n\} { x n } satisfy
∣ x n − x n + 1 2 ∣ ≤ 1 \left|x_n-\dfrac{x_{n+1}}{2}\right|\le1 x n − 2 x n + 1 ≤ 1
and
∣ x n ∣ ≤ ( 3 2 ) n |x_n|\le\left(\dfrac{3}{2}\right)^n ∣ x n ∣ ≤ ( 2 3 ) n
Prove that
∣ x n ∣ ≤ 2 |x_n|\le2 ∣ x n ∣ ≤ 2
By the triangle inequality,
∣ x n ∣ ≤ 1 + 1 2 ∣ x n + 1 ∣ |x_n|\le1+\dfrac{1}{2}|x_{n+1}| ∣ x n ∣ ≤ 1 + 2 1 ∣ x n + 1 ∣
Iterating this inequality backward k k k times gives
∣ x n ∣ ≤ 1 + 1 2 + 1 4 + ⋯ + 1 2 k − 1 + 1 2 k ∣ x n + k ∣ = 2 ( 1 − 1 2 k ) + 1 2 k ∣ x n + k ∣ |x_n|
\le
1+\frac12+\frac14+\cdots+\frac{1}{2^{k-1}}
+\frac{1}{2^k}|x_{n+k}|
=
2\left(1-\frac{1}{2^k}\right)
+\frac{1}{2^k}|x_{n+k}| ∣ x n ∣ ≤ 1 + 2 1 + 4 1 + ⋯ + 2 k − 1 1 + 2 k 1 ∣ x n + k ∣ = 2 ( 1 − 2 k 1 ) + 2 k 1 ∣ x n + k ∣
Using the given growth bound,
∣ x n + k ∣ ≤ ( 3 2 ) n + k |x_{n+k}|
\le
\left(\dfrac32\right)^{n+k} ∣ x n + k ∣ ≤ ( 2 3 ) n + k
Therefore,
1 2 k ∣ x n + k ∣ ≤ 1 2 k ( 3 2 ) n + k = ( 3 2 ) n ( 3 4 ) k \frac{1}{2^k}|x_{n+k}|
\le
\frac{1}{2^k}\left(\frac32\right)^{n+k}
=
\left(\frac32\right)^n\left(\frac34\right)^k 2 k 1 ∣ x n + k ∣ ≤ 2 k 1 ( 2 3 ) n + k = ( 2 3 ) n ( 4 3 ) k
Since the common ratio satisfies
3 4 < 1 \frac34<1 4 3 < 1
we have
lim k → ∞ ( 3 2 ) n ( 3 4 ) k = 0 \lim_{k\to\infty}
\left(\dfrac32\right)^n\left(\dfrac34\right)^k
=
0 k → ∞ lim ( 2 3 ) n ( 4 3 ) k = 0
For any fixed n n n , letting k → ∞ k\to\infty k → ∞ yields
∣ x n ∣ ≤ 2 |x_n|\le2 ∣ x n ∣ ≤ 2
as required.
Part 5: Analytical Problem#
Question: Let f ( x ) = ∣ x 2 − a ∣ f(x)=|x^2-a| f ( x ) = ∣ x 2 − a ∣ , and let M ( a ) M(a) M ( a ) be the maximum value of f ( x ) f(x) f ( x ) on [ 0 , 1 ] [0,1] [ 0 , 1 ] . Find the minimum value of M ( a ) M(a) M ( a ) .
Set
g ( x ) = x 2 − a g(x)=x^2-a g ( x ) = x 2 − a
For x ∈ [ 0 , 1 ] x\in[0,1] x ∈ [ 0 , 1 ] , we have x 2 ∈ [ 0 , 1 ] x^2\in[0,1] x 2 ∈ [ 0 , 1 ] , so the range of g ( x ) g(x) g ( x ) is [ − a , 1 − a ] [-a,1-a] [ − a , 1 − a ] .
The maximum of f ( x ) = ∣ g ( x ) ∣ f(x)=|g(x)| f ( x ) = ∣ g ( x ) ∣ is attained at an endpoint of this interval:
M ( a ) = max x ∈ [ 0 , 1 ] ∣ x 2 − a ∣ = max { ∣ a ∣ , ∣ 1 − a ∣ } M(a)
=
\max_{x\in[0,1]}|x^2-a|
=
\max\{|a|,|1-a|\} M ( a ) = x ∈ [ 0 , 1 ] max ∣ x 2 − a ∣ = max { ∣ a ∣ , ∣1 − a ∣ }
By the triangle inequality for absolute values,
M ( a ) = max { ∣ a ∣ , ∣ 1 − a ∣ } ≥ ∣ a ∣ + ∣ 1 − a ∣ 2 ≥ ∣ a + ( 1 − a ) ∣ 2 = 1 2 M(a)
=
\max\{|a|,|1-a|\}
\ge
\frac{|a|+|1-a|}{2}
\ge
\frac{|a+(1-a)|}{2}
=
\frac12 M ( a ) = max { ∣ a ∣ , ∣1 − a ∣ } ≥ 2 ∣ a ∣ + ∣1 − a ∣ ≥ 2 ∣ a + ( 1 − a ) ∣ = 2 1
Equality holds if and only if
∣ a ∣ = ∣ 1 − a ∣ |a|=|1-a| ∣ a ∣ = ∣1 − a ∣
which gives
a = 1 2 a=\dfrac12 a = 2 1
Therefore, the minimum value of M ( a ) M(a) M ( a ) is
1 2 \boxed{\dfrac12} 2 1
Part 6: Analytical Problem#
Question: Points A A A , B B B , and C C C lie on the curve x y = 1 xy=1 x y = 1 , and △ A B C \triangle ABC △ A B C is an isosceles right triangle. Find the minimum possible area of △ A B C \triangle ABC △ A B C .
Let the right-angle vertex be
A ( u , 1 u ) A\left(u,\frac1u\right) A ( u , u 1 )
and let
B ( v , 1 v ) B\left(v,\frac1v\right) B ( v , v 1 )
Then
A B → = ( v − u , 1 v − d f r a c 1 u ) \overrightarrow{AB}
=
\left(v-u,\dfrac1v-\\dfrac1u\right) A B = ( v − u , v 1 − df r a c 1 u )
Rotating A B → \overrightarrow{AB} A B by 90 ∘ 90^\circ 9 0 ∘ gives the coordinates of C C C :
x C = u − ( 1 v − 1 u ) , y C = 1 u + ( v − u ) x_C
=
u-\left(\frac1v-\frac1u\right),
\qquad
y_C
=
\frac1u+(v-u) x C = u − ( v 1 − u 1 ) , y C = u 1 + ( v − u )
Since C C C lies on the hyperbola x y = 1 xy=1 x y = 1 , substituting x C y C = 1 x_Cy_C=1 x C y C = 1 and factoring yields the root v = u v=u v = u , which corresponds to a degenerate configuration. The other nondegenerate real root is
v = u 2 − 1 u ( u 2 + 1 ) v=\frac{u^2-1}{u(u^2+1)} v = u ( u 2 + 1 ) u 2 − 1
The square of the leg length is
∣ A B → ∣ 2 = ( v − u ) 2 + ( 1 v − 1 u ) 2 = 2 ( u 4 + 1 ) 3 u 2 ( u 4 − 1 ) 2 |\overrightarrow{AB}|^2
=
(v-u)^2+\left(\frac1v-\frac1u\right)^2
=
\frac{2(u^4+1)^3}{u^2(u^4-1)^2} ∣ A B ∣ 2 = ( v − u ) 2 + ( v 1 − u 1 ) 2 = u 2 ( u 4 − 1 ) 2 2 ( u 4 + 1 ) 3
The area is
S = 1 2 ∣ A B → ∣ 2 S=\dfrac12|\overrightarrow{AB}|^2 S = 2 1 ∣ A B ∣ 2
Let
t = u 2 , w = t + 1 t > 2 t=u^2,
\qquad
w=t+\dfrac1t>2 t = u 2 , w = t + t 1 > 2
After simplifying the area function, we obtain
S ( w ) = w 3 w 2 − 4 , w > 2 S(w)=\frac{w^3}{w^2-4},
\qquad
w>2 S ( w ) = w 2 − 4 w 3 , w > 2
Differentiate to locate the extremum:
S ′ ( w ) = w 2 ( w 2 − 12 ) ( w 2 − 4 ) 2 = 0 ⟹ w = 12 = 2 3 S'(w)
=
\frac{w^2(w^2-12)}{(w^2-4)^2}
=
0
\implies
w=\sqrt{12}=2\sqrt3 S ′ ( w ) = ( w 2 − 4 ) 2 w 2 ( w 2 − 12 ) = 0 ⟹ w = 12 = 2 3
Substitution gives the minimum area:
S min = ( 2 3 ) 3 ( 2 3 ) 2 − 4 = 24 3 8 = 3 3 S_{\min}
=
\frac{(2\sqrt3)^3}{(2\sqrt3)^2-4}
=
\frac{24\sqrt3}{8}
=
\boxed{3\sqrt3} S m i n = ( 2 3 ) 2 − 4 ( 2 3 ) 3 = 8 24 3 = 3 3