Workbook Wednesdays: Consecutive Divisibility

Welcome to the another installment of Workbook Wednesdays. Thanks again to Manhattan GMAT for supplying today’s question and (more importantly) tomorrow’s answer! Just like last week, this problem mimics the most advanced quantitative problems on the exam, the type of problem you will see if you are scoring around 700 or higher.

Question
If x and n are positive integers, is n = 1?

(1) The sum of n consecutive integers, starting at x, is divisible by xn.
(2) The product of n consecutive integers, starting at x, is divisible by x^n.

(A) Statement (1) ALONE is sufficient to answer the question, but statement (2) alone is not.
(B) Statement (2) ALONE is sufficient to answer the question, but statement (1) alone is not.
(C) Statements (1) and (2) TAKEN TOGETHER are sufficient to answer the question, but NEITHER statement ALONE is sufficient.
(D) EACH statement ALONE is sufficient to answer the question.
(E) Statements (1) and (2) TAKEN TOGETHER are NOT sufficient to answer the question.

Get out your pencils and scratch paper, and be sure to check back tomorrow for an in depth look at the answer!

Share

Workbook Wednesdays: Boats on the Lake Answer

As promised, here is the answer to yesterday’s Manhattan GMAT Challenge Question!

The key to this problem is to make the common term in both ratios equal. We should set up a table to display both ratios:

 

Cat

Can

Kay

 

4

7

 
   

5

9

Now, we can double any of the ratios. In fact, we can multiply any row by any positive-integer factor (x2, x3, x10, etc.). We are constrained to positive-integer factors, though, because the actual number of any boat must be a positive integer.

The number of canoes in each row should be the same, so that we can merge the ratios. The least common multiple of 7 and 5 is 35, so we multiply the top row by 5 and the bottom row by 7:

 

Cat

Can

Kay

 

20

35

 
   

35

63

This means that the “3-way” ratio of catamarans, canoes, and kayaks is 20:35:63. That is, for every 20 catamarans on the lake, there are 35 canoes and 63 kayaks. This ratio is already reduced to lowest integers, because there are no prime factors in common among all 3 integers.

The smallest number of boats that can be on the lake is 20 + 35 + 63 = 118. Since the total number of boats must be an integer, any possible number of boats must be a multiple of 118. To check which number is a multiple of 118, we factor 118 into its primes: 2 and 59. This allows us to spot 590, which is 59 x 10 and therefore 118 x 5.

The answer is D.

Share

Workbook Wednesdays: Boats on the Lake

Welcome back to another edition of Workbook Wednesdays, brought to you by our friends at Manhattan GMAT. Take a look at the problem below, and be sure to check back in with us tomorrow for an explanation of the answer!

Question:

On Lake Coheeries, there are only three kinds of boats: catamarans, canoes, and kayaks. The ratio of catamarans to canoes is 4:7, and the ratio of canoes to kayaks is 5:9. Which of the following could be the total number of boats on the lake?

A) 575
B) 580
C) 585
D) 590
E) 595

Share

Workbook Wednesdays: Lobster Bisque Answer

Below is the answer to yesterday’s GMAT Challenge Question!

Question
A restaurant pays a seafood distributor d dollars for 6 pounds of Maine lobster. Each pound can make v vats of lobster bisque, and each vat makes b bowls of lobster bisque. If the cost of the lobster per bowl is an integer, and if v and b are different prime integers, then which of the following is the smallest possible value of d?

(A) 15
(B) 24
(C) 36
(D) 54
(E) 90

Answer
Let’s start by finding the cost of the lobster, per bowl, in terms of the variables given (d, v, and b).

(d dollars/6 pounds) x (1 pound/v vats) x (1 vat/b bowls) = (d/6vb).

The problem states that this value, the cost of the lobster per bowl, or (d/6vb), is an integer. In other words, d is divisible by 6vb. To make d as small as possible, we need to make 6vb as small as possible. Since v and b are different prime integers, the smallest value of 6vb is 36 (using the two smallest prime integers, v = 2 and b = 3, or v = 3 and b = 2).

In order to make the cost of the lobster per bowl an integer, d must be divisible by 36. In other words, d must be a multiple of 36. What’s the smallest possible multiple of 36? The smallest multiple of 36 is 36.

The correct answer is C, 36.

Share

Workbook Wednesdays: Lobster Bisque

Welcome to the another installment of Workbook Wednesdays. Thanks again to Manhattan GMAT for supplying today’s question and (more importantly) tomorrow’s answer! Just like last week, this problem mimics the most advanced quantitative problems on the exam, the type of problem you will see if you are scoring around 700 or higher.

Question
A restaurant pays a seafood distributor d dollars for 6 pounds of Maine lobster. Each pound can make v vats of lobster bisque, and each vat makes b bowls of lobster bisque. If the cost of the lobster per bowl is an integer, and if v and b are different prime integers, then which of the following is the smallest possible value of d?
(A) 15
(B) 24
(C) 36
(D) 54
(E) 90

Get out your pencils and scratch paper, and be sure to check back tomorrow for an in depth look at the answer!

Share

Workbook Wednesdays: Join the Club (GMAT Problem Answer)

As promised, here is the answer to yesterday’s Challenge Problem courtesy of our friends at Manhattan GMAT!

Question

A certain club has exactly 5 new members at the end of its first week. Every subsequent week, each of the previous week’s new members (and only these members) brings exactly x new members into the club. If y is the number of new members brought into the club during the twelfth week, which of the following could be y?

(A)
(B)
(C)
(D)
(E)

Answer

At the end of the first week, there are 5 members. During the second week, 5x new members are brought in (x new members for every existing member). During the third week, the previous week’s new members (5x) each bring in x new members:new members. If we continue this pattern to the twelfth week, we will see that new members join the club that week. Since y is the number of new members joining during week 12, .

If , we can set each of the answer choices equal to and see which one yields an integer value (since y is a specific number of people, it must be an integer value). The only choice to yield an integer value is (D):

Therefore x = 15.

Since choice (D) is the only one to yield an integer value, it is the correct answer.

Share

Workbook Wednesdays: Join the Club (GMAT Challenge Question)

Welcome back to another edition of Workbook Wednesdays, brought to you by our friends at Manhattan GMAT. This question is of the caliber one is likely to see if scoring above 700 on the quantitative section of the GMAT. Check back tomorrow for an in-depth look at the answer!

Question

A certain club has exactly 5 new members at the end of its first week. Every subsequent week, each of the previous week’s new members (and only these members) brings exactly x new members into the club. If y is the number of new members brought into the club during the twelfth week, which of the following could be y?

(A)

(B)

(C)

(D)

(E)

Share

Workbook Wednesdays: Win Some, Lose Some Answer

As promised, below is the answer to our weekly Challenge Problem. Enjoy!

Question

A gambler began playing blackjack with $110 in chips. After exactly 12 hands, he left the table with $320 in chips, having won some hands and lost others. Each win earned $100 and each loss cost $10. How many possible outcomes were there for the first 5 hands he played? (For example, won the first hand, lost the second, etc.)

(A) 10
(B) 18
(C) 26
(D) 32
(E) 64

Answer

Let W be the number of wins and L be the number of losses. Since the total number of hands equals 12 and the net winnings equal $210, we can construct and solve the following simultaneous equations:


So we know that the gambler won 3 hands and lost 9. We do not know where in the sequence of 12 hands the 3 wins appear. So when counting the possible outcomes for the first 5 hands, we must consider these possible scenarios:

1) Three wins and two losses
2) Two wins and three losses
3) One win and four losses
4) No wins and five losses

In the first scenario, we have WWWLL. We need to know in how many different ways we can arrange these five letters:

So there are 10 possible arrangements of 3 wins and 2 losses.

The second scenario — WWLLL — will yield the same result: 10.

The third scenario — WLLLL — will yield 5 possible arrangements, since the one win has only 5 possible positions in the sequence.

The fourth scenario — LLLLL — will yield only 1 possible arrangement, since rearranging these letters always yields the same sequence.

Altogether, then, there are 10 + 10 + 5 + 1 = 26 possible outcomes for the gambler’s first five hands.

The correct answer is C.

Share

Workbook Wednesdays: Win Some, Lose Some

Here is this week’s Challenge Problem, brought to us by our friends at Manhattan GMAT. This is the caliber of problem one would see on the exam if scoring in the 700 range or higher. Take a shot at this one and check back tomorrow for an in depth look at the answer!

Question

A gambler began playing blackjack with $110 in chips. After exactly 12 hands, he left the table with $320 in chips, having won some hands and lost others. Each win earned $100 and each loss cost $10. How many possible outcomes were there for the first 5 hands he played? (For example, won the first hand, lost the second, etc.)

(A) 10
(B) 18
(C) 26
(D) 32
(E) 64

Share

Workbook Wednesdays: Remains of the Day Answer

Here is the answer to Wednesday’s Challenge Question from Manhattan GMAT. Check back next week for another Workbook Wednesday question!

Question

If n is an integer and n4 is divisible by 32, which of the following could be the remainder when n is divided by 32?

(A) 2
(B) 4
(C) 5
(D) 6
(E) 10

Answer

The prime factors of n4 are really four sets of the prime factors of the integer n.

Since n4 is divisible by 32 (or 25), n4 must be divisible by 2 at least 5 times. What does this tell us about the integer n?

If n is divisible by only one 2, then n4 would be divisible by exactly four 2’s (since the prime factors of n4 have no source other than the integer n).

But we know that n4 is divisible by at least five 2’s! This means that n must be divisible by at least two 2’s (which means that n4 must be divisible by eight 2’s). Thus, we know that the integer n must be divisible by 4.

Now that we know that n is divisible by 4, we can consider what happens when we divide n by 32.

If we divide n by 32 we can represent this mathematically as follows:

n = 32b + c (where b is the number of times 32 goes into n and c is the integer remainder)

We know that n is divisible by 4 so we can rewrite this as:

4x = 32b + c(where x is an integer)

This equation can be simplified, by dividing both sides by 4 as follows:

x = 8b + c/4

Since we know that x is an integer, the sum of 8b and c/4 must yield an integer. We know that 8b is an integer so c/4 must be also be an integer. Therefore, c, the remainder, must be divisible by 4.

Only answer choice B qualifies. The remainder when n is divided by 32 could be 4. It could not be any of the other answer choices. The correct answer is B.

Share

Workbook Wednesdays: Remains of the Day

Welcome back to another round of Workbook Wednesdays, where we take a shot at one of Manhattan GMAT’s ‘challenge problems,’ the caliber of problem you’ll see if you’re scoring above 700 on the test. Check back with us on Thursday when we’ll work through the answer!
Question
If n is an integer and n4 is divisible by 32, which of the following could be the remainder when n is divided by 32?
(A) 2
(B) 4
(C) 5
(D) 6
(E) 10
Share

Workbook Wednesdays: Missile Toe Answer

Here is the answer for yesterday’s Workbook Wednesday challenge problem!

Question

Two missiles are launched simultaneously. Missile 1 launches at a speed of x miles per hour, increasing its speed by a factor of every 10 minutes (so that after 10 minutes its speed is , after 20 minutes its speed is , and so forth). Missile 2 launches at a speed of y miles per hour, doubling its speed every 10 minutes. After 1 hour, is the speed of Missile 1 greater than that of Missile 2?

1)
2)

(A) Statement (1) ALONE is sufficient to answer the question, but statement (2) alone is not.
(B) Statement (2) ALONE is sufficient to answer the question, but statement (1) alone is not.
(C) Statements (1) and (2) TAKEN TOGETHER are sufficient to answer the question, but NEITHER statement ALONE is sufficient.
(D) EACH statement ALONE is sufficient to answer the question.
(E) Statements (1) and (2) TAKEN TOGETHER are NOT sufficient to answer the question.

Answer

Since Missile 1’s rate increases by a factor of every 10 minutes, Missile 1 will be traveling at a speed of miles per hour after 60 minutes:

minutes 0-10 10-20 20-30 30-40 40-50 50-60 60+
speed

And since Missile 2’s rate doubles every 10 minutes, Missile 2 will be traveling at a speed of after 60 minutes:

minutes 0-10 10-20 20-30 30-40 40-50 50-60 60+
speed

The question then becomes: Is ?

Statement (1) tells us that . Squaring both sides yields . We can substitute for y: Is ? If we divide both sides by , we get: Is ? We can further simplify by taking the square root of both sides: Is ? We still cannot answer this, so statement (1) alone is NOT sufficient to answer the question.

Statement (2) tells us that , which tells us nothing about the relationship between x and y. Statement (2) alone is NOT sufficient to answer the question.

Taking the statements together, we know from statement (1) that the question can be rephrased: Is ? From statement (2) we know certainly that , which is another way of expressing . So using the information from both statements, we can answer definitively that after 1 hour, Missile 1 is traveling faster than Missile 2.

The correct answer is C: Statements (1) and (2) taken together are sufficient to answer the question, but neither statement alone is sufficient.

Share

Workbook Wednesdays: Missile Toe

Welcome back to Workbook Wednesdays, our weekly GMAT challenge problem designed to help those of you who are prepping for the GMAT. As usual, this week’s question comes courtesy of our friends at Manhattan GMAT. We’ve chosen to feature a Data Sufficiency problem since many test takers struggle with these unique questions. We’ll post an in-depth look at the answer tomorrow, so make sure to check back then!

Question

Two missiles are launched simultaneously. Missile 1 launches at a speed of x miles per hour, increasing its speed by a factor of every 10 minutes (so that after 10 minutes its speed is , after 20 minutes its speed is , and so forth). Missile 2 launches at a speed of y miles per hour, doubling its speed every 10 minutes. After 1 hour, is the speed of Missile 1 greater than that of Missile 2?

1)
2)

(A) Statement (1) ALONE is sufficient to answer the question, but statement (2) alone is not.
(B) Statement (2) ALONE is sufficient to answer the question, but statement (1) alone is not.
(C) Statements (1) and (2) TAKEN TOGETHER are sufficient to answer the question, but NEITHER statement ALONE is sufficient.
(D) EACH statement ALONE is sufficient to answer the question.
(E) Statements (1) and (2) TAKEN TOGETHER are NOT sufficient to answer the question.

Share

Workbook Wednesdays: Flipping for Dollars Answer

As promised, here is the answer to yesterday’s Manhattan GMAT Challenge Question!

Question

Kate and Danny each have $10. Together, they flip a fair coin 5 times. Every time the coin lands on heads, Kate gives Danny $1. Every time the coin lands on tails, Danny gives Kate $1. After the five coin flips, what is the probability that Kate has more than $10 but less than $15?

Answer

Let’s consider the different scenarios:If Kate wins all five flips, she ends up with $15.
If Kate wins four flips, and Danny wins one flip, Kate is left with $13.
If Kate wins three flips, and Danny wins two flips, Kate is left with $11.
If Kate wins two flips, and Danny wins three flips, Kate is left with $9.
If Kate wins one flip, and Danny wins four flips, Kate is left with $7.
If Kate loses all five flips, she ends up with $5.

The question asks for the probability that Kate will end up with more than $10 but less than $15. In other words, we need to determine the probability that Kate is left with $11 or $13 (since there is no way Kate can end up with $12 or $14).

The probability that Kate ends up with $11 after the five flips:

Since there are 2 possible outcomes on each flip, and there are 5 flips, the total number of possible outcomes is . Thus, the five flips of the coin yield 32 different outcomes.

To determine the probability that Kate will end up with $11, we need to determine how many of these 32 outcomes include a combination of exactly three winning flips for Kate.

We can create a systematic list of combinations that include three wins for Kate and two wins for Danny: DKKKD, DKKDK, DKDKK, DDKKK, KDKKD, KDKDK, KDDKK, KKDKD, KKDDK, KKKDD = 10 ways.

Alternatively, we can consider each of the five flips as five spots. There are 5 potential spots for Kate’s first win. There are 4 potential spots for Kate’s second win (because one spot has already been taken by Kate’s first win). There are 3 potential spots for Kate’s third win. Thus, there are ways for Kate’s three victories to be ordered.

However, since we are interested only in unique winning combinations, this number must be reduced due to overcounting. Consider the winning combination KKKDD: This one winning combination has actually been counted 6 times (this is 3! or three factorial) because there are 6 different orderings of this one combination:

This overcounting by 6 is true for all of Kate’s three-victory combinations. Therefore, there are only ways for Kate to have three wins and end up with $11 (as we had discovered earlier from our systematic list).

The probability that Kate ends up with $13 after the five flips:

To determine the probability that Kate will end up with $13, we need to determine how many of the 32 total possible outcomes include a combination of exactly four winning flips for Kate.

Again, we can create a systematic list of combinations that include four wins for Kate and one win for Danny: KKKKD, KKKDK, KKDKK, KDKKK, DKKKK = 5 ways.

Alternatively, using the same reasoning as above, we can determine that there are ways for Kate’s four victories to be ordered. Then, reduce this by 4! (four factorial) or 24 due to overcounting. Thus, there are ways for Kate to have four wins and end up with $13 (the same answer we found using the systematic list).

The total probability that Kate ends up with either $11 or $13 after the five flips:

There are 10 ways that Kate is left with $11. There are 5 ways that Kate is left with $13.

Therefore, there are 15 ways that Kate is left with more than $10 but less than $15.

Since there are 32 possible outcomes, the correct answer is , answer choice D.

Share