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

Suppose $f(1,i)>0$ is a strictly decreasing sequence of reals.
Let $f(k+1,n)=f(k,n+1)−f(k,n)$.

If $f(2m+1,n)$ is for all integers $m$, a strictly decreasing function in $n$ and $\lim_{n\rightarrow\infty}f(2m+1,n)=0$, must $\sum_{n>1}f(1,n)<\infty$?

share|cite|improve this question
$f(2,n) = f(1,n+1)-f(1,n)$ is negative? – GEdgar Dec 1 '11 at 14:47
I fixed this inconsitency – julenøtt Dec 1 '11 at 15:02
Do you have an example where $\sum_{n>1} f(1,n)$ converges? – Dimitrije Kostic Dec 1 '11 at 15:36
up vote 1 down vote accepted

As a counterexample you could take $f(1,n)=1/n$ for $n\geq 1$. Using induction you can prove that $$f(k,n)=\frac{(-1)^{k+1}}{n\cdot\ldots\cdot(n+k-1)}$$ Then clearly $f(2 m+1,n)$ is strictly decreasing in $n$ for $m\in\mathbb{N}$ and $\lim_{n\rightarrow\infty}f(2m+1,n)=0$ but $\sum_{n>1}f(1,n)$ is divergent.

share|cite|improve this answer

Thoughts; the harmonic series diverges so consider f(k,n) = g(k)/n where g is a sequence that does not grow too quickly, etc such that the additive constraint holds.

That is I am guessing this is not true.

share|cite|improve this answer
Yea I think 1/n is a counterexample – julenøtt Dec 1 '11 at 15:01
The problem is really finding suitable g such that f(k+1,n) = f(k,n+1)-f(k,n) as everything else is trivially met. – Adam Dec 1 '11 at 15:52

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.