Answer:
Step-by-step explanation:
The set {1,2,3,4,5,6} has a total of 6! permutations
a. Of those 6! permutations, 5!=120 begin with 1. So first 120 numbers would contain 1 as the unit digit.
b. The next 120, including the 124th, would begin with '2'
c. Then of the 5! numbers beginning with 2, there are 4!=24 including the 124th number, which have the second digit =1
d. Of these 4! permutations beginning with 21, there are 3!=6 including the 124th permutation which have third digit 3
e. Among these 3! permutations beginning with 213, there are 2 numbers with the fourth digit =4 (121th & 122th), 2 with fourth digit 5 (numbers 123 & 124) and 2 with fourth digit 6 (numbers 125 and 126).
Lastly, of the 2! permutations beginning with 2135, there is one with 5th digit 4 (number 123) and one with 5 digit 6 (number 124).
∴ The 124th number is 213564
Similarly reversing the above procedure we can determine the position of 321546 to be 267th on the list.
I ain’t never seen two pretty best friends
Answer:
Step-by-step explanation:
If 11+2=1
We want to determine what the value of 9+5 is.
- 11 O'Clock+2 Hours =1 O'Clock
Therefore:
- 9 O'Clock + 5 Hours =2 O'Clock
688,747,536 ways in which the people can take the seats.
<h3>
</h3><h3>
How many ways are there for everyone to do this so that at the end of the move, each seat is taken by exactly one person?</h3>
There is a 2 by 10 rectangular greed of seats with people. so there are 2 rows of 10 seats.
When the whistle blows, each person needs to change to an orthogonally adjacent seat.
(This means that the person can go to the seat in front, or the seats in the sides).
This means that, unless for the 4 ends that will have only two options, all the other people (the remaining 16) have 3 options to choose where to sit.
Now, if we take the options that each seat has, and we take the product, we will get:
P = (2)^4*(3)^16 = 688,747,536 ways in which the people can take the seats.
If you want to learn more about combinations:
brainly.com/question/11732255
#SPJ!
