Two Simple Ways of Generating the Partitions of (n+1) from the Partitions of n
| dc.creator | Mehendale, Dhananjay P. | |
| dc.date | 2004-11-27 | |
| dc.date.accessioned | 2026-07-07T05:14:45Z | |
| dc.date.available | 2026-07-07T05:14:45Z | |
| dc.description | I propose two simple ways of generating the partitions of (n+1) from the partitions of n. A recurrence relation for P(n+1), the number of partitions of (n+1), in terms of P(n) and Q(n), where Q(n) denotes the number of partitions of n having strictly different last two parts is obtained. Also a generating function for Q(n) is given. The other method for generating the partitions of (n+1) from the partitions of n is discussed at the end. | |
| dc.description | 7 pages | |
| dc.identifier | https://arxiv.org/abs/math/0411608 | |
| dc.identifier | http://arxiv.org/abs/math/0411608 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/73398 | |
| dc.subject | General Mathematics | |
| dc.title | Two Simple Ways of Generating the Partitions of (n+1) from the Partitions of n | |
| dc.type | text |