Answer: 20
Explanation:
First, let’s look at the facts of the question:
- To get from A to B, the robot must move 17 units to the right and 5 units upwards = a total of 22 units.
- The robot can only go up or right and constantly alternates its step between 2 and 3 units. Thus, it can either start with a 2-unit or 3-unit step.
Let’s see what happens when the robot starts with a 3-unit step:
3, 2, 3, 2, 3, 2, 3, 2 -> After 8 steps, the robot has passed 20 units, leaving only 2 units to the next step. Since the next step must be a 3-unit step and the robot can’t overshoot point B, we learn that starting with a 3-unit step isn’t possible.
Let’s see what happens when the robot starts with a 2-unit step:
2, 3, 2, 3, 2, 3, 2, 3 -> After 8 steps, the robot has passed 20 units. The next step of the robot must be a 3-unit step, which is the exact number of units remaining to reach point B.
Thus, we know the robot must start with a 3-unit step.
Now we need to determine how many different ways the robot goes from A to B according to the alternating speed pattern we found (2, 3, 2, 3, 2, 3, 2, 3, 2).
Since the robot can go upwards a total of 5 units (due to the limitations in the question), it must include one 3-unit step upwards and one 2-unit step upwards.
As we have already seen, the robot’s path consists of four 3-unit steps and five 2-unit steps.
- For the 2-unit step upwards – the robot has five different options (since there are five 2-unit steps in its path).
- Similarly, for the 3-unit step upwards– the robot has four different options.
Thus, the total number of possible paths that the robot can go from point A to B is 5x4=20.