Menu Close

In-the-diagram-it-is-possible-to-travel-only-along-an-edge-in-the-direction-indicated-by-the-arrow-How-many-different-routes-from-A-to-B-are-there-in-all-




Question Number 16936 by Tinkutara last updated on 28/Jun/17
In the diagram, it is possible to travel  only along an edge in the direction  indicated by the arrow. How many  different routes from A to B are there  in all?
Inthediagram,itispossibletotravelonlyalonganedgeinthedirectionindicatedbythearrow.HowmanydifferentroutesfromAtoBarethereinall?
Commented by Tinkutara last updated on 28/Jun/17
Commented by ajfour last updated on 28/Jun/17
N=(1×3)+(2×1×3)+(2×1)     =3+6+2 = 11 .
N=(1×3)+(2×1×3)+(2×1)=3+6+2=11.
Commented by Tinkutara last updated on 28/Jun/17
Please explain.
Pleaseexplain.
Commented by ajfour last updated on 28/Jun/17
(A→Y)×(Y→B)  +(A→X)×(X→B)  +(A→X)×(X→Y)×(Y→B)  =1×3  +  2×1  +  2×1×3  = 11 .
(AY)×(YB)+(AX)×(XB)+(AX)×(XY)×(YB)=1×3+2×1+2×1×3=11.
Commented by Tinkutara last updated on 29/Jun/17
Thanks Sir!
ThanksSir!

Leave a Reply

Your email address will not be published. Required fields are marked *