Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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|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
4  
Here's a link to the problem and the solution Chandru1 posted below: imc-math.org.uk/imc1999/prob_sol1.pdf –  Jonas Meyer Nov 2 '10 at 1:05
add comment

2 Answers

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|improve this answer
add comment

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|improve this answer
add comment

Your Answer

 
discard

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