There are 20! number of ways for everyone to do this so that at the end of the move, each seat is taken by exactly one person.
People are seated in a 2 by 10 rectangle grid. All 20 persons stand up from their seats and relocate to an orthogonally neighboring one upon the blowing of a whistle.
Now, we have to find the number of possible ways in which each seat is taken up by exactly one person after the move.
As the number of people is 20 and 20 seats are to filled exactly once.
So, the number of ways = 20!
Learn more about number here:
brainly.com/question/1991469
#SPJ1
Arithmetic sequences have a pattern of numbers that are positive and negative but are a constant amount.
In this case the answer is A.
The length of segment BC can be determined using the distance formula, wherein, d = sqrt[(X_2 - X_1)^2 + (Y_2 - Y_1)^2]. The variable d represent the distance between the two points while X_1, Y_1 and X_2, Y_2 represent points 1 and 2, respectively. Plugging in the coordinates of the points B(-3,-2) and C(0,2) into the equation, we get the length of segment BC equal to 5.
$10.50
10 Tickets would be $105.00
$105.00 - $10.50 = $94.50 so 9 Tickets would be $94.50
$105.00 + $94.50 = $199.50
$205.00 - $199.50 = $5.50 which isn't enough for another ticket.
10 Tickets + 9 Tickets = 19 Tickets.
