The discussion revolves around a problem involving the summation of products of sequences defined as P_r and Q_r, specifically in the context of binomial expansions. The original poster seeks a method to simplify or evaluate the expression P1Q1 + P2Q2 + ... + Pn-1Qn-1.
The discussion is ongoing, with participants providing insights and suggesting evaluations of the sequences P_r and Q_r. There is a request for clearer explanations and further exploration of the terms involved, indicating a collaborative effort to understand the problem better.
Participants note that the problem is sourced from a book titled "HIGHER ALGEBRA" by Hall & Knight, which may contain additional context or solutions that are not fully elaborated in the thread. There is also mention of factorial notations in the final result, suggesting complexity in the evaluation.
Bonaparte said:Its a lot of messing around with, but I'll give you the basic idea, note that when you expand, the integers turn out to be sum of squares, that is (n-1)(n)(2n-1)/6. The rn turn out to be (n-1)rn. You just do this to the different terms to get the final thing, which then you might be able to factor out. Try doing this and post your result, shouldn't be too hard.
Thanks, Bonaparte
Vineeth T said:Can you explain it more clearly?
Also the source of this problem is from a book called "HIGHER ALGEBRA" by Hall&Knight.
If you have this book see the answer (only the final result is given) in pg:328.Q no:27
The answer even has factorial notations in it.