hard · GMAT Quant
A robot walks from (0,0) to (5,6) using only unit steps east and north.
How many distinct paths are possible?
- 2048
- 30
- 330
- 462
- 11
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?