In a video game, a player is faced with the task of moving from point A to point B to point C, and then returning from point C to point A through point B without retracing any path. There are 5 paths from point A to point B, and 8 paths from point B to point C. In how many different ways can the player accomplish the task?

🎲 Try a Random Question  |  Total Questions in Quiz: 25  |  🧠 Study this quiz with Flashcards
This question is part of a full practice quiz:
GMAT Math: Arithmetic Practice Test — practice the complete quiz, review flashcards, or try a random question.


In a video game, a player is faced with the task of moving from point <em>A</em> to point <em>B</em> to point <em>C</em>, and then returning from point <em>C</em> to point <em>A</em> through point <em>B</em> without retracing any path. There are 5 paths from point <em>A</em> to point <em>B</em>, and 8 paths from point <em>B</em> to point <em>C</em>. In how many different ways can the player accomplish the task?