Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How can I show that if $x=[a_0;a_1,a_2,\dots]$, then $|x-C_k|<1/a_k^{\text{}}q_k^2$ using the facts that

$$\begin{align} C_k-C_{k-1}&=\frac{(-1)^{k-1}}{q_kq_{k-1}}\text{, and}\\ |C_k-C_{k-1}|&\leqslant\frac{1}{q_kq_{k-1}}? \end{align}$$

This is what I have done:


However, since $(q_k)_{k\in\mathbb{N}\cup\{0\}}$ is an increasing sequence,


Therefore, I cannot assume that the inequality would still hold if I increased the index. Moreover, I am not sure about the relationship between $|x-C_k|$ and $|C_k-C_{k-1}|$.

share|cite|improve this question
up vote 1 down vote accepted

Are you allowed to use the fact that $x$ is always between $C_k$ and $C_{k+1}$? If so, you have $|x-C_k|\lt|C_{k+1}-C_k|$ and then your argument gives you $|x-C_k|\lt1/(a_{k+1}q_k^2)$. This is not exactly what you asked for, but I'm not convinced that the inequality you asked for is correct.

share|cite|improve this answer
I also had the same feeling about this inequality. I will comment here again when I check whether this is a typo or not. Thanks! – EsX_Raptor Apr 19 '12 at 3:43

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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