MathsGee Answers is Zero-Rated (You do not need data to access) on: Telkom | Dimension Data | Rain | MWEB
First time here? Checkout the FAQs!
MathsGee is Zero-Rated (You do not need data to access) on: Telkom |Dimension Data | Rain | MWEB

1 like 0 dislike
Let $S=\{1,2,3\}$. Write all the possible partitions of $S$.
in Mathematics by Bronze Status (8,688 points) | 10 views

1 Answer

0 like 0 dislike
Best answer
Remember that a partition of $S$ is a collection of nonempty sets that are disjoint and their union is
$S$. There are 5 possible partitions for $S=\{1,2,3\}$ :

1. $\{1\},\{2\},\{3\}$;
2. $\{1,2\},\{3\}$;
3. $\{1,3\},\{2\}$
4. $\{2,3\},\{1\} ;$
5. $\{1,2,3\}$.
by Bronze Status (8,688 points)

Related questions

0 like 0 dislike
1 answer

MathsGee provides answers to subject-specific educational questions for improved outcomes.

On MathsGee Answers, you can:

1. Ask questions
2. Answer questions
3. Comment on Answers
4. Vote on Questions and Answers
5. Donate to your favourite users

MathsGee Tools

Math Worksheet Generator

Math Algebra Solver

Trigonometry Simulations

Vectors Simulations

Matrix Arithmetic Simulations

Matrix Transformations Simulations

Quadratic Equations Simulations

Probability & Statistics Simulations

PHET Simulations

Visual Statistics

ZeroEd Search Engine

Other Tools

MathsGee ZOOM | eBook