MathDB
find the maximum value of t so that b_n becomes unbounded

Source: STEMS 2024, CAT B - P3, CAT A - P5

December 17, 2023
algebra

Problem Statement

Let rr, ss be real numbers, find maximum tt so that if a1,a2,a_1, a_2, \ldots is a sequence of positive real numbers satisfying a1r+a2r++anr2023nt a_1^r + a_2^r + \cdots + a_n^r \le 2023 \cdot n^t for all n2023n \ge 2023 then the sum bn=1a1s++1ans b_n = \frac 1{a_1^s} + \cdots + \frac 1{a_n^s} is unbounded, i.e for all positive reals MM there is an nn such that bn>Mb_n > M.