MathOverflow is a question and answer site for professional mathematicians. 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

Given $N$ and $a$ positive integers, with $a\ge 2$ is it possible to prove the inequality: $$\sum_{k=1}^N\frac{k^a}{(k+1)^a+(k+2)^a}\le\frac{N}{2}$$

share|cite|improve this question
I don't know if this one is appropiate on this site. As $\frac{1}{N} \cdot \sum_{k=1}^N \dots $ converges to $\frac{1}{2}$ you could show that it is monotone increasing and you are done – Dominic Michaelis May 21 '13 at 13:11
You can use the principle of mathematical induction to prove such inequalities. – aslan May 21 '13 at 14:11
up vote 2 down vote accepted

Since $\displaystyle \frac{k^a}{(k+1)^a+(k+2)^a}<\frac{k^a}{k^a+k^a}=\frac{1}{2}$ then $\displaystyle\sum_{k=1}^N\frac{k^a}{(k+1)^a+(k+2)^a}<\sum_{k=1}^N\frac{1}{2}=\frac{N}{2}$.

share|cite|improve this answer

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.