Well I have participated in enough golf tournaments, time
for me to open one.
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:
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.[2,3]; # Represents (3x + 2)
PS I am just a ref on this one.
|
---|
Replies are listed 'Best First'. | |
---|---|
Re: (Golf) Multiply polynomials
by Masem (Monsignor) on May 07, 2001 at 18:45 UTC | |
by MeowChow (Vicar) on May 07, 2001 at 22:05 UTC | |
by tilly (Archbishop) on May 08, 2001 at 15:14 UTC | |
by Masem (Monsignor) on May 08, 2001 at 18:14 UTC | |
by tilly (Archbishop) on May 08, 2001 at 18:29 UTC | |
| |
by tilly (Archbishop) on May 07, 2001 at 18:57 UTC | |
by Masem (Monsignor) on May 07, 2001 at 22:00 UTC | |
by tye (Sage) on May 07, 2001 at 22:09 UTC | |
Re: (Golf) Multiply polynomials
by jeroenes (Priest) on May 11, 2001 at 13:30 UTC | |
by tye (Sage) on May 11, 2001 at 13:43 UTC |
Back to
Meditations