Let r denote the largest real number satisfying n2bn≥r for all positive integers n, where b1,b2,… are positive integers satisfying
1=12b1>22b2>32b3>42b4>⋯
We aim to determine the possible values of r.
### Claim 1: r=21 works and is maximal.
To achieve r=21, consider the sequence bn=2n(n+1). Then,
n2bn=2n2n(n+1)=2nn+1=21+2n1,
which satisfies the condition n2bn≥21.
We can inductively show that bn≤2n(n+1). The base case is given. Assuming the hypothesis holds for all integers less than n, we have
n2bn<(n−1)2bn−1≤2(n−1)n⟹bn<2(n−1)n3.
It is easy to verify that the largest possible bn is 2n(n+1), as claimed.
### Claim 2: All r<21 work.
Consider the sequence an:=⌈kn2⌉+n for k<21. Since an is O(n2), there exists N such that for all n≥N,
n2an<21.
Define the sequence bn as follows:
bn:={2n(n+1)anfor n<N,for n≥N.
By definition of N, n2bn>(n+1)2bn+1 for n<N. For n≥N, we want to show that
n2⌈kn2⌉+n>(n+1)2⌈k(n+1)2⌉+n+1.
Since ⌈kn2⌉≥kn2,
n2⌈kn2⌉+n≥k+n1,
and since ⌈k(n+1)2⌉<k(n+1)2+1,
(n+1)2⌈k(n+1)2⌉+n+1<k+(n+1)2n+2.
It suffices to verify that
n1≥(n+1)2n+2⟺(n+1)2≥n(n+2),
which is true.
Combining these two claims, we conclude that the possible values of r are:
0≤r≤21.
The answer is: \boxed{0 \leq r \leq \frac{1}{2}}.