Quantcast
Channel: GMAT Club Forum - Forums > Reading Comprehension (RC)
Viewing all articles
Browse latest Browse all 291973

Problem Solving (PS) | Re: How many unique rectangles are possible that have a perimeter of not m

$
0
0
The.Variable wrote:

anshul2014 wrote:
quite a few good explanations above there but can someone enlighten me how can we solve this question in less than 2 min?? any recomended short-cuts for this one ???

I know, it's too late now but still here you go.

2(length + breadth) ≤ 258
(length + breadth) ≤ 129

Now, neither of them can be zero. So, let's give them 1 each from 129. It reduces to

(length + breadth) ≤ 127

This is a distribution question now. We will have many scenarios where length and breadth values
...

Viewing all articles
Browse latest Browse all 291973

Latest Images

Trending Articles



Latest Images

<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>