Questions about evaluating summations, especially finite summations. For infinite series, please consider the (sequences-and-series) tag instead.

learn more… | top users | synonyms

4
votes
3answers
2k views

induction proof: $\sum_{k=1}^nk^2 = \frac{n(n+1)(2n+1)}{6}$

I encountered the following induction proof on a practice exam for calculus: $$\sum_{k=1}^nk^2 = \frac{n(n+1)(2n+1)}{6}$$ I have to prove this statement with induction. Can anyone please help me ...
4
votes
5answers
809 views

Finding a closed formula for $1\cdot2\cdot3\cdots k +\dots + n(n+1)(n+2)\cdots(k+n-1)$

Considering the following formulae: (i) $1+2+3+..+n = n(n+1)/2$ (ii) $1\cdot2+2\cdot3+3\cdot4+...+n(n+1) = n(n+1)(n+2)/3$ (iii) $1\cdot2\cdot3+2\cdot3\cdot4+...+n(n+1)(n+2) = n(n+1)(n+2)(n+3)/4$ ...
2
votes
5answers
5k views

Proof by induction that $ \sum_{i=1}^n 3i-2 = \frac{n(3n-1)}{2} $

I'm starting to understand how induction works (with the whole $k \to k+1$ thing), but I'm not exactly sure how summations play a role. I'm a bit confused by this question specifically: $$ ...
1
vote
1answer
91k views

What three odd integers have a sum of 30? [duplicate]

I've been asked the following question: What three odd integers from the set {1,3,5,7,9,11,13,15} that when summed together equals to 30? Note that any integer can be used more than once. Is there ...
31
votes
4answers
947 views

Is $\sum_{k=1}^{m-1}\frac{1}{\sin^2\frac{k\pi}{m}}=\frac{m^2-1}{3}$ true for $m\in\mathbb N$?

Question : Is the following true for any $m\in\mathbb N$? $$\begin{align}\sum_{k=1}^{m-1}\frac{1}{\sin^2\frac{k\pi}{m}}=\frac{m^2-1}{3}\qquad(\star)\end{align}$$ Motivation : I reached ...
23
votes
4answers
835 views

How close can $\sum_{k=1}^n \sqrt{k}$ be to an integer?

How close can $S(n) = \sum_{k=1}^n \sqrt{k}$ be to an integer? Is there some $f(n)$ such that, if $I(x)$ is the closest integer to $x$, then $|S(n)-I(S(n))|\ge f(n)$ (such as $1/n^2$, $e^{-n}$, ...). ...
17
votes
2answers
376 views

Trig sum: $\tan ^21^\circ+\tan ^22^\circ+…+\tan^2 89^\circ = ?$

As the title suggests, I'm trying to find the sum $$\tan^21^\circ+\tan^2 2^\circ+...+\tan^2 89^\circ$$ I'm looking for a solution that doesn't involve complex numbers, or any other advanced branch in ...
12
votes
5answers
2k views

A formula for the power sums: $1^n+2^n+\dotsc +k^n=\,$?

Is there explicit formula for the expression $1^n + 2^n + \dotsc + k^n\,$? I know that for $n=1$ the explicit formula becomes $S=k(k+1)/2$ and for $n=3$ the formula becomes $S^2$. But what about ...
9
votes
6answers
945 views

Proof of $\sum_{0 \le k \le t} {t-k \choose r}{k \choose s}={t+1 \choose r+s+1}$?

How do I prove that $$\sum_{0 \le k \le t} {t-k \choose r}{k \choose s}={t+1 \choose r+s+1} \>?$$ I saw this in a book discussing generating functions.
9
votes
3answers
19k views

How to prove a formula for the sum of powers of $2$ by induction?

How do I prove this by induction? Prove that for every natural number n, $ 2^0 + 2^1 + ... + 2^n = 2^{n+1}-1$ Here is my attempt. Base Case: let $ n = 0$ Then, $2^{0+1} - 1 = 1$ Which is true. ...
7
votes
3answers
5k views

Solve $\sum nx^n$

I am trying to find a closed form solution for $\sum_{n\ge0} nx^n\text{, where }\lvert x \rvert<1$. This solution makes sense to me: $\sum_{n\ge0} x^n=(1-x)^{-1} \\ \frac{d}{d x} \sum_{n\ge0} x^n ...
3
votes
5answers
407 views

Proving the total number of subsets of S is equal to $2^n$

Student here! Just reading Liebecks Introduction to pure mathematics for fun and I made an attempt at proving the total number of subsets of S is equal to $2^n$. I realized that the total number of ...
2
votes
5answers
331 views

How to derive $\sum_{n=0}^\infty 1 = -\frac{1}{2}$ without zeta regularization

On Wikipedia we find $\displaystyle \bbox[5px,border:1px solid #F5A029]{1 + 1 + 1+\dots =\sum_{n=0}^\infty 1 = -\frac{1}{2}}$ using (the rather complicated) zeta-function regularization. I asking for ...
4
votes
2answers
999 views

Induction proof concerning a sum of binomial coefficients: $\sum_{j=m}^n\binom{j}{m}=\binom{n+1}{m+1}$ [duplicate]

I'm looking for a proof of this identity but where j=m not j=0 http://www.proofwiki.org/wiki/Sum_of_Binomial_Coefficients_over_Upper_Index $$\sum_{j=m}^n\binom{j}{m}=\binom{n+1}{m+1}$$
2
votes
5answers
159 views

Proving $ 1+\frac{1}{4}+\frac{1}{9}+\cdots+\frac{1}{n^2}\leq 2-\frac{1}{n}$ for all $n\geq 2$ by induction

Question: Let $P(n)$ be the statement that $1+\dfrac{1}{4}+\dfrac{1}{9}+\cdots +\dfrac{1}{n^2} <2- \dfrac{1}{n}$. Prove by mathematical induction. Use $P(2)$ for base case. Attempt at ...
5
votes
4answers
593 views

Proving a special case of the binomial theorem: $\sum^{k}_{m=0}\binom{k}{m} = 2^k$ [duplicate]

I want to know if I can get some help with this proof. I tried, but I just cannot seem to get $2^{k}$. It states that, For $k \in \mathbb{Z}_{\ge 0}$, $$\sum^{k}_{m=0}\binom{k}{m} = 2^k$$ Thank ...
21
votes
3answers
592 views

Closed form for $\sum_{n=1}^\infty\frac{(-1)^n n^4 H_n}{2^n}$

Please help me to find a closed form for the sum $$\sum_{n=1}^\infty\frac{(-1)^n n^4 H_n}{2^n},$$ where $H_n$ are harmonic numbers: $$H_n=\sum_{k=1}^n\frac{1}{k}=\frac{\Gamma'(n+1)}{n!}+\gamma.$$
30
votes
2answers
914 views

Evaluating the sum $\lim_{n\to \infty}\sqrt[2]{2+\sqrt[3]{2+\sqrt[4]{2+\cdots+\sqrt[n]{2}}}}$

The following nested radical $$\lim_{n\to \infty}\sqrt{2+\sqrt{2+\sqrt{2+\cdots}}}$$ is known to converge to 2. We can consider a similar nested radical where the degree of the radicals increases: ...
22
votes
3answers
680 views

A (probably trivial) induction problem: $\sum_2^nk^{-2}\lt1$

So I'm a bit stuck on the following problem I'm attempting to solve. Essentially, I'm required to prove that $\frac{1}{2^2}+\frac{1}{3^2}+\cdots+\frac{1}{n^2} < 1$ for all $n$. I've been toiling ...
13
votes
3answers
2k views

Combinatorial proof of $\sum^{n}_{i=1}\binom{n}{i}i=n2^{n-1}$.

Prove that $$\sum^{n}_{i=1}\binom{n}{i}i=n2^{n-1}$$ I can't find counting interpretations for either of the sides. A hint of "if $S$ is a subset of $\{1, . . . , n\}$ and $S^\prime$ is its ...
7
votes
4answers
18k views

How many distinct functions can be defined from set A to B?

In my discrete mathematics class our notes say that between set A (having 6 elements) and set b (having 8 elements), there are $8^6$ distinct functions that can be formed, in other words: $|b|^{|a|}$ ...
5
votes
4answers
802 views

What is the sum of $\sum\limits_{i=1}^{n}ip^i$?

What is the sum of $\sum\limits_{i=1}^{n}ip^i$ and does it matter, for finite n, if $|p|>1$ or $|p|<1$ ? Edition : Why can I integrate take sum and then take the derivative ? I think that ...
4
votes
4answers
3k views

Proving the sum of the first $n$ natural numbers by induction [duplicate]

I am currently studying proving by induction but I am faced with a problem. I need to solve by induction the following question. $$1+2+3+\ldots+n=\frac{1}{2}n(n+1)$$ for all $n > 1$. Any ...
2
votes
7answers
596 views

Proof of the formula $1+x+x^2+x^3+ \cdots +x^n =\frac{x^{n+1}-1}{x-1}$ [duplicate]

Possible Duplicate: Value of $\sum x^n$ Proof to the formula $$1+x+x^2+x^3+\cdots+x^n = \frac{x^{n+1}-1}{x-1}.$$
11
votes
3answers
3k views

Combinatorial interpretation of sum of squares, cubes

Consider the sum of the first $n$ integers: $$\sum_{i=1}^n\,i=\frac{n(n+1)}{2}=\binom{n+1}{2}$$ This has always made the following bit of combinatorial sense to me. Imagine the set ...
17
votes
4answers
699 views

How to prove $\sum\limits_{r=0}^n \frac{(-1)^r}{r+1}\binom{n}{r} = \frac1{n+1}$?

Other than the general inductive method,how could we show that $$\sum_{r=0}^n \frac{(-1)^r}{r+1}\binom{n}{r} = \frac1{n+1}$$ Apart from induction,I tried with Wolfram Alpha to check the validity,but ...
6
votes
3answers
597 views

Summing the series $(-1)^k \frac{(2k)!!}{(2k+1)!!} a^{2k+1}$

How does one sum the series $$ S = a -\frac{2}{3}a^{3} + \frac{2 \cdot 4}{3 \cdot 5} a^{5} - \frac{ 2 \cdot 4 \cdot 6}{ 3 \cdot 5 \cdot 7}a^{7} + \cdots $$ This was asked to me by a high school ...
7
votes
3answers
2k views

Proving that $\sum_{k=0}^{n} {{m+k} \choose{m}} = { m+n+1 \choose m+1 }$ [duplicate]

I have to prove that: $$\sum_{k=0}^{n} {{m+k} \choose{m}} = { m+n+1 \choose m+1 }$$ I tried to open up the right side with Pascal's definition that: $$ { n \choose k} = {n-1 \choose {k}} + {n-1 ...
4
votes
3answers
550 views

Proving $\frac{1}{n+1} + \frac{1}{n+2}+\cdots+\frac{1}{2n} > \frac{13}{24}$ for $n>1,n\in\Bbb N$ by Induction

Proving $\frac{1}{n+1} + \frac{1}{n+2}+\cdots+\frac{1}{2n} > \frac{13}{24}$ for $n>1,n\in\Bbb N$ To solve it I used induction but it is leading me nowhere my attempt was as follows: Lets ...
4
votes
5answers
13k views

Calculate sum of squares of first n odd numbers

Is there an analytical expression for the summation $$1^2+3^2+5^2+\cdots+(2n-1)^2$$ and how did you derive it?
14
votes
0answers
727 views

Are there unique solutions for $n=\sum_{j=1}^{g(k)} a_j^k$?

Edward Waring, asks whether for every natural number $n$ there exists an associated positive integer s such that every natural number is the sum of at most $s$ $k$th powers of natural numbers ...
9
votes
3answers
1k views

How do I evaluate this sum(involving the floor function)?

$$ \sum_{i=1}^N\left\lfloor\frac{N}{i}\right\rfloor $$ Is there a closed form expression to the above sum? (Mathematica doesn't give me anything)
-3
votes
1answer
116 views

Estimating partial sums $\sum_{n = 1}^m \frac{1}{\sqrt{n}}$

Apostol's Calculus, exercise number I 4.7 13. Prove that if $n \geq 1$, then $$ 2(\sqrt{n+1} - \sqrt{n}) < \frac{1}{\sqrt{n}} < 2(\sqrt{n} - \sqrt{n-1}) $$ and use this to prove that if ...
3
votes
4answers
10k views

Is the sum of all natural numbers $-\frac{1}{12}$? [duplicate]

My friend showed me this youtube video in which the speakers present a line of reasoning as to why $$ \sum_{n=1}^\infty n = -\frac{1}{12} $$ My reasoning, however, tells me that the previous ...
1
vote
3answers
4k views

Sum of $k {n \choose k}$ is $n2^{n-1}$

Proof that $\suṃ̣_{k=1}^{n}k {n \choose k}$ for $n \in \mathbb N$ is equal to $n2^{n-1}$. As a hint I got that $k {n \choose k} = n {n-1\choose k-1} $. I tried solving this by induction but, in the ...
0
votes
1answer
83 views

Summation of binomial coefficients [duplicate]

Is there a closed formula for: $\sum_{i=1}^{N}{\binom{i+k}{i}}$ ( k is a constant whole number )
2
votes
5answers
180 views

Help with proof using induction: $1 + \frac{1}{4} + \frac{1}{9}+\cdots+\frac{1}{n^2}\leq 2-\frac{1}{n}$ [duplicate]

I am having trouble with the following proof: For every positive integer $n$: $$1 + \frac{1}{4} + \frac{1}{9}+\cdots+\frac{1}{n^2}\leq 2-\frac{1}{n}$$ My work: I have tried to add ...
1
vote
2answers
95 views

Using induction to prove that $\sum_{r=1}^n r\cdot r! =(n+1)! -1$

Use induction to prove that $\displaystyle\sum_{r=1}^n r\cdot r! =(n+1)! -1$ I first showed that the formula holds true for $n=1$. Then I put n as $k$ and got an expression for the sum in ...
41
votes
1answer
1k views

Is $\sqrt1+\sqrt2+\dots+\sqrt n$ ever an integer?

Related: Can a sum of square roots be an integer? Except for the obvious cases $n=0,1$, are there any values of $n$ such that $\sum_{k=1}^n\sqrt k$ is an integer? How does one even approach such ...
33
votes
6answers
1k views

Infinite Series $‎\sum_{n=2}^{\infty}\frac{\zeta(n)}{k^n}$

‎If $f\left(z \right)=\sum_{n=2}^{\infty}a_{n}z^n$ and $\sum_{n=2}^{\infty}|a_n|$ converges then‎, $$\sum_{n=1}^{\infty}f\left(\frac{1}{n}\right)=\sum_{n=2}^{\infty}a_n\zeta\left(n\right)‎.$$ ‎Since ...
21
votes
3answers
530 views

How prove this sum $\sum_{n=1}^{\infty}\binom{2n}{n}\frac{(-1)^{n-1}H_{n+1}}{4^n(n+1)}$

show that $$\sum_{n=1}^{\infty}\binom{2n}{n}\dfrac{(-1)^{n-1}H_{n+1}}{4^n(n+1)}=5+4\sqrt{2}\left(\log{\dfrac{2\sqrt{2}}{1+\sqrt{2}}}-1\right)$$ where ...
31
votes
4answers
2k views

Identity involving Euler's totient function: $\sum \limits_{k=1}^n \left\lfloor \frac{n}{k} \right\rfloor \varphi(k) = \frac{n(n+1)}{2}$

Let $\varphi(n)$ be Euler's totient function, the number of positive integers less than or equal to $n$ and relatively prime to $n$. Challenge: Prove $$\sum_{k=1}^n \left\lfloor \frac{n}{k} ...
14
votes
4answers
361 views

A closed form of $\sum_{k=0}^\infty\frac{(-1)^{k+1}}{k!}\Gamma^2\left(\frac{k}{2}\right)$

I am looking for a closed form of the following series \begin{equation} \mathcal{I}=\sum_{k=1}^\infty\frac{(-1)^{k+1}}{k!}\Gamma^2\left(\frac{k}{2}\right) \end{equation} I have no idea how to ...
13
votes
3answers
431 views

Show that $\sum_{k=0}^n\binom{2n}{2k}^{\!2}-\sum_{k=0}^{n-1}\binom{2n}{2k+1}^{\!2}=(-1)^n\binom{2n}{n}$

How can I prove the identity: $$ \sum_{k=0}^n\binom{2n}{2k}^2-\sum_{k=0}^{n-1}\binom{2n}{2k+1}^2=(-1)^n\binom{2n}{n}? $$ Maybe, can we expand $$ f(x)=(1+x)^{2n}? $$ Thank you.
12
votes
2answers
662 views

Double sum trouble

Evaluate: $$\sum_{j=1}^{\infty} \sum_{i=1}^{\infty} \frac{j^2i}{3^j(j3^i+i3^j)}$$ Honestly, I don't see where to start with this. I am sure that this is a trick question and I am missing something ...
14
votes
5answers
327 views

Proof that $\sum_{1}^{\infty} \frac{1}{n^2} <2$

I know how to prove that $$\sum_1^{\infty} \frac{1}{n^2}<2$$ because $$\sum_1^{\infty} \frac{1}{n^2}=\frac{\pi^2}{6}<2$$ But I wanted to prove it using only inequalities. Is there a way to do ...
3
votes
1answer
17k views

Is there a partial sum formula for the Harmonic Series? [duplicate]

There is a partial sum formula for $$\sum_{x=1}^n x^1 = \frac{n(n+1)}{2}$$ and even one when the exponent of $x$ is $0$: $$\sum_{x=1}^n x^0 = n$$ but I cannot find one for exponent $-1$: ...
11
votes
10answers
715 views

Show that $ \sum_{n=2}^m \binom{n}{2} = \binom{m+1}{3}$

I need a hand in showing that $$ \sum_{n=2}^m \binom{n}{2} = \binom{m+1}{3}$$ Thanks in advance for any help.
11
votes
2answers
244 views

Infinite Series $\sum_{k=1}^{\infty}\frac{k^n}{k!}$

How can I find the value of the sum $\sum_{k=1}^{\infty}\frac{k^n}{k!}$? for example for $n=6$, we have $$\sum_{k=1}^{\infty}\frac{k^6}{k!}=203e.$$