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.Com
Question 1207587: 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.
Answer by Edwin McCravy(20056)   (Show Source): You can put this solution on YOUR website!
I finally figured out that the above, which was gobbledygook to me, 
means this:

The sum

is equal to a polynomial f(n) for all .
Write f(n) as a polynomial with terms in descending order of n.
It is well-known that



so




So



Edwin
RELATED QUESTIONS

Let a_1, a_2, a_3, \dots be a sequence. If a_n = a_{n - 1} + a_{n - 2} for all n \ge 3, (answered by math_tutor2020,greenestamps)
Suppose f is a polynomial function of degree Six such that f(n) =1/n for n=1,2,3,4,5,6,7. (answered by josgarithmetic)
Dear math teacher, I am having difficulties with the following problem: 4 times nC2 (answered by Theo)
The Fibonacci sequence, is defined by F_0 = 0, F_1 = 1, and F_n = F_{n - 2} + F_{n - 1}. (answered by CPhill,greenestamps)
The length of a field in yards is a function f(n) of the length n in feet. Write a... (answered by stanbon)
If f(x)= x-2/x+1, then f(n+1) is equal to.. A)-1/2 b)n-2/n+1 c)n-1/n+2... (answered by richard1234)
Find a closed form for S_n = 1! \cdot (1^2 + 1) + 2! \cdot (2^2 + 2) + \dots + n! \cdot... (answered by CPhill,ikleyn)
Solve the following equations for all x, unless the domain is restricted. sin(x) = 2... (answered by MathLover1)
f(n)=1^2+2^2+3^2+...+n^2 it turns out that f is a polynomial of degree x in n. Figure out (answered by venugopalramana)