Hi,

i need little help. This is a problem from computer science and what i have is an array A every array has a position and every position is indexed. Furthermore what i have is a case where for let say k=3 i wish to sum the following:

A[i] + A[i + A[i]] + A [i + A[i] + A[i + A[i]]]

Now i am not a mathematician so please do not laugh. What i don't know is how to write this down nicely.

what confuses me is this recursion. so A[i] is a value of the array on position i , A[i+A[i]] is a value on that position but the position at which i am checking for value is dependent on the sum of previous positions. So it would go something like this :

$\displaystyle \sum^{k}_{s=0} \mbox{A[}i+\sum^{s}_{p=0}\mbox{what goes here!!]}$ i cannot just write down $\displaystyle \mbox{A_{b}}$ because it is not obvious what that is

thnx