Forum Home > GMAT > Quantitative > Problem Solving (PS)
Events & Promotions
|
|
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Dec 1207:30 AM PST
-08:30 AM PST
Join the conversation to learn more about INSEAD vs LBS
Dec 1310:00 AM EST
-12:00 PM EST
Have you ever wondered how to score a PERFECT 805 on the GMAT? Meet Julia, a banking professional who used the Target Test Prep course to achieve this incredible feat. Julia's story is nothing short of an inspiration.
Dec 1410:00 AM EST
-12:00 PM EST
Think a 100% GMAT Verbal score is out of your reach? Target Test Prep will make you think again! Our course uses techniques such as topical study and spaced repetition to maximize knowledge retention and make studying simple and fun.
Dec 1411:00 AM IST
-01:00 PM IST
Attend this session to learn how to Deconstruct arguments, Pre-Think Author’s Assumptions, and apply Negation Test.- Dec 15
11:00 AM IST
-01:00 PM IST
Attend this free GMAT Algebra Webinar and learn how to master the most challenging Inequalities and Absolute Value problems with ease. - Dec 16
08:00 AM PST
-11:59 PM PST
GMAT Club 12 Days of Christmas is a 4th Annual GMAT Club Winter Competition based on solving questions. This is the Winter GMAT competition on GMAT Club with an amazing opportunity to win over $40,000 worth of prizes! - Dec 17
09:00 AM PST
-10:00 AM PST
Join Manhattan Prep instructor Whitney Garner for a fun—and thorough—review of logic-based (non-math) problems, with a particular emphasis on Data Sufficiency and Two-Parts. - Dec 18
10:00 AM PST
-11:00 AM PST
Here is the essential guide to securing scholarships as an MBA student! In this video, we explore the various types of scholarships available, including need-based and merit-based options.
16 Sep 2014, 01:52
Kudos
Bookmarks
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
95%
(hard)
Question Stats:
33% (01:52) correct
67%
(01:57)
wrong
based on 97
sessions
History
Date
Time
Result
Not Attempted Yet
An ant is clinging to one corner of a box in the shape of a cube. The ant wants to get to the most distant corner of the box by crawling only along the edges of the cube and without ever revisiting a place it has been. How many different paths can the ant take to the most distant corner?
A. 6
B. 12
C. 18
D. 24
E. 30
A. 6
B. 12
C. 18
D. 24
E. 30
16 Sep 2014, 01:52
Kudos
Bookmarks
Official Solution:
An ant is clinging to one corner of a box in the shape of a cube. The ant wants to get to the most distant corner of the box by crawling only along the edges of the cube and without ever revisiting a place it has been. How many different paths can the ant take to the most distant corner?
A. 6
B. 12
C. 18
D. 24
E. 30
First, draw a picture of the situation.
Now, look for patterns as you construct and count paths that don't retrace or touch themselves at all. One of the first patterns that is useful to spot has to do with the initial choice about which edge to crawl along. The ant can take any one of three initial paths:
These three initial choices are equivalent, because the cube is symmetric. Thus, we can just consider one of the initial paths, count up the ways from that point forward, then multiply by 3.
Let's take the middle choice:
First, try to go immediately to the goal. We get two similar paths:
If we stopped at this point, we would get \(2 \times 3 = 6\) total paths. This is in fact the number of shortest paths to the goal. However, we can construct additional "zigzag" paths that also satisfy the constraints of the problem.
There are no more possibilities without the path touching itself, so this initial edge leads to 6 possible paths. Since there are 3 initial edges, the total number of possible paths is \(6 \times 3 = 18\).
Alternatively, we can map the corners by their "distance" away from the starting point, measured in edges:
Taking the leftmost edge to start, we can construct the 6 possible paths leading from that edge:
Again, there are \(6 \times 3 = 18\) possible paths.
Answer: C
An ant is clinging to one corner of a box in the shape of a cube. The ant wants to get to the most distant corner of the box by crawling only along the edges of the cube and without ever revisiting a place it has been. How many different paths can the ant take to the most distant corner?
A. 6
B. 12
C. 18
D. 24
E. 30
First, draw a picture of the situation.
Now, look for patterns as you construct and count paths that don't retrace or touch themselves at all. One of the first patterns that is useful to spot has to do with the initial choice about which edge to crawl along. The ant can take any one of three initial paths:
These three initial choices are equivalent, because the cube is symmetric. Thus, we can just consider one of the initial paths, count up the ways from that point forward, then multiply by 3.
Let's take the middle choice:
First, try to go immediately to the goal. We get two similar paths:
If we stopped at this point, we would get \(2 \times 3 = 6\) total paths. This is in fact the number of shortest paths to the goal. However, we can construct additional "zigzag" paths that also satisfy the constraints of the problem.
There are no more possibilities without the path touching itself, so this initial edge leads to 6 possible paths. Since there are 3 initial edges, the total number of possible paths is \(6 \times 3 = 18\).
Alternatively, we can map the corners by their "distance" away from the starting point, measured in edges:
Taking the leftmost edge to start, we can construct the 6 possible paths leading from that edge:
Again, there are \(6 \times 3 = 18\) possible paths.
Answer: C
04 Jul 2015, 00:02
Kudos
Bookmarks
Bunuel
Official Solution:
An ant is clinging to one corner of a box in the shape of a cube. The ant wants to get to the most distant corner of the box by crawling only along the edges of the cube and without ever revisiting a place it has been. How many different paths can the ant take to the most distant corner?
A. 6
B. 12
C. 18
D. 24
E. 30
First, draw a picture of the situation.
Now, look for patterns as you construct and count paths that don't retrace or touch themselves at all. One of the first patterns that is useful to spot has to do with the initial choice about which edge to crawl along. The ant can take any one of three initial paths:
These three initial choices are equivalent, because the cube is symmetric. Thus, we can just consider one of the initial paths, count up the ways from that point forward, then multiply by 3.
Let's take the middle choice:
First, try to go immediately to the goal. We get two similar paths:
If we stopped at this point, we would get \(2 \times 3 = 6\) total paths. This is in fact the number of shortest paths to the goal. However, we can construct additional "zigzag" paths that also satisfy the constraints of the problem.
There are no more possibilities without the path touching itself, so this initial edge leads to 6 possible paths. Since there are 3 initial edges, the total number of possible paths is \(6 \times 3 = 18\).
Alternatively, we can map the corners by their "distance" away from the starting point, measured in edges:
Taking the leftmost edge to start, we can construct the 6 possible paths leading from that edge:
Again, there are \(6 \times 3 = 18\) possible paths.
Answer: C
An ant is clinging to one corner of a box in the shape of a cube. The ant wants to get to the most distant corner of the box by crawling only along the edges of the cube and without ever revisiting a place it has been. How many different paths can the ant take to the most distant corner?
A. 6
B. 12
C. 18
D. 24
E. 30
First, draw a picture of the situation.
Now, look for patterns as you construct and count paths that don't retrace or touch themselves at all. One of the first patterns that is useful to spot has to do with the initial choice about which edge to crawl along. The ant can take any one of three initial paths:
These three initial choices are equivalent, because the cube is symmetric. Thus, we can just consider one of the initial paths, count up the ways from that point forward, then multiply by 3.
Let's take the middle choice:
First, try to go immediately to the goal. We get two similar paths:
If we stopped at this point, we would get \(2 \times 3 = 6\) total paths. This is in fact the number of shortest paths to the goal. However, we can construct additional "zigzag" paths that also satisfy the constraints of the problem.
There are no more possibilities without the path touching itself, so this initial edge leads to 6 possible paths. Since there are 3 initial edges, the total number of possible paths is \(6 \times 3 = 18\).
Alternatively, we can map the corners by their "distance" away from the starting point, measured in edges:
Taking the leftmost edge to start, we can construct the 6 possible paths leading from that edge:
Again, there are \(6 \times 3 = 18\) possible paths.
Answer: C
Is there an easier way to solve such questions, Bunuel? Using combinations maybe. Using diagrams might take too much time.
