a textbook search committee is condisdering 10 books for possible adoption. The committee has decided to select 5 of the ten for
further consideration. in how many ways can it do so
2 answers:
Answer:
They can do so in 252 ways.
Step-by-step explanation:
The order in which the books are chosen is not important. So we use the combinations formula to solve this question.
Combinations formula:
is the number of different combinations of x objects from a set of n elements, given by the following formula.

In this question:
5 books from a set of 10. So

They can do so in 252 ways.
Answer:
∴ Number of ways to select 5 books from 10 books for adoption is 252 .
Step-by-step explanation:
A Permutation is an ordered Combination. When the order does matter it is a Permutation. There are basically two types of permutation:
- Repetition is Allowed: such as above. It could be "555".
- No Repetition: for example the first three people in a running race. You can't be first and second.
Formula is given by:
, where n is the number of things to choose from, and we choose r of them, no repetitions, order matters. Here , n=10 , r=5.
⇒ 
⇒ 
⇒ 
∴ Number of ways to select 5 books from 10 books for adoption is 252 .
You might be interested in
Answer: 3:1
Step-by-step explanation:
Answer:
1. -105
2. 3
3. 165
1. -35
2. 55
3. y= mx + b
= -105 + 0
= -105
Answer:
AB
Step-by-step explanation:
I believe because on the other side it is AE over ED so I just repeated the pattern.
Answer:
6/8
4/10
9/12
9/20
9/20
Step-by-step explanation:
Answer:
100
Step-by-step explanation:
because -100 0 then positive 100