Combinatorics Problem: Finding Number of Subsets in a Set of Four-Digit Numbers

  • Thread starter Thread starter Government$
  • Start date Start date
  • Tags Tags
    Combinatorics
Click For Summary
The discussion revolves around calculating the number of four-digit numbers formed from the digits {1, 2, 3}, ensuring each digit appears at least once. The initial calculation suggests there are 54 elements in the set, but there is uncertainty about this figure. Participants seek clarification on the definition of subsets in this context and whether the calculation of elements is accurate. Additionally, the conversation touches on the relationship between the number of elements in a set and the total number of possible subsets. The focus remains on understanding the combinatorial aspects of the problem.
Government$
Messages
87
Reaction score
1

Homework Statement


Let X be a set containing all four digit numbers made up of {1,2,3}, where every number contains every digit at lease once. Number of all subsets is:

The Attempt at a Solution



So firs i have to find number of elements in the set:

3!*3 + 3*12 = 54

Now what they mean by subsets? And did i calculated number of elements correctly?
 
Physics news on Phys.org
54 seems too many. Pls explain your calculation.
For the second part, if there are N elements in a set, how many subsets does it have?
 
It could be they want to know how many possible subsets of X there are.
i.e. any member of X would be a subset of X of size 1. any pair of members would be a subset size 2, etc.
[haruspex beat me :)]
 
Last edited:

Similar threads

  • · Replies 23 ·
Replies
23
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
Replies
23
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 12 ·
Replies
12
Views
4K
  • · Replies 11 ·
Replies
11
Views
2K
Replies
21
Views
15K
  • · Replies 4 ·
Replies
4
Views
2K