Interactive · 2 questions
Suppose a taxi has to travel from point A to point B in the shortest distance possible, in how many ways can it do that? (the taxi cannot drive through diagonals :) )
The taxi can move either via ABC or ADC, that is 1 up and 1 right, or 1 right and 1 up. See a pattern? As you may have noticed, the taxi can move only upwards and rightwards (in this question specifically) as its destination is in the top right of the box? Try another one.
In how many ways can a Taxi drive from A to B in the shortest way possible?
In this question, the possible ways are ACHB (1 up + 2 right), AFHB (1 right + 1 up + 1 right) and AFDB (2 right + 1 up) If you observe carefully, in all of these paths you go a total of 2 rights and 1 up