Proving that these are all possible permutations

  • Context: High School 
  • Thread starter Thread starter maxbashi
  • Start date Start date
  • Tags Tags
    Permutations
Click For Summary
SUMMARY

The discussion centers on proving the total number of permutations for a set of numbers, specifically 1, 2, and 3, which results in 6 distinct arrangements: 123, 132, 213, 231, 312, and 321. The factorial notation, denoted as 3! = 6, is established as the definitive method for calculating permutations. Additionally, the discussion highlights that for the set of numbers 1 and 2, the only permutations are 12 and 21, confirming the validity of the combinatorial approach.

PREREQUISITES
  • Understanding of factorial notation (e.g., 3! = 6)
  • Basic knowledge of combinatorics
  • Familiarity with the concept of permutations
  • Ability to apply combinatorial identities
NEXT STEPS
  • Study the formal definitions of permutations in combinatorics
  • Learn about advanced combinatorial identities and their applications
  • Explore the concept of restricted permutations and their calculations
  • Investigate the use of permutations in probability theory
USEFUL FOR

Mathematicians, students studying combinatorics, educators teaching permutation concepts, and anyone interested in understanding the fundamentals of arrangement calculations.

maxbashi
Messages
18
Reaction score
0
So if I have numbers 1,2,3, intuitively you can say that there are 6 permutations:

123
132
213
231
312
321

If there any way to rigorously prove that these are the only possible arrangements of these three numbers? Even more simple, is there any way to prove that 12 and 21 are the only permutations of 1 and 2? I don't need a ton of detail if it's going to be tedious, I'm just curious.

Thanks
 
Mathematics news on Phys.org
There are only 3! = 6 possible arrangements (three possibilities for the first position, two possibilities for the second, and one for the third), and you've listed six different arrangement. Thus, you listed all possible arrangements.
 
Hey maxbashi and welcome to the forums.

There is actually a set of formal definitions for permutations that you could use and would be helpful if you had to do more general or abstract permutations but for this specific problem it might be wise to use Number Nines advice and use the combinatoric identity for the number of unrestricted permutations (i.e. 3! = 6).
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 45 ·
2
Replies
45
Views
5K
  • · Replies 29 ·
Replies
29
Views
5K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 31 ·
2
Replies
31
Views
6K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K