6
$\begingroup$

Prove that $1<\dfrac{1}{n+1}+\dfrac{1}{n+2}+...+\dfrac{1}{3n+1}$.

By using the Mathematical induction. Suppose the statement holds for $n=k$.

Then for $n=k+1$. We have $\dfrac{1}{k+2}+\dfrac{1}{k+3}+...+\dfrac{1}{3k+1}+\dfrac{1}{3k+2}+\dfrac{1}{3k+3}+\dfrac{1}{3k+4}=(\dfrac{1}{k+1}+\dfrac{1}{k+2}+\dfrac{1}{k+3}+...+\dfrac{1}{3k+1})+(\dfrac{1}{3k+2}+\dfrac{1}{3k+3}+\dfrac{1}{3k+4}-\dfrac{1}{k+1})$

we know $\dfrac{1}{k+1}+\dfrac{1}{k+2}+\dfrac{1}{k+3}+...+\dfrac{1}{3k+1}>1$

What can we do for $(\dfrac{1}{3k+2}+\dfrac{1}{3k+3}+\dfrac{1}{3k+4}-\dfrac{1}{k+1})$?

$\endgroup$
  • $\begingroup$ Try adding the fractions and simplifying. $\endgroup$ – vadim123 Oct 21 '13 at 4:39
  • 1
    $\begingroup$ A rather elegant solutions - which combines summands into $2n+1$ pairs and show that each pair has sum larger than $\frac1{2n+1}$ - can be found in this answer. $\endgroup$ – Martin Sleziak May 17 '18 at 13:13
4
$\begingroup$

You are almost done. Prove that $$\frac{1}{3k+2}+\frac{1}{3k+3}+\frac{1}{3k+4}-\frac{1}{k+1}$$ is positive.

To do this it is enough to show that $\frac{1}{3k+2}+\frac{1}{3k+4} \gt \frac{2}{3k+3}$. The left side can be written as $\frac{6k+6}{(3k+2)(3k+4}$. So we want to show that $(3k+3)^2\gt (3k+2)(3k+4)$.

$\endgroup$
  • $\begingroup$ yup. I made a mistake that the result came out to be negative. Thanks $\endgroup$ – adrian smith Oct 21 '13 at 4:55
  • $\begingroup$ You are welcome. You were "in control" of what to do. $\endgroup$ – André Nicolas Oct 21 '13 at 4:57
5
$\begingroup$

By cauchy-schwarz inequality $$\left(\dfrac{1}{n+1}+\dfrac{1}{n+2}+\cdots+\dfrac{1}{3n+1}\right)(n+1+n+2+\cdots+3n+1)>(1+1+\cdots+1)^2=(2n+1)^2$$ note$$ (n+1+n+2+\cdots+3n+1)=\dfrac{(n+1+3n+1)(2n+1)}{2}=(2n+1)^2$$

$\endgroup$
1
$\begingroup$

Another way: You can bound it by $$\frac{1}{n+1} + \frac{1}{n+2} + ... + \frac{1}{3n+1} \ge \int_{n+1}^{3n+1} \frac{1}{x} = \log \Big(\frac{3n+1}{n+1}\Big)$$ where $\frac{3n+1}{n+1}$ is monotone increasing in $n$, and $\log(\frac{3*7 + 1}{7+1}) > 1$ already. Then check the cases $n=1$ through $6$.

$\endgroup$
  • $\begingroup$ I just checked for $n=1$. $log(\dfrac{2*1+1}{1+1})=0.69315<1)$. I think this doesn't work for the discrete values right? $\endgroup$ – adrian smith Oct 21 '13 at 5:00
  • $\begingroup$ @adriansmith I meant that you will have to check the claim some other way for the cases $1,...,6$, for example by adding them. The logarithm turns out to be less than $1$ in those cases $\endgroup$ – tfw cant into math Oct 21 '13 at 5:03
0
$\begingroup$

using $maxima$ I get

(%i1) 1/(3*k+2)+1/(3*k+3)+1/(3*k+4)-1/(k+1),ratexpand;
                                       2
(%o1)                      -------------------------
                               3       2
                           27 k  + 81 k  + 78 k + 24
(%i2) solve(denom(%),[k]);
                                 4                 2
(%o2)                     [k = - -, k = - 1, k = - -]
                                 3                 3

For $k=0$ the denominator is greater than $0$, so it is greater than $0$ for all $ k \gt -\frac{2}{3}$.

$\endgroup$

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.