15 boys and 10 girls are in the class. On school competition of them is selected 6-member team composed of 4 boys and 2 girls. How many ways can we select students?
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:
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?
On the disco goes 12 boys and 15 girls. In how many ways can we select four dancing couples?
- First class
The shipment contains 40 items. 36 are first grade, 4 are defective. How many ways can select 5 items, so that it is no more than one defective?
- 2nd class combinations
From how many elements you can create 4560 combinations of the second class?
- Weekly service
In the class are 20 pupils. How many opportunities have the teacher if he wants choose two pupils randomly who will weeklies?
How many different triads can be selected from the group 38 students?
How many ways can we choose 5 pcs of salami, if we have 6 types of salami for 10 pieces and one type for 4 pieces?
- 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?
- 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?
- Hockey match
The hockey match ended with result 3:1. How many different storylines may have the match?
Hockey match ended 8:2. How many different matches could be?
- Points in plane
The plane is given 12 points, 5 of which is located on a straight line. How many different lines could by draw from this points?
- Count of triangles
Given a square ABCD and on each side 8 internal points. Determine the number of triangles with vertices at these points.
- Calculation of CN
The player gets 8 cards of 32. What is the probability that it gets a) all 4 aces b) at least 1 ace
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 sentense: If the natural number n is divisible by six, then n is divisible by three. From what assumption we started?