if you want to remove an article from website contact us from top.

# total number of different partitions of a set having four elements is

Category :

### Mohammed

Guys, does anyone know the answer?

get total number of different partitions of a set having four elements is from screen.

## math

How many different partitions with exactly two parts can be made of the set {1,2,3,4}? There are 4 elements in this list that need to be partitioned into 2 parts. I wrote these out and got a total ... ## How many different partitions with exactly n parts can be made of a set with k-elements?

Asked 10 years, 7 months ago

Modified 6 years, 3 months ago

Viewed 16k times 3

How many different partitions with exactly two parts can be made of the set {1,2,3,4}? There are 4 elements in this list that need to be partitioned into 2 parts. I wrote these out and got a total of 7 different possibilities:

{{1},{2,3,4}} {{2},{1,3,4}} {{3},{1,2,4}} {{4},{1,2,3}} {{1,2},{3,4}} {{1,3},{2,4}} {{1,4},{2,3}}

Now I must answer the same question for the set {1,2,3,...,100}. There are 100 elements in this list that need to be partitioned into 2 parts. I know the largest size a part of the partition can be is 50 (that's 100/2) and the smallest is 1 (so one part has 1 number and the other part has 99). How can I determine how many different possibilities there are for partitions of two parts without writing out extraneous lists of every possible combination? Can the answer be simplified into a factorial (such as 12!)?

Is there a general formula one can use to find how many different partitions with exactly n parts can be made of a set with k-elements?

mathdiscrete-mathematicsdata-partitioning

Share

edited Sep 3, 2012 at 17:18

casperOne 72.8k18 18 gold badges 181 181 silver badges 244 244 bronze badges

asked Feb 16, 2012 at 17:54

Jared 3912 2 gold badges 6 6 silver badges 14 14 bronze badges Add a comment

5

1) stackoverflow is about programming. Your question belongs to https://math.stackexchange.com/ realm.

2) There are 2n subsets of a set of n elements (because each of n elements may either be or be not contained in the specific subset). This gives us 2n-1 different partitions of a n-element set into the two subsets. One of these partitions is the trivial one (with the one part being an empty subset and other part being the entire original set), and from your example it seems you don't want to count the trivial partition. So the answer is 2n-1-1 (which gives 23-1=7 for n=4).

Share

edited Apr 13, 2017 at 12:19

CommunityBot 11 1 silver badge

answered Feb 16, 2012 at 18:05

penartur 9,6845 5 gold badges 38 38 silver badges 48 48 bronze badges

There is no latex on this site –

BlueRaja - Danny Pflughoeft

Feb 16, 2012 at 22:31

@BlueRaja-DannyPflughoeft Yes, i'm aware of it :) What i wasn't aware of is that one can use html tags like when writing answers. –

penartur

Feb 17, 2012 at 9:41

Add a comment 2

The general answer for n parts and k elements would be the Stirling number of the second kind S(k,n).

Please beware that the usual convention is with n the total number of elements, thus S(n,k)

Computing the general formula is quite ugly, but doable for k=2 (with the common notation) :

Thus S(n,2) = 1/2 ( (+1) * 1 * 0n +(-1) * 2 * 1n + (+1) * 1 * 2n ) = (0-2+2n)/2 = 2n-1-1

Share

edited Feb 8, 2017 at 14:58

CommunityBot 11 1 silver badge

answered Dec 1, 2014 at 22:41

Cimbali 10.7k37 37 silver badges 65 65 bronze badges Add a comment

Not the answer you're looking for? Browse other questions tagged mathdiscrete-mathematicsdata-partitioning or ask your own question.

The Overflow Blog

I spent two years trying to do what Backstage does for free

A serial entrepreneur finally embraces open source (Ep. 486)

Featured on Meta

Planned maintenance scheduled for Wednesday, 21 September, 00:30-03:00 UTC...

Recent Color Contrast Changes and Accessibility Updates

Reviewer overboard! Or a request to improve the onboarding guidance for new...

Should I explain other people's code-only answers?

### Related

2

Matlab partition problem

3

combination of combination java

3

fair partitioning of set S into k partitions

3

Picking fair teams - and the math to prove it

1

How to get the most uniform partition results?

1

Generate Unique Combinations of Integers

1

Is there a way to get "groups of combinations" of lists that don't overlap, and is exhaustive, using itertools on Python?

### Hot Network Questions

What is this diskette drive?

OBB train no reservation seats

Who were the two large hobbits?

Can an animal have a body covered with "hearing" hair?

Roadside repair: how to use a screw-on Presta pump on a tube with a removable valve core

For what Vulpes --> Vulpecula, but Sorex never will be Soreculus

Tips on where to buy clothes for cold weather in Lille, France?

What exactly is meant by isotropic and anisotropic with word vectors

Calculating Pi using the Gregory Leibniz series until n terms

How long are the events of Half-Life 2 in-universe?

Why do balloons no longer have nets?

Where is the reaction force of an object that has just flung out from a circular motion?

In aircraft reliability monitoring analysis, why the calculation of defect rate is per 1000 FH?

Why is load rated in kW?

Using QGIS Field Calculator on delimiter separated values

स्रोत : stackoverflow.com

## How to find all partitions of a 4

Answer: As one of the comments suggested, you can use the Stirling numbers of the second kind - Wikipedia, S(n,k), to calculate the number of ways to separate n objects into k partitions. So S(4,1)=1 is the number of ways to put 4 objects into 1 partition, S(4,2)=7 is the number of ways to have 2... How do I find all partitions of a 4-element set?

Ad by Amazon Web Services (AWS)

AWS is how.

AWS removes the complexity of building, training, and deploying machine learning models at any scale.

Sort Glenn Redd

B.S. in Mathematics, Kennesaw State University (Graduated 2016)Author has 1.9K answers and 2.3M answer views4y

As one of the comments suggested, you can use the Stirling numbers of the second kind - Wikipedia

, S(n,k), to calculate the number of ways to separate n objects into k partitions. So S(4,1)=1 is the number of ways to put 4 objects into 1 partition, S(4,2)=7 is the number of ways to have 2 partitions, S(4,3)=6 is 3 partitions, and S(4,4)=1 is 4 partitions. So the sum of these 1+7+6+1=15 is the number of total possible partitions of a 4 element set.

This is also the 5th Bell number (since the 1st bell number is the number of partitions for 0 elements, that means 4 elements is the 5th), but one of the ways to calculate the Bell number is to add up all of the Stirling numbers of the second kind for the given number of elements, so…

Leticia Yang Alan Bustany

Trinity Wrangler, 1977 IMOUpvoted by

Sam Sinai

, Ph.D student in Mathematical BiologyAuthor has 8.7K answers and 34.3M answer views6y

Related

What is a partition of a set?

> What is a partition of a set?

A Partition of a set [ https://en.m.wikipedia.org/wiki/Partition_of_a_set ],

A A

, is a set of subsets,

B i Bi , of A A such that: ⋃ i B i =A ⋃iBi=A and ∀i≠j: B i ∩ B j =∅ ∀i≠j:Bi∩Bj=∅

That is it is a splitting of the set into disjoint subsets that cover the original set. Every member of the original set is in one and only one subset.

You should be familiar with a partition from your experiences at school. Your year (the set of people your age at your school) was probably partitioned into classes. You were in one...

Working to master your English skills?

Grammarly can help. Get rid of typos, grammatical mistakes, and misused words with a single click!

M.A. in Mathematics, Harvard University (Graduated 1976)Author has 1.9K answers and 1.6M answer views4y

Related

How many subsets does a set with 4 elements have?

2^4 = 16. The empty set, {A}, {B}, {C}, {D}, {A, B}, {A, C}, {A, D}, }B, C}, {B, D}, {C, D}, {A, B, C}, {A, B, D}, {A,C, D}, {B, C, D}, and {A, B, C, D} itself.

Generally, to construct a subset, list all elements of the set and to each element assign either YES (belongs to the subset) or NO (does not belong to the subset). This can be done in 2 ways for each element; therefore, if the original set has n elements, the total number of possible choices is 2*2*2*…*2 (n times), i.e. 2^n.

James Fullwood

PhD in Mathematics, Florida State University (Graduated 2012)Author has 367 answers and 971K answer views4y

Related

How is it possible to have a set with one element only?

Consider for example the set of all planets you've been to. My guess is this set has a single element.

Rohini Ramachandran Upvoted by

Samuel Gomes da Silva

, Ph.D. Mathematics & Set Theory, University of São Paulo (2004) and

Dwight House

, Ph. D. Mathematics, Duke University (1972)3y

Related

Why is the empty set considered a set?

My little brother had trouble with the concept of empty sets when he was first learning about them in high school. This is how I explained it to him (this might not be entirely mathematical, kindly correct me if anything I say is not logical):

A set is like a box with some stuff in it. It is a well defined collection of objects. When you look inside the box, you should be able to tell if something’s in it or not, there should be no ambiguity.

Now let’s consider an empty set. It’s a set with nothing in it. So, it’s like an empty box. A box is still a box even if there’s nothing in it!

I used this Sponsored by Aspose

What is Aspose.OCR for C++ library?

OCR API capable of extracting text from BMP, JPEG and other images having different fonts and styles.

Scott Brickner

I regret not majoring in math, so I do it as a hobbyAuthor has 12.8K answers and 4.2M answer viewsAug 1

Related

Can an element be a set?

Depending on your set theory, it’s possible that it can’t be anything else.

Most mathematicians use ZFC as their set theory. In ZFC, essentially everything is a set. There are some things that aren’t sets (informally called “classes”), but those things can’t be elements.

There are set theories in which there are things that are not themselves sets, but can still be elements of sets. These are generally called “ur-elements”.

Sets can always be elements. The complicated question is whether an element can be something other than a set.

Dan Grubb

Ph. D. in Mathematics, Kansas State University (Graduated 1986)Upvoted by

David Joyce

, Ph.D. Mathematics, University of Pennsylvania (1979)Author has 185 answers and 59.2K answer viewsMar 6

Related

If a set A has an infinite number of elements, what is its cardinality?

This is like asking what the cardinality is for a non-empty set.

स्रोत : www.quora.com

## If a set A has 4 elements then total number of proper subsets of set A is

If a set A has 4 elements then total number of proper subsets of set A is Home > English > Class 12 > Maths > Chapter > Mock Test Paper -iv >

If a set A has 4 elements the...

If a set A has 4 elements then total number of proper subsets of set A is

Updated On: 27-06-2022

Get Answer to any question, just click a photo and upload the photo and get the answer completely free,

UPLOAD PHOTO AND GET THE ANSWER NOW!

Text Solution Open Answer in App A 16 B 14 C 15 D 17 Answer

The correct Answer is C

Step by step solution by experts to help you in doubt clearance & scoring excellent marks in exams.

## Related Videos 412659364 0 4.5 K 0:42

If a set A has 4 elements , then the total number of proper subsets of set A is : 257120558 0 700 0:40 A set has 4 4

elements,then total number of subsets is:` 647552608 0 2.5 K 2:15

The total number of subsets of a finite set A has 56 more elements then the total number of subsets of another finite set B. What is the number of elements in the set A ?

What is the total number of proper subsets of a set containing n elements?

41593 0 9.0 K 1:49

What is the total number of proper subsets of a set containing n elements? 647551902 0 6.3 K 2:09

What is the total number of proper subsets of a set containing n elements ? 467047180 0 7.2 K 1:41

A set has n elements, then the total number of subsets of A is

Add a public comment...

Popular Chapters by Class:

Class 6 Algebra

Basic Geometrical Ideas

Data Handling Decimals Fractions Class 7

Algebraic Expressions

Comparing Quantities

Congruence of Triangles

Data Handling

Exponents and Powers

Class 8

Algebraic Expressions and Identities

Comparing Quantities

Cubes and Cube Roots

Data Handling

Direct and Inverse Proportions

Class 9

Areas of Parallelograms and Triangles

Circles Coordinate Geometry Herons Formula

Introduction to Euclids Geometry

Class 10

Areas Related to Circles

Arithmetic Progressions

Circles Coordinate Geometry

Introduction to Trigonometry

Class 11 Binomial Theorem

Complex Numbers and Quadratic Equations

Conic Sections

Introduction to Three Dimensional Geometry

Limits and Derivatives

Class 12

Application of Derivatives

Application of Integrals

Continuity and Differentiability

Determinants

Differential Equations