Ask your own question, for FREE!
Mathematics 18 Online
OpenStudy (anonymous):

9. Amy has to visit towns B and C in any order. The roads connecting these towns with her home are shown on the diagram. How many different routes can she take starting from A and returning to A, going through both B and C (but not more than once through each) and not travelling any road twice on the same trip?

OpenStudy (hba):

WELCOME TO OPEN STUDY

OpenStudy (hba):

ITS A SAT QUESTION

OpenStudy (hba):

|dw:1342345456003:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!