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:

Solution in text a) n =
Solution in text b) n =
Solution in text c) n =







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

Showing 0 comments:
1st comment
Be the first to comment!
avatar




To solve this example are needed these knowledge from mathematics:

Would you like to compute count of combinations? See also our variations calculator. See also our permutations calculator.

Next similar examples:

  1. Neighborhood
    glasses_1 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?
  2. 7 heroes
    7statocnych 9 heroes galloping on 9 horses behind. How many ways can sort them behind?
  3. How many 2
    chart_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
  4. Football league
    football In the 5th football league is 10 teams. How many ways can be filled first, second and third place?
  5. Medals
    medails In how many ways can be divided gold, silver and bronze medal among 21 contestant?
  6. Olympics metals
    olympics In how many ways can be win six athletes medal positions in the Olympics? Metal color matters.
  7. Pins 2
    pin_keyboard how many different possible 4 digits pins can be found on the 10-digit keypad?
  8. Mumbai
    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. Disco
    vencek On the disco goes 12 boys and 15 girls. In how many ways can we select four dancing couples?
  10. Lock
    combination-lock Combination lock will open when the right choice of 3 numbers (from 1 to 25 inclusive) is selected. A. How many different lock combinations are possible? B. Is he combination lock named appropriately?
  11. Pairs
    pair 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?
  12. Vans
    shuttlevan In how many ways can 7 shuttle vans line up at the airport?
  13. Division
    skauti_3 Division has 18 members: 10 girls and 6 boys, 2 leaders. How many different patrols can be created, if one patrol is 2 boys, 3 girls and 1 leader?
  14. Theorem prove
    thales_1 We want to prove the sentense: If the natural number n is divisible by six, then n is divisible by three. From what assumption we started?
  15. Tokens
    kamene In the non-transparent bags are red, white, yellow, blue tokens. We 3times pull one tokens and again returned it, write down all possibilities.
  16. Variations
    pantagram 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. Variations 4/2
    pantagram_1 Determine the number of items when the count of variations of fourth class without repeating is 600 times larger than the count of variations of second class without repetition.