6. Let P(n, k) denote the number of partitions of n into exactly k parts. Prove that P(n, k) = P(n − 1, k − 1) + P(n − k, k), for 1 ≤ k ≤ n. What are the initial conditions ? Compute P(9,3).

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

Type solution pls 

6. Let P(n, k) denote the number of partitions of n into exactly k parts. Prove that
P(n, k) = P(n − 1, k − 1) + P(n − k, k), for 1 ≤ k ≤n. What are the initial conditions
? Compute P(9,3).
Transcribed Image Text:6. Let P(n, k) denote the number of partitions of n into exactly k parts. Prove that P(n, k) = P(n − 1, k − 1) + P(n − k, k), for 1 ≤ k ≤n. What are the initial conditions ? Compute P(9,3).
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,