A student wishes to walk from the corner X to the corner Y through streets as given in the street map as shown below.
He does not move to the left or downwards.
(i) Find the number of different routes from X to Y the student can take.
(ii) The student wishes to visit P on his way from X to Y as indicated in the diagram below. Find the number of different routes he can take.
Category: H1 Math
Cubic Equation
Machine Codes
Click on the title of this posting to see the question and worked solution.
Many students have problems with solving part (iii) of the question.
It is easier to solve with the aid of a Venn Diagram. Once the required region is identified, think of the possible events that can occur within that region, and come out with the required probabilities. If you are still having problems, whatsapp me! 🙂