Last visit was: 22 Apr 2026, 23:34 It is currently 22 Apr 2026, 23:34
Close
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

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
anonymousegmat
Joined: 14 Jun 2007
Last visit: 14 Mar 2009
Posts: 300
Own Kudos:
Posts: 300
Kudos: 29
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
AugiTh
Joined: 23 Apr 2007
Last visit: 18 Aug 2010
Posts: 86
Own Kudos:
Posts: 86
Kudos: 500
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
KillerSquirrel
Joined: 08 Jun 2005
Last visit: 28 Mar 2009
Posts: 520
Own Kudos:
Posts: 520
Kudos: 647
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
ian7777
Joined: 09 Mar 2003
Last visit: 24 Jan 2010
Posts: 227
Own Kudos:
Posts: 227
Kudos: 178
Kudos
Add Kudos
Bookmarks
Bookmark this Post
For the first one, once you see the patter, you see that there are five boxes in the top row, then 4, then 3, etc. You should learn how to add consecutive numbers quickly:

It's always the middle number times the number of numbers.

So that's 3 (the middle) times 5 (the number of numbers), which is 15.
User avatar
anonymousegmat
Joined: 14 Jun 2007
Last visit: 14 Mar 2009
Posts: 300
Own Kudos:
Posts: 300
Kudos: 29
Kudos
Add Kudos
Bookmarks
Bookmark this Post
AugiTh
pp9.jpg....

I think 25 is wrong....just count all the squares above or below the diagonal squares. The ans is 15.

For the second question, i think there is no other way other than trying all the combinations. It would help to uniquely identify every junction uniquely (numbers or alphabets) so as to avoid a retrace!


you said the magic word... combinations... :o)

is there a way to solve this using nCk or permutations? you will always have to walk up 3 streets and over 2....

i just don't think the GMAT wants us to trace a grid, they are testing us on something here
User avatar
grad_mba
Joined: 13 Mar 2007
Last visit: 24 May 2011
Posts: 349
Own Kudos:
Schools:MIT Sloan
Posts: 349
Kudos: 580
Kudos
Add Kudos
Bookmarks
Bookmark this Post
first one - 6C2 = 15 :)
User avatar
AugiTh
Joined: 23 Apr 2007
Last visit: 18 Aug 2010
Posts: 86
Own Kudos:
Posts: 86
Kudos: 500
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Ah nice one grad_mba....this problem (the first one) is analogous to the handshake problem!
User avatar
AugiTh
Joined: 23 Apr 2007
Last visit: 18 Aug 2010
Posts: 86
Own Kudos:
Posts: 86
Kudos: 500
Kudos
Add Kudos
Bookmarks
Bookmark this Post
for the second one I guess combinations could be a way out
Hmmmm....food for thought!



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Problem Solving (PS) Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
Moderator:
Math Expert
109763 posts