For every positive integer $n$, define the positive integer $u_n$ by the condition that $$\sum\limits_{k=1}^{u_n-1}\frac{1}k\leq n<\sum\limits_{k=1}^{u_n}\frac{1}k$$ Let $w_n=\frac1{u_n}$. Does the sequence $(w_n)$ converge and how to prove rigorously it does?

What I did:

I proved that $u_n$ exists and is unique, and that $u_1=2$ and $u_2=4$.

Proof of uniqueness:

Suppose that $u_n>v_n$ satisfying the defining condition, then $v_n\leq u_n-1$ so $\sum\limits_{k=1}^{v_n}\frac{1}k\leq n$, which is absurd, thus $u_n$ = $v_n$.

  • 1
    $\begingroup$ $u_n\to+\infty$, certainly! $\endgroup$
    – Pedro Tamaroff
    Jun 12 '14 at 15:19
  • $\begingroup$ Did you mean convergence of $u_n$ (small lettered)? $\endgroup$
    – hrkrshnn
    Jun 12 '14 at 15:19
  • $\begingroup$ @PedroTamaroff; @boywholived I made an error, let me correct that $\endgroup$ Jun 12 '14 at 15:20
  • $\begingroup$ After Pedro Tamaroff's hint that $u_n\rightarrow +\infty$, observe that $\dfrac{1}{u_n}\cdot u_n =1 \rightarrow 1$, then you can use this to prove that $\dfrac{1}{u_n}$ converges to $0$. $\endgroup$
    – hrkrshnn
    Jun 12 '14 at 15:28
  • $\begingroup$ Actually $u_1$ is not unique and to prove that $u_n$ is unique for every $n\geqslant2$ requires to prove that $\sum\limits_{k=1}^K\frac1k$ is not an integer when $K\geqslant2$ (did you really prove this?). $\endgroup$
    – Did
    Jun 12 '14 at 15:32

$$n\lt\sum_{k=1}^{u_n}\frac1k\leqslant1+\int_1^{u_n}\frac{\mathrm dt}t=1+\log u_n\implies\frac1{u_n}\lt\frac{\mathrm e}{\mathrm e^n}$$


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.