# N-gon

How many diagonals has convex 11-gon?

Result

x =  44

#### 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. The confectionery
The confectionery sold 5 kinds of ice cream. In how many ways can I buy 3 kinds if order of ice creams does not matter?
2. Confectionery
The village markets have 5 kinds of sweets, one weighs 31 grams. How many different ways a customer can buy 1.519 kg sweets.
3. Disco
On the disco goes 12 boys and 15 girls. In how many ways can we select four dancing couples?
4. 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
5. Fish tank
A fish tank at a pet store has 8 zebra fish. In how many different ways can George choose 2 zebra fish to buy?
6. Trinity
How many different triads can be selected from the group 38 students?
7. Blocks
There are 9 interactive basic building blocks of an organization. How many two-blocks combinations are there?
8. Combinations
From how many elements we can create 990 combinations 2nd class without repeating?
9. Division
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?
10. Combinations
How many elements can form six times more combinations fourth class than combination of the second class?
11. Permutations without repetition
From how many elements we can create 720 permutations without repetition?
12. Diagonals
What x-gon has 54 diagonals?
13. One green
In the container are 45 white and 15 balls. We randomly select 5 balls. What is the probability that it will be a maximum one green?
14. Calculation of CN
Calculate: ?
15. Cards
The player gets 8 cards of 32. What is the probability that it gets a) all 4 aces b) at least 1 ace
16. 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.
17. Theorem prove
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?