MHB How to Evaluate This Interesting Expression?

  • Thread starter Thread starter anemone
  • Start date Start date
  • Tags Tags
    Expression
Click For Summary
The discussion focuses on evaluating the expression $1\cdot 2^2 + 1\cdot 2\cdot 3^2 + 1\cdot 2\cdot 3\cdots 2015^2 - (1\cdot 2\cdot 3\cdots 2016)$. Participants share their approaches to solving the problem, with MarkFL receiving praise for his method. Kaliprasad confirms that he used a similar strategy to tackle the expression. The conversation highlights collaborative problem-solving in mathematics. Overall, the thread emphasizes the importance of shared techniques in evaluating complex expressions.
anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
Evaluate $1\cdot 2^2 + 1\cdot 2\cdot 3^2 + 1\cdot 2\cdot 3\cdot 4^2 +\cdots+ 1\cdot 2\cdot 3\cdots 2015^2− (1\cdot 2\cdot 3\cdots 2016)$.
 
Mathematics news on Phys.org
My solution:

First, let's prove by induction the following hypothesis $P_n$:

$$\sum_{k=a}^n(k\cdot k!)=(n+1)!-a!$$

1.) The base case $P_a$:

$$\sum_{k=a}^n(k\cdot k!)=a\cdot a!=a!((a+1)-1)=(a+1)!-a!$$

The base case is true.

2.) The induction step:

$$\sum_{k=a}^n(k\cdot k!)=(n+1)!-a!$$

Add through by $$(n+1)(n+1)!$$:

$$\sum_{k=a}^n(k\cdot k!)+(n+1)(n+1)!=(n+1)!-a!+(n+1)(n+1)!$$

$$\sum_{k=a}^{n+1}(k\cdot k!)=(n+1)!((n+1)+1)-a!$$

$$\sum_{k=a}^{n+1}(k\cdot k!)=((n+1)+1)!-a!$$

We have derived $P_{n+1}$ from $P_n$ thereby completing the proof by induction.

And so we may now state:

$$S=\sum_{k=2}^{2015}(k\cdot k!)-2016!=(2015+1)!-2!-2016!=-2$$
 
MarkFL said:
My solution:

First, let's prove by induction the following hypothesis $P_n$:

$$\sum_{k=a}^n(k\cdot k!)=(n+1)!-a!$$

1.) The base case $P_a$:

$$\sum_{k=a}^n(k\cdot k!)=a\cdot a!=a!((a+1)-1)=(a+1)!-a!$$

The base case is true.

2.) The induction step:

$$\sum_{k=a}^n(k\cdot k!)=(n+1)!-a!$$

Add through by $$(n+1)(n+1)!$$:

$$\sum_{k=a}^n(k\cdot k!)+(n+1)(n+1)!=(n+1)!-a!+(n+1)(n+1)!$$

$$\sum_{k=a}^{n+1}(k\cdot k!)=(n+1)!((n+1)+1)-a!$$

$$\sum_{k=a}^{n+1}(k\cdot k!)=((n+1)+1)!-a!$$

We have derived $P_{n+1}$ from $P_n$ thereby completing the proof by induction.

And so we may now state:

$$S=\sum_{k=2}^{2015}(k\cdot k!)-2016!=(2015+1)!-2!-2016!=-2$$

Very well done MarkFL!(Cool)
 
1st let us evaluate the sum

1st we see that $n^{th}$ term = $n * n! = (n+1-1) * n!= (n+1)! - n!$

when we sum the above from 2 to 2015 we get as a telescopic sum 2016!- 2 !
subtracting the last value that is 2016! we are left with -2! or - 2
 
Thanks for participating, kaliprasad!

For your information, that is exactly how I approached this particular problem as well! (Cool)
 
I have been insisting to my statistics students that for probabilities, the rule is the number of significant figures is the number of digits past the leading zeros or leading nines. For example to give 4 significant figures for a probability: 0.000001234 and 0.99999991234 are the correct number of decimal places. That way the complementary probability can also be given to the same significant figures ( 0.999998766 and 0.00000008766 respectively). More generally if you have a value that...

Similar threads

  • · Replies 3 ·
Replies
3
Views
940
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 17 ·
Replies
17
Views
1K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 6 ·
Replies
6
Views
510