# 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?

Result

a) n =  9
b) n =  6
c) n =  5

#### Solution:

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

Be the first to comment!

## Next similar examples:

1. 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).
2. 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?
3. 7 heroes
9 heroes galloping on 9 horses behind. How many ways can sort them behind?
4. How many 2
How many three lettered words can be formed from letters A B C D E G H if repeats are: a) not allowed b) allowed
5. Football league
In the 5th football league is 10 teams. How many ways can be filled first, second and third place?
6. Pins 2
how many different possible 4 digits pins can be found on the 10-digit keypad?
7. Olympics metals
In how many ways can be win six athletes medal positions in the Olympics? Metal color matters.
8. Mumbai
A job placement agency in Mumbai had to send ten students to five companies two to each. Two of the companies are in Mumbai and others are outside. Two of the students prefer to work in Mumbai while three prefer to work outside. In how many ways assignment
9. Medals
In how many ways can be divided gold, silver and bronze medal among 21 contestant?
10. Disco
On the disco goes 12 boys and 15 girls. In how many ways can we select four dancing couples?
11. Vans
In how many ways can 9 shuttle vans line up at the airport?
12. Lock
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?
13. Pairs
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?
14. 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.
15. 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?
16. 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.
17. Virus
We have a virus that lives one hour. Every half hour produce two child viruses. What will be the living population of the virus after 3.5 hours?