Proving that these are all possible permutations

  • Context: High School 
  • Thread starter Thread starter maxbashi
  • Start date Start date
  • Tags Tags
    Permutations
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
2 replies · 2K views
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).