Question

Question about math:

In the program why, is k going from 0 to n-1??

Answer 1

if it were 0 to n, then you would have one extra k value

k=0 .. n


and you're using x(k+1)
so once you are trying to solve for k=n
you must be solving for
x( (n-1)+1)

Answer 2

so you replaced the k with n-1, to get x[n]

Answer 3

ok ill try to explain it better

you want {(xk, yk) | k = 0, • • •, n}

x0 and y0 are already given meaning you want to find x1 to xn

so the code given is

x[k+1]:=1+u(x[k]*cos(t[k])-y[k]*sin(t[k]));
its probably confusing that they used k in this instance, but just remember this k means something other than the one above

so for x1, you need k+1=1
x[k+1]=x[1]
k+1=1
k=0
this is where we get k="0"..n-1

now we want x[n]

x[k+1]=x[n]
k+1=n
k=n-1

thus to get the points from x1 to xn, we need to use k = 0 .. n-1
in order to get
x[0..n]
using x[k+1]=xk +asdfasdf

Answer 4

what kind of program can read this code?
it looks a lot like maple but i dont use that enough to be sure

Answer 5

yup its maple

Answer 6

thanks for you explanation it really helped

Answer 7

i sure could have used your help when i was going over nested if-blocks

Answer 8

eh, im just good at reading code, not necessarily terms :P

Answer 9

thanks anyway

Answer 10

no prob