hard · GMAT Quant
A software agent is programmed to navigate a grid from point (0,0) to (6,4) using only unit steps north or east. If the agent must pass through (3,2) but is prohibited from entering (5,2)
What is the total number of valid paths?
- 60
- 100
- 210
- 40
- 70
Sign up free to see the explanation and track your rank →
More GMAT Quant practice
- Including both endpoints, how many distinct integer price points are in this range?
- Which of the following expressions must result in a positive value?
- Which property of arithmetic justifies that first step?
- Which of the following must also be an even integer?
- Which of the following inequalities correctly represents this range?
- Which of the following includes the number 0?
- How many unique meal combinations can a customer create?
- What is the probability that the lightbulb is functional?