perlmeditation tilly Well I have participated in enough golf tournaments, time for me to open one.<P> We can represent a polynomial P by an anonymous array of its coefficients, with the i'th coefficient corresponding to the x**i term. For instance: <code> [2,3]; # Represents (3x + 2) </code> Write a function M, that in as few characters as possible takes a list of polynomials and calculates a polynomial that is the product of the list. If called twice, it must return 2 different polynomials.<P> PS I am just a ref on this one.