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

We know that $\displaystyle\zeta(2)=\sum\limits_{n=1}^{\infty} \frac{1}{n^2} = \frac{\pi^2}{6}$ and it converges.

  • Does there exists a bijective map $f:\mathbb{N} \to \mathbb{N}$ such that the sum $$\sum\limits_{n=1}^{\infty} \frac{f(n)}{n^2}$$ converges.

If our $s=2$ was not fixed, then can we have a function such that $\displaystyle \zeta(s)=\sum\limits_{n=1}^{\infty} \frac{f(n)}{n^s}$ converges

share|cite|improve this question
Now that this question is on the front page again, could someone edit the title so it says "Does there exist a bijective $f:\mathbb{N}\rightarrow\mathbb{N}$..."? – Rahul Oct 7 '10 at 18:39
Here's a link to the problem and the solution Chandru1 posted below: – Jonas Meyer Nov 2 '10 at 1:05
up vote 37 down vote accepted

For $s>2$ you can take $f(n)=n$.

For $s=2$ if you have $m < n$ and $a=f(m) > b=f(n)$ then $$\frac{a}{m^2}+\frac{b}{n^2}>\frac{b}{m^2}+\frac{a}{n^2}$$ (proved either naively or as a case of the "rearrangement inequality") so the sum $\sum f(n)/n^2$ can be reduced by swapping the values $f(m)$ and $f(n)$. Hence $$\sum\frac{f(n)}{n^2}\ge\sum\frac{n}{n^2}$$ which is divergent.

share|cite|improve this answer

For $s=2$ the answer is negative. This series doesn't converge.

To prove this we can use Abel transformation.

$$ \sum_{n=1}^{n=N} \frac{f(n)}{n^2} = \sum_{n=1}^{n=N} (\sum_{k=1}^{k=n} f(k)) (\frac{1}{n^2} - \frac{1}{(n + 1)^2}) + (\sum_{n=1}^{N} f(n))\frac{1}{(N+1)^2} $$

Since $f$ is bijection, $\sum_{k=1}^{k=n} f(k) \ge \frac{n^2}{2}$ hence the first sum is greater than $\sum_{n=1}^{N}\frac{c}{n}$ for some $c > 0$.

share|cite|improve this answer

Since this question has been closed as a duplicate of this one, I will only assume, as in the other question, that $f$ is injective, and show that the series must diverge. In doubt, I will also assume $\mathbb{N} = \{0, 1, 2, \dots\}$.

Let $S_N = \sum_{n=1}^N \frac{f(n)}{n^2}$. The sum $S_N$ assigns nonnegative "weights" $f(1)$, $f(2)$,... , $f(N)$, to the numbers $\frac{1}{1^2}$, $\frac{1}{2^2}$, ....,$\frac{1}{N^2}$, in that order, and takes the sum.

Now say we would like to make the sum defining $S_N$ as small as possible by rearranging the weights. It is clear that to do this the largest weights must be assigned to the smallest numbers. Therefore if the weights $f(1)$, $f(2)$, ..., $f(N)$, are arranged in increasing order as $a_1$, $a_2$, ..., $a_N$, we must have the inequality $$S_N \geq \sum_{n=1}^N \frac{a_n}{n^2}.$$

Because $f$ is assumed injective, it is easy to show by induction that $a_n \geq n - 1$. Thus the partial sums $S_N$ satisfy the inequality $$S_N \geq \sum_{n=1}^N \frac{n-1}{n^2}.$$ Therefore the series diverges by comparison with, for instance, $\sum_2^{+\infty} \frac{1}{2n}$

share|cite|improve this answer

Your Answer


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