Proving ∑ j=1 through n, j(j+1)(j+2) . . . (j+k-1) with Induction

  • Thread starter Thread starter caseyd1981
  • Start date Start date
  • Tags Tags
    Induction
Click For Summary

Homework Help Overview

The discussion revolves around proving a summation involving factorials and products, specifically ∑ j=1 through n, j(j+1)(j+2) . . . (j+k-1), using mathematical induction. The subject area includes combinatorial mathematics and induction principles.

Discussion Character

  • Exploratory, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants discuss the initial steps for proving the statement by induction, including rewriting the summation in a more manageable form. Questions arise regarding the meaning of the variable k and its role in the expression. There are attempts to simplify the right-hand side of the equation and to find a common denominator for fractions involved in the proof.

Discussion Status

Participants are actively engaging with the problem, sharing their thought processes and steps taken so far. Some have expressed gratitude for the guidance received, while others are still seeking clarification on specific aspects of the problem, such as the interpretation of k and the simplification of expressions.

Contextual Notes

There is an emphasis on understanding the components of the summation and the induction process, with participants questioning the definitions and roles of variables involved. The discussion reflects a collaborative effort to navigate the complexities of the proof without reaching a definitive conclusion.

caseyd1981
Messages
10
Reaction score
0
I need to prove this by induction and I'm lost on how to even start, help please?

Prove that for all positive integers k and n:

∑ j=1 through n, j(j+1)(j+2) . . . (j+k-1) = n(n+1)(n+2) . . . (n+k) / (k+1)
 
Physics news on Phys.org
caseyd1981 said:
I need to prove this by induction and I'm lost on how to even start, help please?

Prove that for all positive integers k and n:

∑ j=1 through n, j(j+1)(j+2) . . . (j+k-1) = n(n+1)(n+2) . . . (n+k) / (k+1)

Hi caseyd1981! :smile:

Well, first it's a lot easier to read and quicker to write if you write it ∑ (j+k-1)!/(j-1)! = (n+k)!/(n-1)!(k+1)

To prove by induction, assume it's true for n,

then add (n+1+k-1)!/(n+1-1)! to both sides, and see what the right-hand side turns into :wink:
 
Oh wow! I see now! Thank you so much for helping me start this one off. One more question, may I ask what is k in this statement? The index is j through n, so what exactly is k?
 
Last edited:
famous for fifteen seconds …

Hi caseyd1981! :smile:
caseyd1981 said:
Prove that for all positive integers k and n:

∑ j=1 through n, j(j+1)(j+2) . . . (j+k-1) = n(n+1)(n+2) . . . (n+k) / (k+1)
caseyd1981 said:
Oh wow! I see now! Thank you so much for helping me start this one off. One more question, may I ask what is k in this statement? The index is j through n, so what exactly is k?

o:) k is just an inoccent little constant o:) …​

a passerby whom the producer persuaded to stand in for a scene because he needed an extra :wink:
 
Alright, let's see. So what I need to prove is (n+1+k)!/(n+1-1)!(k+1)
Which, simplified is: (n+1+k)!/n!(k+1)

I add (n+1+k-1)!/(n+1-1)! to both sides and this is what my RHS becomes:

(n+k)!/(n-1)!(k+1) + (n+1+k-1)!/(n+1-1)!

Simplify:
(n+k)!/(n-1)!(k+1) + (n+k)!/n!

Factor each denominator to find common denominator:
(n-1)!(k+1) = (n-1)!(k+1)
And
n! = n(n-1)!

So the common denominator is n(n-1)!(k+1)

I must multiply the left fraction's numerator by n and the right fraction's numerator by (k+1):
n(n+k)!/n(n-1)!(k+1) + (n+k)!(k+1)/n(n-1)!(k+1)

The denominator simplifies to n!(k+1)

So now I have:
n(n+k)! + (n+k)!(k+1)/n!(k+1)

Hopefully I am on the right track here and have done everything correctly so far...
Now I am stuck on adding the numerator. I am thinking I have to do some factoring? Not quite sure..

ANd thank you SOOOO much for your help so far! :)
 
caseyd1981 said:
(n+k)!/(n-1)!(k+1) + (n+k)!/n!

Factor each denominator to find common denominator:
(n-1)!(k+1) = (n-1)!(k+1)
And
n! = n(n-1)!

So the common denominator is n(n-1)!(k+1)

I must multiply the left fraction's numerator by n and the right fraction's numerator by (k+1):
n(n+k)!/n(n-1)!(k+1) + (n+k)!(k+1)/n(n-1)!(k+1)

The denominator simplifies to n!(k+1)

So now I have:
n(n+k)! + (n+k)!(k+1)/n!(k+1)

hmm … this is rather long-winded …

try starting it

(n+k)!/(n-1)!(k+1) + (n+k)!/n!

= (n+k)!/n!(k+1) (n + (k+1)) :wink:
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
Replies
0
Views
1K
  • · Replies 15 ·
Replies
15
Views
3K
Replies
1
Views
969
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
10
Views
3K
Replies
5
Views
3K
  • · Replies 12 ·
Replies
12
Views
2K
Replies
3
Views
1K