The question asks to prove that if $b_n = o(\frac 1n)$ as $n \to \infty$, one can always construct a convergent series $\sum_{n=1}^{\infty} a_n$ such that $b_n = o(a_n)$ as $n \to \infty$.
What I have tried so far:
If I choose an $N \in \Bbb N$ such that $|nb_n|<1$ for all $n>N$, then $b_n < \frac 1n$. By the completeness axiom I can choose an $a_n$ such that $b_n < a_n < \frac 1n$. With some $a_n$ within these bounds for each $n$, $$ 0 < \left| \frac {b_n}{a_n} \right| < \left|\frac{b_n}{\left (\frac 1n\right)}\right| = |\ nb_n| $$
for all $n> N $ so $\lim \limits_{n \to \infty} \frac{a_n}{b_n} = 0.$
At this point I'm stuck as I don't know if what I've done is valid or how to formulate $a_n$ more precisely if it is. Also, showing that the limit above converges to 0 seems like a circular argument.
However, since $\sum_{n=1}^{\infty} \frac{1}{n^p}$ does converge for all $p > 1$, I should be able construct $a_n$ so that the sum converges using the comparison theorem and ensuring each $a_n$ is non negative.
Edit: looking at the question again, it does not specify that $b_n = o( \frac 1n)$ for the base $n \to \infty$. But since it gives no other base I assume this one was implied.