Hello,
I got this question on my last MGMAT CAT that I took:
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?
A.) 5
B.) 6
C.) 15
D.) 16
E.) 18
The answer is D.
I reviewed their answer a few times and kind of understand it but I would like to know how to go about setting such a problem up, figuring out which values to use, and then solving them all in TWO MINUTES!!
Please explain how one would solve this problem thoroughly.
Thanks.
I got this question on my last MGMAT CAT that I took:
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?
A.) 5
B.) 6
C.) 15
D.) 16
E.) 18
The answer is D.
I reviewed their answer a few times and kind of understand it but I would like to know how to go about setting such a problem up, figuring out which values to use, and then solving them all in TWO MINUTES!!
Please explain how one would solve this problem thoroughly.
Thanks.

















