At a restaurant, a group of friends ordered four main dishes

Yeap! they are good.

Visit, for more info, https://www.manhattangmat.com/gmat-prep-programs.cfm
And
for more feedback, manhattan-gmat-class-discount-everything-about-mgmat-84213.html

All the best!

From the F.S 1, we know that the price of the most expensive side dish is 16. Let me assume that the price of the costliest side dish(call it r) is 15. Is this possible? No as because every main dish cost more than every side dish. Thus, if I were to have a side dish costing 15, this will contradict the given statement. Now lets assume that the side dish costs 14. Again, not possible. Thus, the costliest side dish can have a value only below 13. Now, we know that 16+15+14+13 = 58. Thus, the sum of the remaining three dishes is 89-58 = 31. Now, again, the price of the cheapest and the second cheapest side dishes be x and y respectively.Ans we know that x,y and r are different integers.Also, 31-(x+y) = r has to be less than 13. Thus, 31-(x+y)<13 or (x+y)>18.

For r = 31-(x+y),put all values for (x+y) more than 18.

For x+y = 19, r = 12.

As you keep on increasing the value for (x+y), the value of r will decrease. Thus, the value of r = 12. Also, for any other value of (x+y), the highest value will always come out to be 12. Sufficient.

From F.S 2, we have that x = 9. We can have y=10, r = 11. The price of the main dishes can be 17,15,14,13 to give a total of 89 dollars.Again, for y=8, r= 12, we have the price of the other dishes to be 18,15,14,13. Not Sufficient as the value of r is not fixed.


A.

each dish was a different integer.
each main dish cost more than any side dish

St1: Most expensive main dish = 16
lets say other 3 main dish cost 15, 14 and 13
that leaves 31 to be divided between 3 side dishes.
maximum price of a side dish can be 12 as 13 is the least expensive main dish
so side dishes could be priced 12, 11 and 8

Consider another scenario:
lets say most exp MD costs 16 and three other MD costs 14,12 and 10
that leaves 37 for 3 SD. This cannot be the case since all side dished must cost less than 10 (minimum cost of any main dish)

and 1 more scenario:
so its established that the 4 MD cost 16, 15, 14 and 13 leaving 31 for three SD.
lets say most exp side dish SD3 cost 11 that leaves 20 for SD1 and SD2
To get 20, one price must be greater than 10 and it cant be 11 (since no 2 dish cost the same) and in that case it could be 12 and 8 or 13 and 7 BUT then 11 wont be the most expensive.

So the only option left for the most expensive side dish = 12.
Sufficient.
Ans A

I understood that most problems are built using some core concepts. This one might be based on sum of consecutive integers

If we look at 91 = 13 * 7 and problem talks about 7 numbers and if we are able to connect the consecutive integers with this formula (I know lots of ifs)

Then 13 * 7 = (a1+an)/2 * n (number of terms in the sequence of consecutive integers where a1 is the first term and an is the last term)

Now if we take statement one and plug in 16 for an , this gives a1= 10; So if any answer would bound either the first term in the series or the last term in the series (10 or 16), then the second extreme and hence all numbers get fixed.

Hence D as both 1 and 2 bind the upper and lower extremes of the consecutive integers sequence

This was the only way I could think of to complete this in less than 2 minutes

This problem is best solved by simply listing values and doing the math. So if we start with statement (1), then we can work our way backward:

$16 $15 $14 $13 $12 $11 $10

We know that the sum of these prices is $91. We can't increase the maximum price of the most expensive side dish ($12) because we would start a ripple effect that would make the most expensive dish more expensive than the given information. We can't reduce the price of the most expensive side dish because then the total would not add up to $91. We can't make the second most-expensive side dish compensate by increasing its price by 1 and decreasing the most expensive side dish's price by 1, because then the second-most would become the most-expensive side dish. Only one possible value exists.

For statement (2), we can use a similar approach. If we start at $10 and work our way upwards, then we notice that there is only one possible value for the most expensive side dish. If we increase the price of the most expensive side dish, then we cannot reduce the prices elsewhere to make up for it. There is no "wiggle room." If we increase the price of every other dish by 1 (or even if we increase the price of 1 dish by 1), then the total would be greater than $91. Sufficient.

Bunuel Can you suggest a better approach to this question?

Most expensive side dish = ???

Clues from the question stem:
1) 4 main dishes and 3 side dishes
2) Total cost of $89
3) The prices of the seven items, in dollars, were all different integers
4) Every main dish costs more than every side dish


(1) The most expensive main dish cost $16.
We know the total cost of the bill is $89 and each Main dish is more expensive than every side dish

MD 1 = 16 ( from 1)
MD 2 = 15 (cost of all dishes are different)
MD 3 = 14
MD 4 = 13
Total = 58


SD1=12 Every main dish costs more than every side dish. Side Dish Amount has to be less than 13 because
SD2 = 10
SD3 = 9
Total = 31

MD + Sd = 89 Sufficient

(2) The least expensive side dish cost $9.

There is no upper limit
Sd may cost, 9, 10 , 11 or 9 11 12

Two possibilities, Not sufficient

AjiteshArun VeritasKarishma

Why is option B not sufficient??

My reasoning:-

Least expensive dish is 9$ and all the dish amount are different integer values. We have to find highest value of side dish . So we have to minimize all other dish price.

Side dish price after minimization: 9,10,x (Least expensive dish is 9$ given as per St2 and X is most expensive price of side dish)
Main dish price after minimization:-X+1,X+2,X+3,X+4

So 9+10+X+X+1+X+2+X+3+X+4=89
5X+29=89
5X=60
X=12

Therefore,X=12 is the most expensive price of the side dish .

Where am I going wrong??

I hope i can clear your doubt for you.

When you assume price of each dish to be (X),(X+1),(X+2),(X+3),(X+4) , you assume price of each dish to be consecutive integers.

But the question stem says different integers.
Which is why the following two possibilities are allowed

Possibility 1 => 9+10+12+13+14+15+16=89

Possibility 2 => 9+10+11+13+14+15+17=89

chetan2u VeritasKarishma AjiteshArun

Please help.

Hi,

You are going wrong by taking this as the ONLY possibility.
We just know that the least is 9. Nothing more

If all were equal, then the median would be 89/7 or between 12 and 13. The three side dishes will be just less than the median, so the most expensive side dish will be surely less than 13..
The least is 9, so most expensive dish cannot be 9 or 10.. Possible values 11 or 12

Check for 11..
so the side dishes are 9, 10, 11... 9+10+11=30.....main dishes can be 12, 13, 14, and (89-30-12-13-14=20) OR 12, 13, 15, 19 and so on
check for 12..
so the side dishes are 9, 10, 12... 9+10+12=31.....main dishes can be 13, 14, 15 and (89-31-15-13-14=16) ..

So both 11 and 12 are possible. Hence not sufficient.

The question does not ask for the maximum possible value of the most expensive side dish. It asks for the actual cost of the most expensive side dish.
So only if $89 can be distributed under the given constraints in only such ways that the most expensive side dish can have only one value, then the statement would be sufficient.

If the least expensive side dish costs $9, the cost of most expensive side dish can take multiple values:

9, 10, 11, 12, 13, 14, 20 (total = $89)
9, 10, 12, 13, 14, 15, 16 (total = $89)

So the most expensive side dish cost is not known uniquely using stmnt 2 alone.

[quote="thebigr002"]At a restaurant, a group of friends ordered four main dishes and three side dishes at a total cost of $89. The prices of the seven items, in dollars, were all different integers, and every main dish cost more than every side dish. What was the price, in dollars, of the most expensive side dish?

(1) The most expensive main dish cost $16.

(2) The least expensive side dish cost $9.


There are seven different dishes (4 main dishes and 3 side dishes), each with a different integer cost; we cannot use just two variables to represent the two types of dishes. Each of the four main dishes is more expensive than any of the side dishes. The seven dishes add up to $91. The question asks for the price of the most expensive side dish. This is a statistics question, so it will be useful to consider different cases.

(1) SUFFICIENT: Since this problem involves 7 different integers, some of which must be larger than others, it's a good idea to test extreme possibilities. We're told that the most expensive main dish is $16 so try maximizing the cost of the other three: $15, $14, and $13. In this case, the total cost of the four main dishes is $58, leaving $33 to split among the three side dishes. The prices of the three side dishes must be different integers and all must cost less than $13. Again, try maximum values first: $12, $11 and $10 are the largest possible prices for the three side dishes and these indeed sum to $33. However, note that this maximized case is the only case that will work – otherwise the 3 side dishes will not sum to $33 (and the total will not sum to $91). If we back up and try something other than the maximum values for the four main dishes, the main dishes will then sum to less than $58 and the lowest price of these main dishes will be something less than $13. This will mean we'll need the sum of the three side dishes to be greater than $33, and we'll have to achieve that with numbers smaller than 12, 11, and 10. That's impossible! Thus, $12 is the price of the most expensive side dish.

Conceptually, we could have started with the average of these 7 dishes that sum to $91, that is $91/7 or $13. With the greatest statistic at $16 (only $3 above the mean), we might have understood that the other 6 prices can’t be that far away from the mean (the mean is the balancing point for all of the statistics in the set). The set of consecutive integers from $16 to $10 would have been the first to try. After that worked (13 is the mean of these 7 integers and 7 x 13 = 91), we could have proved that all other cases would decrease the sum to less than $91.

(2) SUFFICIENT: Since this problem involves 7 different integers, some of which must be larger than others, it's a good idea to test extreme possibilities. We're told that the least expensive side dish costs $10, so this time try minimizing the cost of the other two: $11, and $12. The side dishes would then cost a total of $33, leaving $58 for the main dishes. Since the minimum values for each of the four side dishes, i.e. $13, $14, $15, and $16 already sum to $58 there is no way to choose any larger values for these prices, which also means that we also couldn’t have chosen any larger values for the price of the side dishes. Thus, $12 is the price of the most expensive side dish.

Conceptually, we could have started with the average of the 7 dishes that sum to $91, that is $91/7 or $13. With the smallest statistic at $10 (only $3 below the mean), we might have understood that the other 6 prices can’t be that far away from the mean (the mean is the balancing point for all of the statistics in the set). The set of consecutive integers from $16 to $10 would have been the first to try. After that worked (13 is the mean of these 7 integers and 7 x 13 = 91), we could have proved that all other cases would increase the sum to greater than $91.

Note that this is a C-trap. Knowing that the greatest and smallest values of the set of 7 different integers were only 6 apart would imply that they must be consecutive integers. However, it was possible to get the answer with each statement alone.

Please find the compiled .docx note enclosed.