\[\sum_{n=1}^{7} 2(-2)^{n-1}\]
The square root of 10. The first answer
Answer:
35 different routes
Step-by-step explanation:
The problem of how many different routes are possible if a driver wants to make deliveries at 4 locations among 7 locations is a combination problem.
Combination problems are usually selection problems, of all or part of a set of options, without considering the order in which options are selected.
The number of combinations of n objects taken r at a time is: ⁿCᵣ
So, the number of ways the driver can make deliveries at 4 locations out of 7 locations of given by
⁷C₄ = 35 different ways.
Hence, 35 different routes are possible to make deliveries at 4 locations out of 7 locations.
Hope this Helps!!!
