SOLUTION: The sum 6\left( 1\cdot1 + 2\cdot2 + \dots + n(n) \right) is equal to a polynomial f(n) for all n \ge 1. Write f(n) as a polynomial with terms in descending order of n.

Algebra ->  Sequences-and-series -> SOLUTION: The sum 6\left( 1\cdot1 + 2\cdot2 + \dots + n(n) \right) is equal to a polynomial f(n) for all n \ge 1. Write f(n) as a polynomial with terms in descending order of n.      Log On

I finally figured out that the above, which was gobbledygook to me, 
means this:

It is well-known that



so




So



Edwin