Quant Collection - 1

MGMAT 1_03

Question 12 of 37

Miguel is mixing up a salad dressing. Regardless of the number of servings, the recipe
requires that 5/8 of the finished dressing mix be olive oil, 1/4 vinegar, and the remainder
an even mixture of salt, pepper and sugar. If Miguel accidentally doubles the vinegar and
forgets the sugar altogether, what proportion of the botched dressing will be olive oil?

15/29
5/8
5/16
1/2
13/27
 Quant Collection - 2

MGMAT 1_03

Question 12 of 37

Miguel is mixing up a salad dressing. Regardless of the number of servings, the recipe
requires that 5/8 of the finished dressing mix be olive oil, 1/4 vinegar, and the remainder
an even mixture of salt, pepper and sugar. If Miguel accidentally doubles the vinegar and
forgets the sugar altogether, what proportion of the botched dressing will be olive oil?

15/29
5/8
5/16
1/2
13/27
 Quant Collection - 3

MGMAT 03_1 Question 10 of 37

Kali builds a tower using only red, green, and blue toy bricks in a ratio of 4:3:1. She then

removes of the green bricks and adds more blue bricks, reducing the size of the
tower by 14 bricks. How many red bricks will she need to add in order to double the total
number of bricks used to build the original tower?

82
96
110
120
192
 Quant Collection - 4

MGMAT 03_1 Question 10 of 37

Kali builds a tower using only red, green, and blue toy bricks in a ratio of 4:3:1. She then

removes of the green bricks and adds more blue bricks, reducing the size of the
tower by 14 bricks. How many red bricks will she need to add in order to double the total
number of bricks used to build the original tower?

82
96
110
120
192

Spent 7:10 on this and got it wrong !! (700-800)

 Quant Collection - 5

MGMAT 03_1

Question 30 of 37

For any integer k > 1, the term length of an integer refers to the number of positive
prime factors, not necessarily distinct, whose product is equal to k. For example, if k =
24, the length of k is equal to 4, since 24 = 2 2 2 3. If x and y are positive integers
such that x > 1, y > 1, and x + 3y < 1000, what is the maximum possible sum of the
length of x and the length of y?

5
6
15
16
18
 Quant Collection - 6

MGMAT 03_1

Question 30 of 37

For any integer k > 1, the term length of an integer refers to the number of positive
prime factors, not necessarily distinct, whose product is equal to k. For example, if k =
24, the length of k is equal to 4, since 24 = 2 2 2 3. If x and y are positive integers
such that x > 1, y > 1, and x + 3y < 1000, what is the maximum possible sum of the
length of x and the length of y?

5
6
15
16
18
 Quant Collection - 7

The problem asks us to find the greatest possible value of (length of x + length of y), such that x and y are
integers and x + 3y < 1,000 (note that x and y are the numbers themselves, not the lengths of the numbers -
lengths are always indicated as "length of x" or "length of y," respectively).

Consider the extreme scenarios to determine our possible values for integers x and y based upon our constraint
x + 3y < 1,000 and the fact that both x and y have to be greater than 1. If y = 2, then x 993. If x = 2, then y
332. Of course, x and y could also be somewhere between these extremes.

Since we want the maximum possible sum of the lengths, we want to maximize the length of our x value, since
this variable can have the largest possible value (up to 993). The greatest number of factors is calculated by
using the smallest prime number, 2, as a factor as many times as possible. 29 = 512 and 210 = 1,024, so our
largest possible length for x is 9.

If x itself is equal to 512, that leaves 487 as the highest possible value for 3y (since x + 3y < 1,000). The largest
possible value for integer y, therefore, is 162 (since 487 / 3 = 162 remainder 1). If y < 162, then we again use the
smallest prime number, 2, as a factor as many times as possible for a number less than 162. Since 27 = 128 and
28 = 256, our largest possible length for y is 7.

If our largest possible length for x is 9 and our largest possible length for y is 7, our largest sum of the two lengths
is 9 + 7 = 16.

What if we try to maximize the length of the y value rather than that of the x value? Our maximum y value is 332,
and the greatest number of prime factors of a number smaller than 332 is 28 = 256, giving us a length of 8 for y.
That leaves us a maximum possible value of 231 for x (since x + 3y < 1,000). The greatest number of prime
factors of a number smaller than 231 is 27 = 128, giving us a length of 7 for x. The sum of these lengths is 7 + 8
= 15, which is smaller than the sum of 16 that we obtained when we maximized the x value. Thus 16, not 15, is
the maximum value of (length of x + length of y).

The correct answer is D.

Quant Collection - 8
Quant Collection - 9