Given an integer, n, I would like to be able to generate a list of n
unique symbols, e.g. [k1, k2, k3, ..., kn]. The closest I've been
able to figure out is this:
K : [];
for i: 1 thru n do (
K : append(K, [k[i]])
);
Which gives a list of indexed elements like [ k[1], k[2], ..., k[n] ].
Is there a way to do this so that the elements of the list are *not*
indexed?
--
Joshua Stults
Website: http://j-stults.blogspot.com