Compilation of some tough problems

[securitygeek]

Folks,
I have collected several difficult problems that appeared on this forum in the past few months. They are all in a doc file. I hope they will help you all.
I am attaching them in this post.

[TwinnSplitter]

you're the man

[Cute]

Security geek,

Thanks a lot. You are the real GMATTTTTTERRRRR. Appreciate your efforts and above all appreciate your mentality to share with solutions. Thanks a lot.

[Anandha]

SecurityGeek,

You rule!!!!!

[securitygeek]

Thanks guys! I take GMAT on saturday. I think I should be okay if I get 600ish to get into the program I am looking at. If I get the score I want in my first attempt and get into this program I am looking at (I will know in 2-3 weeks after my exam), I have promised myself that I will donate all my GMAT prep material to all you fellow testmagicians. Please keep your fingers crossed for me.


Thank you!

[TwinnSplitter]

good luck, you'll do great! Looking forward to seeing the good news in the "Just Finished my GMAT" section!

[greycellz]

Awesome!!

[MAT]

just great!

[seenapanalli]

Here is a couple of more problems.

[rv_blitz]

Security Geek,
This is a great compilation.

An alternative way 2 solve this problem.

31. If Bob and Jen are two of 5 participants in a race, how many different ways can the race finish where Jen always finishes in front of Bob?



answer : Total number of ways of arranging 5 participants = 5! = 120.
In, half of these arrangements Jen will finish ahead od Bob .
So, no of arrangements = 120/2 = 60