# Partitions on a Set

Not what you're looking for?

We denote the number of partitions of a set of n elements by P(n). Suppose the number of partitions of a set on n elements into k parts is denoted by P(n,k). Then obviously

P(n) = P(n,1) + P(n,2) + ..... + P(n,n)

Show that P(n,2) = 2^(n-1) - 1

##### Purchase this Solution

##### Solution Summary

Set partitions are investigated. The solution is detailed and well-presented.

##### Solution Preview

Please see the attached file for the complete solution.

Thanks for using BrainMass.

Proof:

means the number ...

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

##### Probability Quiz

Some questions on probability

##### Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

##### Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

##### Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.