proofs of sequences question...?

Question

[ss is "subscript"]
... i'm not even sure of which meathod of proving i have to use (i.e. induction) for these problems, but basically im given a sequence with a couple of terms defined by x[ss: m+3] = something with all x having a subscript containing "m". then i'm asked to prove a sequence defined by x[ss: n] = with the terms to a power of "n"

how am i supposed to prove this when one is "m" and the other is "n"....


...umm something to note, i tried the first couple of sequences with but defintions of the sequences and the first few terms were equal. so can i say that the definition containing "m" equals the definition containing "n"

(hope that wasn't too confusing ^_____^)

Answer 1

The different subscripts are just used to differentiate the two sequences from each other. But the subscript could be anything; if you are given a sequence x[ss: m + 3], you could rewrite it as x[ss: p + 3] and it would be the same sequence. I don't understand your specific question, but the point is that information about a series that uses a subscript m can still be applied to a series with a subscript n.

Answer 2

I like sequence/inductio/recursion problems, but I am not sure how to give you any insight without seeing a specfic problem. If you add a specific problem, I will check back and try to solve it.