AlgebraDifficulty 8.2Find the answerchina_team_selection_test
Whether there are integers a1, a2, ⋯, that are different from each other, satisfying: (1) For ∀k∈N+, ak2>0 and ak2+k<0; (2) For ∀n∈N+, ∣an+1−an∣⩽2023n?
Official solution
To determine whether there exist integers a1,a2,… that are distinct and satisfy the given conditions, we analyze the problem as follows:
1. For all k∈N+, ak2>0 and ak2+k<0. 2. For all n∈N+, ∣an+1−an∣≤2023n.
Assume such a sequence {an} exists. Let f(k) denote an integer in the interval [k2,k2+k−1] such that af(k)>0 and af(k)+1<0. Similarly, let g(k) denote an integer in the interval [k2+k,(k+1)2−1] such that ag(k)<0 and ag(k)+1>0.
By the triangle inequality and the given condition ∣an+1−an∣≤2023n, we can bound the values of af(k)±C and ag(k)±C for any integer C as follows: ∣af(k)±C∣≤2023(C+1)(k+1), ∣ag(k)±C∣≤2023(C+1)(k+1).
Consider a large integer N and the number of terms t such that ∣at∣≤N2. On one hand, this number must be at most 2N2+1.
On the other hand, if j is finite and very small compared to N, for each t∈[2023jN2,2023(j+1)N2], we need: ∣at∣=∣af(⌊t⌋)±C∣≤2023(C+1)(t+1), or ∣ag(⌊t⌋)±C∣≤2023(C+1)(t+1).
This implies that C<4046jN works for sure. There are 2023N(j+1−j)<4100jN intervals, so we can pick 109jN2 terms that are guaranteed to be at most N2.
By choosing j=exp(2⋅109) and N>exp(j), we get that 2N2+1<3N2<N2(Hj−1)10−9. As the former is the number of possible terms that have absolute value at most N2 and the latter is the number of terms that must have absolute value at most N2, we reach a contradiction.
Therefore, no such sequence {an} exists.
The answer is: \boxed{\text{No}}.
Source: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.