Martin Schoenert recently replied to my memory question, and in his
reply asked as to why I has wanted to know. The reason is that I am
dealing with a large number of lists such as the one I gave in my
letter ( [1,2,3,4,5,6,7] ) and sometimes the computer simply takes up
too much memory and stops. I was trying to come up with a unique
representation of that list which took up less memory, so I came up
with summing up each element mulitiplied by 100^(a-1), where a is its
position. I chose 100 because I don't think the numbers inside the
original list will exceed 100 (20, more like). Does anyone have
any suggestions as to what might be a better way to create a less
memory list?

Thank you.
Q. Yang