SAT Math : How to find the greatest or least number of combinations

Study concepts, example questions & explanations for SAT Math

varsity tutors app store varsity tutors android store varsity tutors amazon store varsity tutors ibooks store

Example Questions

1 3 Next →

Example Question #21 : Permutation / Combination

Paths

Refer to the provided diagram.

How many ways can a route be drawn that goes from Point A, through Point B, to Point C, then back through Point B, and back to Point A, so that no path is taken twice?

Possible Answers:

Correct answer:

Explanation:

The multiplication principle can be applied here. There are 5 ways to get from Point A to Point B, and 3 ways to get from Point B to Point C. Since traveling the same path twice is not allowed,  there are 2 ways left to get from Point C to Point B, and 4 ways left to get from Point B to Point A.

Multiply:

 

There are 120 possible routes.

1 3 Next →
Learning Tools by Varsity Tutors