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.
Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:
What people who reach the high 700's do differently? We're going to share insights, tips and strategies from data we collected on over 50,000 students who used examPAL.
Re: How many rectangles can be formed such that their perimeter is less
[#permalink]
Show Tags
04 Apr 2015, 07:26
Lucky2783 wrote:
How many rectangles can be formed such that their perimeter is less than 258 ?
a) 178 b) 284 c) 1094 d) 4160 e) 4095
Author of this task say nothing about integers, but I think it is only possible variant that sides can't be decimals.
So our max perimeter should be 256 and sum of two opposite sizes should be 256 / 2 = 128
Let's take some first variant and look for pattern one side - 1 and with this side we can make 127 another variants: 1-1, 1-2, 1-3 and so on up to 1-127 one side - 2 and with this side we can make 126 another variants: 2-1, 2-2, 2-3 and so on up to 2-126. But we already have rectangular 2-1 so we should subtract this variant and we have 125 possible variants one side - 3 and we have 123 another possible variants
so now we can make a formula for calculating possible variants for side n: variants = 129 - 2n Our max size for side before repetion wil be equal 129 / 2 = 64.5. (we can use ony 64) And side 64 will be have 1 variant. 129 - 2*64 = 1
And now we should calculate sum of all this variants from 127 to 1 Formula for calcualting sum of sequence ((1 number + last number) / 2) * quantity of numbers ((127 + 1) / 2) * 64 = 4096
And we don't have such answer in our variants, so it'll be really interesting to know where I have made mistake.
_________________
Re: How many rectangles can be formed such that their perimeter is less
[#permalink]
Show Tags
04 Apr 2015, 09:15
Lucky2783 wrote:
How many rectangles can be formed such that their perimeter is less than 258 ?
a) 178 b) 284 c) 1094 d) 4160 e) 4095
hi Harley1980 and Lucky2783, i too think answer is 4096.. although it is necessary that the question mentions that the sides are integers to get a finite numbers, otherwise the answer can be infinite with a pair of sides .1 or .001, etc
now if we consider that sides are integer, lets look at the solution.. perimeter has to be an even number so largest perimeter is 256 the possible perimeters are 4,6,8,...256.. if perimeter is 4.. sides are 1 and 1.. possibility 1 if perimeter is 6.. sides are 2 and 1..possibility 1 if perimeter is 8.. sides are 2 and 2 or 1 and 3..possibilities 2 and so on.. it follows a pattern.. each succeeding pair has one extra possiblity.. so total=1+1+2+2+3+3+.....63+63+64=2(1+2+3+...+63)+64=2*64*63/2+64=64*63+64=64*64=4096...
if the perimeter is equal to less than 258 then 258 will also add up and it will have 64 posssiblities and the answer than will be 4160 D
_________________
Re: How many rectangles can be formed such that their perimeter is less
[#permalink]
Show Tags
04 Apr 2015, 09:34
chetan2u wrote:
Lucky2783 wrote:
How many rectangles can be formed such that their perimeter is less than 258 ?
a) 178 b) 284 c) 1094 d) 4160 e) 4095
hi Harley1980 and Lucky2783, i too think answer is 4096.. although it is necessary that the question mentions that the sides are integers to get a finite numbers, otherwise the answer can be infinite with a pair of sides .1 or .001, etc
now if we consider that sides are integer, lets look at the solution.. perimeter has to be an even number so largest perimeter is 256 the possible perimeters are 4,6,8,...256.. if perimeter is 4.. sides are 1 and 1.. possibility 1 if perimeter is 6.. sides are 2 and 1..possibility 1 if perimeter is 8.. sides are 2 and 2 or 1 and 3..possibilities 2 and so on.. it follows a pattern.. each succeeding pair has one extra possiblity.. so total=1+1+2+2+3+3+.....63+63+64=2(1+2+3+...+63)+64=2*64*63/2+64=64*63+64=64*64=4096...
if the perimeter is equal to less than 258 then 258 will also add up and it will have 64 posssiblities and the answer than will be 4160 D
apologies for the confusion , i have not properly worded the question . edited the question with correct answer options and question stem .
_________________
Thanks, Lucky
_______________________________________________________ Kindly press the to appreciate my post !!
Re: How many rectangles can be formed such that their perimeter is less
[#permalink]
Show Tags
04 Apr 2015, 12:28
1
Lucky2783 wrote:
chetan2u wrote:
Lucky2783 wrote:
How many rectangles can be formed such that their perimeter is less than 258 ?
a) 178 b) 284 c) 1094 d) 4160 e) 4095
hi Harley1980 and Lucky2783, i too think answer is 4096.. although it is necessary that the question mentions that the sides are integers to get a finite numbers, otherwise the answer can be infinite with a pair of sides .1 or .001, etc
now if we consider that sides are integer, lets look at the solution.. perimeter has to be an even number so largest perimeter is 256 the possible perimeters are 4,6,8,...256.. if perimeter is 4.. sides are 1 and 1.. possibility 1 if perimeter is 6.. sides are 2 and 1..possibility 1 if perimeter is 8.. sides are 2 and 2 or 1 and 3..possibilities 2 and so on.. it follows a pattern.. each succeeding pair has one extra possiblity.. so total=1+1+2+2+3+3+.....63+63+64=2(1+2+3+...+63)+64=2*64*63/2+64=64*63+64=64*64=4096...
if the perimeter is equal to less than 258 then 258 will also add up and it will have 64 posssiblities and the answer than will be 4160 D
apologies for the confusion , i have not properly worded the question . edited the question with correct answer options and question stem .
It's ok, but correct answer is 4096, so your question still have wrong answer.
_________________
How many rectangles can be formed such that their perimeter is less
[#permalink]
Show Tags
04 Apr 2015, 16:42
1
Harley1980 wrote:
It's ok, but correct answer is 4096, so your question still have wrong answer.
nopes the answer is correct as i mentioned in the spoiler, the question stem was not correct .
2(l+w) <=258 (l+w) <=129 first case l+w=129 128,1 127,2 126,3 .. .. 65,64 64 such pairs Second case l+w=128 127,1 126,2 125,3 .. .. 65,63 64,64 64 such pairs
for (l+w)=127 and 126 we will get 63 such pairs for each . finally for (l+w)=3 and 2 we will get only 1 pair.
so SUM = \(\frac{(1+64)}{2} * 2*64\) = 64*65 = Answer D
_________________
Thanks, Lucky
_______________________________________________________ Kindly press the to appreciate my post !!
How many rectangles can be formed such that their perimeter is less
[#permalink]
Show Tags
04 Apr 2015, 17:59
Lucky2783 wrote:
Harley1980 wrote:
It's ok, but correct answer is 4096, so your question still have wrong answer.
nopes the answer is correct as i mentioned in the spoiler, the question stem was not correct .
2(l+w) <=258 (l+w) <=129 first case l+w=129 128,1 127,2 126,3 .. .. 65,64 64 such pairs Second case l+w=128 127,1 126,2 125,3 .. .. 65,63 64,64 64 such pairs
for (l+w)=127 and 126 we will get 63 such pairs for each . finally for (l+w)=3 and 2 we will get only 1 pair.
so SUM = \(\frac{(1+64)}{2} * 2*64\) = 64*65 = Answer D
hi , how can the answer be correct if the question itself is wrong?
if the question says not more than 258 , then 64 is added to 4096 and answer becomes 4160 D...
_________________
Re: How many unique rectangles are possible that have a perimeter of not m
[#permalink]
Show Tags
12 Apr 2015, 21:46
1
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 ???
Re: How many unique rectangles are possible that have a perimeter of not m
[#permalink]
Show Tags
15 Sep 2017, 09:29
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 ???
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 will interchange which are repeated solutions. We will have to have those cases. But, there will be scenarios where interchanging the values of length and breadth won't affect as in when they are equal (talking about squares ). How many squares will be formed. Since, they will be equal, their sum will be even. So, we have a total of 64 such square cases.
Total repeated rectangles formed = [C(127+2, 2) + 64]/2 = 4160.
The Variable : I change but remain constant _________________
Problems in life have easy solutions. Its YOU who make them difficult!
Re: How many unique rectangles are possible that have a perimeter of not m
[#permalink]
Show Tags
15 Sep 2017, 09:30
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 ???
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 will interchange which are repeated solutions. We will have to have those cases. But, there will be scenarios where interchanging the values of length and breadth won't affect as in when they are equal (talking about squares ). How many squares will be formed. Since, they will be equal, their sum will be even. So, we have a total of 64 such square cases.
Total repeated rectangles formed = [C(127+2, 2) + 64]/2 = 4160.
The Variable : I change but remain constant
Edit: Read: We will have to remove such cases.
The Variable : I change but remain constant _________________
Problems in life have easy solutions. Its YOU who make them difficult!
Re: How many unique rectangles are possible that have a perimeter of not m
[#permalink]
Show Tags
03 Nov 2018, 03:10
Hello from the GMAT Club BumpBot!
Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).
Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
close
35% (02:01) correct 
to appreciate my post !! 
). How many squares will be formed. Since, they will be equal, their sum will be even. So, we have a total of 64 such square cases.
