Two Simple Ways of Generating the Partitions of (n+1) from the Partitions of n

Details Two Simple Ways of Generating the Partitions of (n+1) from the Partitions of n Two Simple Ways of Generating the Partitions of (n+1) from the Partitions of n

2004-11-27

arxiv.org/abs/math/0411608v1

Mathematics

General Mathematics

7 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Two Simple Ways of Generating the Partitions of (n+1) from the Partitions of n does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two Simple Ways of Generating the Partitions of (n+1) from the Partitions of n, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two Simple Ways of Generating the Partitions of (n+1) from the Partitions of n will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-691856