Question 10
Back to Exercise
How many shortest routes are there from A to B along a street grid?
I. A and B are corners of the same rectangular grid.
II. B is 7 blocks from A by a shortest route.
- A Statement I alone is sufficient, but Statement II alone is not sufficient
- B Statement II alone is sufficient, but Statement I alone is not sufficient
- C Each statement alone is sufficient
- D Both statements together are sufficient, but neither statement alone is sufficient
- E Statements I and II together are not sufficient Correct
Correct Answer: Option E
I gives no sizes. Not sufficient.
II: 7 blocks could be 4 + 3 (35 routes) or 5 + 2 (21). Not sufficient.
Together: still not fixed. Not sufficient.
Discussion & Comments 0
Share your method, a shortcut, or ask about a step you didn't follow.
No comments yet. Be the first to share your solution!