GRE Prep 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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
A ribbon 40-inches long is to be cut into three pieces, each of whose
[#permalink]
15 Feb 2023, 11:02
15 Feb 2023, 11:02
Expert Reply
1
Bookmarks
00:00
Question Stats:
38% (01:44) correct
61% (01:25) wrong based on 26 sessions
Hide Show timer Statistics
A ribbon 40-inches long is to be cut into three pieces, each of whose lengths is a different integer number of inches.
A) Quantity A is greater.
B) Quantity B is greater.
C) The two quantities are equal.
D) The relationship cannot be determined from the information given.
Quantity A |
Quantity B |
The least possible length, in inches, of the longest piece |
15 |
A) Quantity A is greater.
B) Quantity B is greater.
C) The two quantities are equal.
D) The relationship cannot be determined from the information given.
Re: A ribbon 40-inches long is to be cut into three pieces, each of whose
[#permalink]
17 Feb 2023, 01:42
17 Feb 2023, 01:42
2
In order to minimize "longest piece" we will maximize the shortest pieces. To maximize the shortest pieces - divide ribbon into 3 parts first - 40/3 = 13.33. As it has to be a whole number - the ribbon can be divided into three pieces of 13, 13, and 14 inches respectively. However, the question mentions that every piece has to be "a different integer number". Therefore, the longest piece has to be 15 with other pieces as 12 and 13. It cannot be minimized further as it has to add up to 40.
The correct answer is (C).
The correct answer is (C).
Re: A ribbon 40-inches long is to be cut into three pieces, each of whose
[#permalink]
01 Mar 2023, 20:26
01 Mar 2023, 20:26
cournotdoesgre wrote:
In order to minimize "longest piece" we will maximize the shortest pieces. To maximize the shortest pieces - divide ribbon into 3 parts first - 40/3 = 13.33. As it has to be a whole number - the ribbon can be divided into three pieces of 13, 13, and 14 inches respectively. However, the question mentions that every piece has to be "a different integer number". Therefore, the longest piece has to be 15 with other pieces as 12 and 13. It cannot be minimized further as it has to add up to 40.
The correct answer is (C).
The correct answer is (C).
How?
Why can't the least possible length of the longest piece be 37? in that case one of the smallest pieces would be 2 and the other would be 1.
