
Let to,t…be the sequence recursively defined by to 0, and tn t-1+4n2 for n 2 1. Use a similar method as in part (a) to conjecture a formula for tn which holds for all n 2 0, and then prove by induction that your conjecture is correct. Show transcribed image
PayPal Gateway not configured
PayPal Gateway not configured