This time I will provide both the problem and solution in the continuing series from Dr. Andreescu’s lecture on Telescoping Sums and Products.

### Example 2. Evaluate

### Example 2. Solution

We can write

Posted in problems, tagged math circle, sums and products, Titu Andreescu on January 2, 2010| Leave a Comment »

This time I will provide both the problem and solution in the continuing series from Dr. Andreescu’s lecture on Telescoping Sums and Products.

We can write

Posted in problems, tagged binomial theorem, math circle, sums and products, Titu Andreescu on January 1, 2010| Leave a Comment »

Here is the solution provided for this previous problem on Telescoping Sums and Products

From the Binomial Theorem we have

thus

It follows that

Hence

Yielding

Posted in resources, Titu Andreescu, tagged problems, sums and products, telescoping products, telescoping sums, Titu Andreescu on December 6, 2009| 1 Comment »

While we wait for the Metroplex Math Circle to continue again in mid January, I will be posting a series of problems and solutions from our last session. Those who were fortunate enough to attend learned useful techniques for solving problems common in math contests.

The telescoping sums and products idea is used to solve many problems involving sums or products in algebra. For problems involving sums, the idea is to use identities, to write the sum in the form

and then cancel out terms to get F(n+1)-F(1). Sometimes the desired identity is hard to find, but basically you are searching for it in the recursive form of the sequence, or you can look foor the “conjugates” for the terms you have. The first example is classical. You Certainly know these formulas.

What about ?

Example 1. Prove that

%d bloggers like this: