SOLUTION: In the city where Aiko lives, there are 4 buses that go from point A to point B, 3 buses that go from point B to point C, and 5 buses that go from point C to point D.
How many d
Algebra ->
Geometry-proofs
-> SOLUTION: In the city where Aiko lives, there are 4 buses that go from point A to point B, 3 buses that go from point B to point C, and 5 buses that go from point C to point D.
How many d
Log On
Question 1067127: In the city where Aiko lives, there are 4 buses that go from point A to point B, 3 buses that go from point B to point C, and 5 buses that go from point C to point D.
How many different ways can Aiko use the buses to travel from A to B to C to D?
There are ___ different ways that Aiko can use the buses to get from A to B to C to D. Answer by Boreal(15235) (Show Source):
You can put this solution on YOUR website! This is 4*3*5, because there are 4 possibilities for A to B, then 3 new possibilities from B to C and 5 possibilities from C to D.
60 different ways.
