• EMPOWERgmat Slider
    1 Hour Free
    BEAT THE GMAT EXCLUSIVE

    Available with Beat the GMAT members only code

    MORE DETAILS
    EMPOWERgmat Slider
  • e-gmat Exclusive Offer
    Get 300+ Practice Questions
    25 Video lessons and 6 Webinars for FREE

    Available with Beat the GMAT members only code

    MORE DETAILS
    e-gmat Exclusive Offer
  • Magoosh
    Magoosh
    Study with Magoosh GMAT prep

    Available with Beat the GMAT members only code

    MORE DETAILS
    Magoosh
  • Kaplan Test Prep
    Free Practice Test & Review
    How would you score if you took the GMAT

    Available with Beat the GMAT members only code

    MORE DETAILS
    Kaplan Test Prep
  • Target Test Prep
    5-Day Free Trial
    5-day free, full-access trial TTP Quant

    Available with Beat the GMAT members only code

    MORE DETAILS
    Target Test Prep
  • Varsity Tutors
    Award-winning private GMAT tutoring
    Register now and save up to $200

    Available with Beat the GMAT members only code

    MORE DETAILS
    Varsity Tutors
  • Economist Test Prep
    Free Trial & Practice Exam
    BEAT THE GMAT EXCLUSIVE

    Available with Beat the GMAT members only code

    MORE DETAILS
    Economist Test Prep
  • Veritas Prep
    Free Veritas GMAT Class
    Experience Lesson 1 Live Free

    Available with Beat the GMAT members only code

    MORE DETAILS
    Veritas Prep
  • PrepScholar GMAT
    5 Day FREE Trial
    Study Smarter, Not Harder

    Available with Beat the GMAT members only code

    MORE DETAILS
    PrepScholar GMAT

Mouse pellets

This topic has 4 expert replies and 2 member replies
EricKryk Senior | Next Rank: 100 Posts Default Avatar
Joined
31 Mar 2009
Posted:
83 messages
Thanked:
3 times

Mouse pellets

Post Thu Feb 20, 2014 8:32 am
Elapsed Time: 00:00
  • Lap #[LAPCOUNT] ([LAPTIME])

    The diagram above shows the various paths along which a mouse can travel from point X, where it is released, to point Y, where it is rewarded with a food pellet. How many different paths from X to Y can the mouse take if it goes directly from X to Y without retracing any point along a path?

    A) 6
    B) 7
    C) 12
    D) 14
    E) 17

    Need free GMAT or MBA advice from an expert? Register for Beat The GMAT now and post your question in these forums!

    GMAT/MBA Expert

    Post Thu Feb 20, 2014 9:00 am
    Moving from X to Y is equivalent to going through a series of decision points. Every time we have two options, the number of paths will double. Every time we have three options, the number of paths will triple...

    The full solution below is taken from the GMATFix App.



    -Patrick

    _________________


      Ask me about tutoring.

    Post Thu Feb 20, 2014 9:15 am
    EricKryk wrote:

    The diagram above shows the various paths along which a mouse can travel from point X, where it is released, to point Y, where it is rewarded with a food pellet. How many different paths from X to Y can the mouse take if it goes directly from X to Y without retracing any point along a path?

    A) 6
    B) 7
    C) 12
    D) 14
    E) 17


    First recognize that, in order to get from point X to point Y, we MUST travel through points A,B,C,D,E and F.

    So, we can take the task of getting from point X to Y and break it into stages.

    Stage 1: Move from point X to point A
    There's only 1 possible route, so we can complete stage 1 in 1 way.

    Stage 2: Move from point A to point B
    There are 2 possible routes, so we can complete stage 2 in 2 ways.

    Stage 3: Move from point B to point C
    There's only 1 possible route, so we can complete stage 3 in 1 way.

    Stage 4: Move from point C to point D
    There are 2 possible routes, so we can complete stage 4 in 2 ways.

    Stage 5: Move from point D to point E
    There's only 1 possible route, so we can complete stage 5 in 1 way.

    Stage 6: Move from point E to point F
    There are 3 possible routes, so we can complete stage 6 in 3 ways.

    Stage 7: Move from point F to point Y
    There's only 1 possible route, so we can complete stage 7 in 1 way.

    By the Fundamental Counting Principle (FCP), we can complete all 7 stages (and thus move from point X to point Y) in (1)(2)(1)(2)(1)(3)(1) ways (= 12 ways)

    Answer: C

    Cheers,
    Brent

    Aside: For more information about the FCP, watch our free video: http://www.gmatprepnow.com/module/gmat-counting?id=775

    _________________
    Brent Hanneson – Founder of GMATPrepNow.com
    Use our video course along with Beat The GMAT's free 60-Day Study Guide

    Check out the online reviews of our course
    Come see all of our free resources

    GMAT Prep Now's comprehensive video course can be used in conjunction with Beat The GMAT’s FREE 60-Day Study Guide and reach your target score in 2 months!
    Post Thu Feb 20, 2014 12:33 pm
    EricKryk wrote:

    The diagram above shows the various paths along which a mouse can travel from point X, where it is released, to point Y, where it is rewarded with a food pellet. How many different paths from X to Y can the mouse take if it goes directly from X to Y without retracing any point along a path?

    A) 6
    B) 7
    C) 12
    D) 14
    E) 17
    Number of ways to travel across the leftmost diamond = 2. (Either of the 2 paths.)
    Number of ways to travel across the middle diamond = 2. (Either of the 2 paths.)
    Number of ways to travel across the rightmost diamond = 3. (Any of the 3 paths.)
    To combine these options, we multiply:
    2*2*3 = 12.

    The correct answer is C.

    _________________
    Mitch Hunt
    GMAT Private Tutor
    GMATGuruNY@gmail.com
    If you find one of my posts helpful, please take a moment to click on the "Thank" icon.
    Available for tutoring in NYC and long-distance.
    For more information, please email me at GMATGuruNY@gmail.com.

    Thanked by: stephanieh
    Free GMAT Practice Test How can you improve your test score if you don't know your baseline score? Take a free online practice exam. Get started on achieving your dream score today! Sign up now.
    Post Mon Jun 29, 2015 6:59 am
    EricKryk wrote:

    The diagram above shows the various paths along which a mouse can travel from point X, where it is released, to point Y, where it is rewarded with a food pellet. How many different paths from X to Y can the mouse take if it goes directly from X to Y without retracing any point along a path?

    A) 6
    B) 7
    C) 12
    D) 14
    E) 17
    Solution:



    A good way to solve this problem is to use the idea of the fundamental counting principle. In a more standard form you could be asked a question, such as if Tom as 3 belts, 4 ties, and 6 shirts, how many outfits could he make with those items? We can consider each item a decision point, i.e., belts, ties, and shirts. To solve this, we just need to multiply the number of decisions Tom can make together, so:

    3 x 4 x 6 = 72 ways.

    Tom has 72 options when dressing with those items.

    The same logic can be applied to this problem. We first determine the number of ways the mouse can go from one point to the next. Notice we added in “decision points” to our diagram.

    X to P1 = 1

    P1 to P2 = 2

    P2 to P3= 1

    P3 to P4= 2

    P4 to P5= 1

    P5 to P6 = 3

    P6 to Y = 1

    Therefore, to determine the total number of ways from X to Y, we multiply all these numbers together:

    1 x 2 x 1 x 2 x 1 x 3 x 1 = 12 ways.

    There are 12 different paths.

    Answer:C

    _________________
    Jeffrey Miller Head of GMAT Instruction

    stephanieh Newbie | Next Rank: 10 Posts Default Avatar
    Joined
    30 May 2015
    Posted:
    7 messages
    Thanked:
    1 times
    Post Mon Jun 29, 2015 9:58 pm
    GMATGuruNY wrote:
    EricKryk wrote:

    The diagram above shows the various paths along which a mouse can travel from point X, where it is released, to point Y, where it is rewarded with a food pellet. How many different paths from X to Y can the mouse take if it goes directly from X to Y without retracing any point along a path?

    A) 6
    B) 7
    C) 12
    D) 14
    E) 17
    Number of ways to travel across the leftmost diamond = 2. (Either of the 2 paths.)
    Number of ways to travel across the middle diamond = 2. (Either of the 2 paths.)
    Number of ways to travel across the rightmost diamond = 3. (Any of the 3 paths.)
    To combine these options, we multiply:
    2*2*3 = 12.

    The correct answer is C.
    Awesome break down Mitch! Thank you. I don't know how you're able to make it so simple! Do you have a thought process system as you're taking in the question?

    nikhilgmat31 Legendary Member Default Avatar
    Joined
    12 May 2015
    Posted:
    518 messages
    Thanked:
    10 times
    Test Date:
    3 Oct
    Target GMAT Score:
    750
    Post Thu Jul 02, 2015 10:50 pm
    please attached the image.

    Best Conversation Starters

    1 Vincen 152 topics
    2 lheiannie07 61 topics
    3 Roland2rule 49 topics
    4 ardz24 40 topics
    5 LUANDATO 32 topics
    See More Top Beat The GMAT Members...

    Most Active Experts

    1 image description Brent@GMATPrepNow

    GMAT Prep Now Teacher

    141 posts
    2 image description EconomistGMATTutor

    The Economist GMAT Tutor

    107 posts
    3 image description GMATGuruNY

    The Princeton Review Teacher

    106 posts
    4 image description Rich.C@EMPOWERgma...

    EMPOWERgmat

    104 posts
    5 image description Matt@VeritasPrep

    Veritas Prep

    76 posts
    See More Top Beat The GMAT Experts