Statement for Linked Answer Questions 84 & 85:
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at (i, j) then it can move to either (i+1, j) or (i, j+1).
How many distinct paths are there for the

Question

Statement for Linked Answer Questions 84 & 85:
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at (i, j) then it can move to either (i+1, j) or (i, j+1).
How many distinct paths are there for the robot to reach the point (10,10) starting from the initial position (0,0)?

Accepted Answer

(20 10). The correct option, (20 10), represents the number of ways to arrange 10 moves up and 10 moves right in a sequence of 20 total moves, which is calculated using the binomial coefficient formula. This accounts for the distinct paths the robot can take to reach the point (10,10) from (0,0).

Solution

Related GATE Engineering Mathematics questions