Prove that the partition function satisfies pn>pn-1 (n ≥2)...

Name: Problem 30, Chapter 8: Introductory Combinatorics
Uploaded: 2019-07-19T20:37:51-08:00
Duration: 3 min
Channel: Mitchell Riley
Description: Prove that the partition function satisfies pn>pn-1 (n ≥2)

Key Concepts

Partition Function

The partition function, denoted by p(n), counts the number of distinct ways an integer n can be expressed as a sum of positive integers irrespective of the order of the summands. It is a fundamental object in number theory and combinatorics, often studied to understand the distribution and structure of integer partitions.

Strict Monotonicity

The strict monotonicity of the partition function—that is, p(n) > p(n-1) for n ? 2—implies that as the integer increases, the number of possible partitions also increases. This property highlights the inherent combinatorial richness that comes with additional units, ensuring that every partition of n-1 naturally leads to at least one new partition of n.

Combinatorial Injection

A common proof strategy for demonstrating p(n) > p(n-1) involves constructing a combinatorial injection: each partition of n - 1 can be mapped to a partition of n by simply adding 1 as an additional part. This mapping is injective since distinct partitions yield distinct results. Moreover, there exists at least one partition of n that cannot be obtained through this mapping, thereby establishing the strict inequality.

Generating Functions

Generating functions serve as a powerful tool in partition theory. The generating function for the partition function is given by an infinite product expansion, and its manipulation can reveal various properties of partitions, including inequalities and growth rates. Analyzing the generating function can provide another pathway to understand the monotonic behavior of p(n).

Transcript

Please give Ace some feedback