Is the answer A?

Is the answer A?

i got C

Not sure what the "prime box method" is but you should listen to Rich on this one. A problem like this comes down to number properties. Statement 1 seems to give you all the information you need. I mean, you want to know if mn is divisible by 40 and you are told that m is divisible by 40. That seems to give you your answer right there. It appears that statement 1 alone might be sufficient.

Simply run through the 4 Basic number properties to make sure that you have not forgotten to consider something:

1) positive and negative: well this is not important in this case because even if m or n is negative that does not matter. Negative 40 is divisible by 40. So put this property aside as we do not need it this time.

2) odd/ even: Of course 40 is an even number but that is not really a consideration given that M is already an even number. Put this property aside.

3) non-integers: Does it matter if N is a non-integer? YES!! That is what Rich tested above with the value of .7 for n. This is a non-integer and it can turn mn into something that is not a multiple of 40. This property makes statement 1 not-sufficient alone.

4) 0 and 1: We did not need to test this value for this question. But if we had it would not have been key to this question. Of course if n = 1 then 40*1 = 40 so that is divisible by 40. If n = 0 then 40*0 = 0 and this too is divisible by 40.

Statement 1 is not sufficient because n could be a non-integer.

Statement 2 alone has no chance of being sufficient since you are only told that n = 4.

Taken together the statements are sufficient - not because statement 2 makes n = 4 - but simply because statement 2 guarantees that n is an integer and that is all that you need to know. If m = 40 then 40 (times and integer) = a multiple of 40.


As an aside, testing values as you practice for the GMAT is a great way to teach yourself the rules of number properties. After testing values on this question you can see that a non-integer is something important to think about when testing divisibility. So in the future you can recognize this.

dddanny2006 wrote:Is mn divisible by 40?
(1)m is divisible by 40
(2)n is divisible by 4


Would prefer if anyone helps me out with the Prime Box method here.

As this question stands, there's no need for any system to solve it. Look:

m = 40k where k is the other unknown factor

so mn = 40k *n = 40kn which is divisible by 40.

I hope this helps.