9 heroes galloping on 9 horses behind. How many ways can sort them behind?
Leave us a comment of example and its solution (i.e. if it is still somewhat unclear...):
Showing 0 comments:
Be the first to comment!
To solve this example are needed these knowledge from mathematics:
Next similar examples:
At the table sit 8 people, 4 on one side and 4 on the other side. Among them are 3 pairs. Every pair wants to sit opposite each other. How many ways can they sit?
In how many ways can be divided gold, silver and bronze medal among 21 contestant?
- 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).
- Olympics metals
In how many ways can be win six athletes medal positions in the Olympics? Metal color matters.
- Football league
In the 5th football league is 10 teams. How many ways can be filled first, second and third place?
In how many ways can 9 shuttle vans line up at the airport?
How many ways can select 4 fields on classic chess board with 64 fields, so that fields don't has the same color?
- PIN - codes
How many five-digit PIN - code can we create using the even numbers?
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?
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?
Combination lock will open when the right choice of 5 numbers (from 1 to 12 inclusive) is selected. A. How many different lock combinations are possible? B. Is he combination lock named appropriately?
- Cars plates
How many different licence plates can country have, given that they use 3 letters followed by 3 digits?
- Morse alphabet
Calculate how many words of Morse code to create compiling commas and dots in the words of one to four characters.
How many different 7 digit natural numbers in which no digit is repeated, can be composed from digits 0,1,2,3,4,5,6?
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.
In the non-transparent bags are red, white, yellow, blue tokens. We 3times pull one tokens and again returned it, write down all possibilities.
- 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?