# Pairs

At the table sit 10 people, 5 on one side and 5 on the other side. Among them are 3 pairs. Every pair wants to sit opposite each other.

How many ways can they sit?

Result

n =  11520

#### Solution:

$n = (2 \cdot 5) \cdot (2 \cdot 4) \cdot (2 \cdot 3)\cdot (10-2\cdot 3)! = 11520$

Our examples were largely sent or created by pupils and students themselves. Therefore, we would be pleased if you could send us any errors you found, spelling mistakes, or rephasing the example. Thank you!

Leave us a comment of this math problem and its solution (i.e. if it is still somewhat unclear...):

Showing 1 comment:
Math student
super dude

Tips to related online calculators
Would you like to compute count of combinations?

## Next similar math problems:

1. Seating
How many ways can 6 people sit on 6 numbered chairs (e. G. , seat reservation on the train)?
2. Medals
In how many ways can be divided gold, silver and bronze medal among 21 contestant?
3. 7 heroes
9 heroes galloping on 9 horses behind. How many ways can sort them behind?
4. Permutations without repetition
From how many elements we can create 720 permutations without repetition?
5. Election 4
In a certain election there are 3 candidates for president 5 for secretory and 2 for tresurer. Find how many ways the election may (turn out/held).
6. Olympics metals
In how many ways can be win six athletes medal positions in the Olympics? Metal color matters.
7. Numbers
How many different 3 digit natural numbers in which no digit is repeated, can be composed from digits 0,1,2?
8. Football league
In the 5th football league is 10 teams. How many ways can be filled first, second and third place?
9. Variations
Determine the number of items when the count of variations of fourth class without repeating is 42 times larger than the count of variations of third class without repetition.
10. Tokens
In the non-transparent bags are red, white, yellow, blue tokens. We 3times pull one tokens and again returned it, write down all possibilities.
11. Theorem prove
We want to prove the sentence: If the natural number n is divisible by six, then n is divisible by three. From what assumption we started?
12. Elections
In elections candidate 10 political parties. Calculate how many possible ways can the elections finish, if any two parties will not get the same number of votes.
13. Peak
Uphill leads 2 paths and 1 lift. a) How many options back and forth are there? b) How many options to get there and back by not same path are there? c) How many options back and forth are there that we go at least once a lift?
14. PIN - codes
How many five-digit PIN - code can we create using the even numbers?
15. Neighborhood
I have 7 cups: 1 2 3 4 5 6 7. How many opportunities of standings cups are there if 1 and 2 are always neighborhood?
16. Vans
In how many ways can 9 shuttle vans line up at the airport?
17. Guests
How many ways can 7 guests sit down on 8 seats standing in a row?