Restricted partitions
We prove a known partitions theorem by Bell in an elementary and constructive way. Our proof yields a simple recursive method to compute the corresponding Sylvester polynomials for the partition. The previous known methods to obtain these polynomials are in general not elementary.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2004-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/S0161171204306502 |