| http://www.w3.org/ns/prov#value | - The recursion formula becomes .Divide by r^(n-k) to get .In other words, if r is a solution to this polynomial equation, then .Assuming that all the roots of the polynomial are unique, then we have the needed k independent sequences, so any sequence X in V is given by, for appropriate constants A_i, where the r_i are the roots.
|
