The staff of Numberphile has shown that the sum of all the integers from $0$ to $\infty$ is $-\frac1{12}$. Recently I was looking for the sum of all the (positive) integers from $0$ to $n$ and I found that:
$$\sum_{i=0}^n i=\frac{n(n+1)}{2}$$
So I decided to take the limit:
$$\lim_{n\to \infty}\frac{n(n+1)}{2}$$
but that tends towards $\infty$ when I expected that to be $-\frac1{12}$!
Where did I got wrong? (the result is also confirmed by Wolfram Alpha)
Friday, 8 April 2016
limits - Sum of all the positive integers problem
Subscribe to:
Post Comments (Atom)
real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$
How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
-
Self-studying some properties of the exponential-function I came to the question of ways to assign a value to the divergent sum $$s=\sum_{k=...
-
Ok, according to some notes I have, the following is true for a random variable $X$ that can only take on positive values, i.e $P(X $\int_0^...
-
The question said: Use the Euclidean Algorithm to find gcd $(1207,569)$ and write $(1207,569)$ as an integer linear combination of $1207$ ...
No comments:
Post a Comment