In the figure above, a path from point A to point D is determined by moving upward or to the right along the grid lines. How many different paths can be drawn from A to D that do not include either B or C ?

(A) Two

(B) Four

(C) Six

(D) Eight

(E) Sixteen

Level of Difficulty

This is an easy problem as long as you are systematic in your approach, which is a useful tip on many SAT questions. Start on the path that moves along the upper left-most path, carefully working your way toward the path that moves along the lower right-most path. Counting paths that do not involve corners B or C, you will find there are four, which is choice B.

Our SAT tutors can help you become very proficient with all types of math SAT questions.

- Fractions
- Area of Rectangle
- Visual Exercise
- Combined Rates
- 3D Solids
- Integers
- Simple Arithmetic
- Coordinate Pairs
- Signed Numbers
- Decimal Equivalents
- Displacement
- Symmetry
- Integers
- Triangles
- Integer Properties
- Cubic Functions
- Proportions
- Divisibility Rules
- Simple Squares
- Sets
- Sequences
- Rate Vectors
- Number Lines
- Word Problem
- Triangles
- Graph Theory
- 3D Solids
- Positive Integers
- Number Theory
- Even Integers
- Number Theory