Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Is x divisible by 30? (1) X = k*(m^3 - m), where m and k are [#permalink]

Show Tags

17 Jul 2003, 03:14

00:00

A

B

C

D

E

Difficulty:

(N/A)

Question Stats:

43% (02:04) correct
57% (01:46) wrong based on 8 sessions

HideShow timer Statistics

Is x divisible by 30?

(1) X = k*(m^3 - m), where m and k are both integers > 9
(2) X = n^5 - n, where n is an integer > 9

(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. _________________

Best,

AkamaiBrah Former Senior Instructor, Manhattan GMAT and VeritasPrep Vice President, Midtown NYC Investment Bank, Structured Finance IT MFE, Haas School of Business, UC Berkeley, Class of 2005 MBA, Anderson School of Management, UCLA, Class of 1993

you take any number where n>9 you and subtract that by 1 you end up in the last integer being either 5 or 0, which will certainly be divided 30.
I hope I am right?

the part m(m-1)(m+1) is always divisible by 3, since those are three consecutive numbers. Since m>9, let us check some numbers
m=10) 9*10*11 - OK
m=11) 10*11*12 - OK
m=12) 11*12*13 - not OK. but we have K>9 can be 11 - not OK again

(2) X=n^5-n=n(n^4-1)=n(n-1)(n+1)(n^2+1)

n(n-1)(n+1) is divisible by 3, but not by 30 each time

consider n=13) 12*13*14*170 - OK
consider n=12) 11*12*13*145 - divisible by 30
consider n=11) 10*11*12*122 - divisible by 30
consider n=10) 9*10*11*82 - divisible by 30

Cool Stolyar. Just for fun, can you quickly prove that (2) is ALWAYS divisible by 30 for ALL n? _________________

Best,

AkamaiBrah Former Senior Instructor, Manhattan GMAT and VeritasPrep Vice President, Midtown NYC Investment Bank, Structured Finance IT MFE, Haas School of Business, UC Berkeley, Class of 2005 MBA, Anderson School of Management, UCLA, Class of 1993

you take any number where n>9 you and subtract that by 1 you end up in the last integer being either 5 or 0, which will certainly be divided 30. I hope I am right?

Which makes the answer B.

The answer is indeed B, but I don't how you can show mathematically that (2) always has last digit 0 or 5 (actually, it always has last digit 0). I would be interested as that would be a great quick proof (although, my proof indirectly implies that the last digit must be 0). _________________

Best,

AkamaiBrah Former Senior Instructor, Manhattan GMAT and VeritasPrep Vice President, Midtown NYC Investment Bank, Structured Finance IT MFE, Haas School of Business, UC Berkeley, Class of 2005 MBA, Anderson School of Management, UCLA, Class of 1993

(1) X = k*(m^3 - m), where m and k are both integers > 9 (2) X = n^5 - n, where n is an integer > 9

Solution:

First, since 30 = 2*3*5, what the question stem is REALLY asking you is:
Does X have at least one factor of 2, 3, and 5?

(1). When you see an expression that you cannot make any conclusions about, immediate think about how to rearrange it!

for m^3 * m , the only thing you can do is factor. So:

k(m^3 - m) = k(m(m^2 - 1)) = k*(m-1)*m*(m+1) = k X product of 3 consecutive numbers.

Since every third number must be a factor of 3, and every two numbers must be even, (m-1)*m*(m+1) MUST have a factor of 6. However, there is no way to determine whether it has a factor of 5, nor can we determine this about k, hence, (1) is NOT sufficient. This analysis should only have taken 30 seconds. (Don't plug in numbers -- this is plenty proof - move on!).

(2). Right away, factor until you can't anymore!

n^5 - n = n * (n^4 - 1)
= n * (n^2 - 1) * (n^2 + 1)
= n * (n - 1) * (n + 1) * (n^2 + 1)
= (n - 1) * n * (n + 1) * (n^2 + 1) or 3 consec integers x (n^2 + 1)
(Stolyar, you got this far fine!!!)

We already know that the 3 consecutive integers MUST have a factor of 6. So we need to determine whether their is a factor of 5 in there somewhere for all possible n. Use logic.

Okay, n must either be divisible by 5, or have remainder of 1, 2, 3, or 4, when divided by 5, right?

If n is divisible by 5, we have our 5, YES!
If n has remainder 1, then the (n - 1) term must be divisible by 5, YES again!
if n has remainder 4, then the (n + 1) term must be divisible by 5, YES again!

Now we are only left with when n has remainder 2 and 3 respectively. For this, we need to check the (n^2 + 1) term

case 1: n divided by 5 has remainder 2.
we can express n as
n = 5j + 2.
so n^2 + 1 = (5j + 2)^2 + 1
= 25j^2 + 20j + 4 + 1
= 25j^2 + 20j + 5 --> YES

case 2: n divided by 5 has remainder 3.
we can express n as
n = 5j + 3.
so n^2 + 1 = (5j + 3)^2 + 1
= 25j^2 + 30j + 9 + 1
= 25j^2 + 30j + 10 --> YES

Hence X is divisible by 5 for all possible n's so (2) is sufficient and the answer is (b).

Author's note: the reason that I have a K term in (1) is so that there exists an X that satisfies both equations. NOBODY ever points this out, but if you look carefully at all of the ETS problems in the OG, you will not be able to (at least I couldn't) find one where (1) and (2) contradict each other, even though they have never officially admitted that this is always true. This is good to know, because if you find that that they DO contradict, I believe that you probably made an error. (Most of the prep courses are not so careful). Also, the reason I specified all variables > 9 is to dissuade people from plugging in numbers -- much faster to use logic and number properties.

BTW, if K = 101, m = 10, and n = 10, X = 9990. _________________

Best,

AkamaiBrah Former Senior Instructor, Manhattan GMAT and VeritasPrep Vice President, Midtown NYC Investment Bank, Structured Finance IT MFE, Haas School of Business, UC Berkeley, Class of 2005 MBA, Anderson School of Management, UCLA, Class of 1993

Last edited by AkamaiBrah on 18 Jul 2003, 08:50, edited 1 time in total.

you can also do this quick trick every time they ask you for divisions of some sums...for example we can write the following n^2 + 1 = n^2 + 5 - 4 = n^2-2^2 + 5 = (n-2)(n+2) + 5 ...you can develop the equation to have all terms divide 5 including this one: (n-2)(n+2)(n-1) ...for n>9 ...

(1) X = k*(m^3 - m), where m and k are both integers > 9 (2) X = n^5 - n, where n is an integer > 9

I'm sure most people here will have worked on problems involving units digits and powers - something which is frequently tested on the GMAT - questions like What is the units digit of \(3^{15} + 4\)? . In solving such questions, you pretty much always make use of the fact that units digits 'repeat in blocks of four'. For example, for powers of 3:

3^1 ends in 3 3^2 ends in 9 3^3 ends in 7 3^4 ends in 1 3^5 ends in 3, and we're back to where we started; 3^5 has the same units digit as 3^1

That happens for any digit - units digits repeat in blocks of 4 (well, that's the worst case; sometimes we have blocks of 2 or of 1). But for any integer k, it is always true that k^5 has the same units digit as k, and similarly, k^6 has the same units digit as k^2, and so on. As a consequence, if k is an integer, k^5 - k always ends in 0, so is always divisible by 10 (and by the same token, you can invent all kinds of expressions which must be multiples of 10; k^9 - k, for example, or k^102 - k^2) .

So here, from Statement 2, n^5 - n must be divisible by 10, and since n^5 - n = (n-1)(n)(n+1)(n^2 + 1) contains a product of three consecutive integers, it must be divisible by 3 as well, and thus must be divisible by 30, so Statement 2 is sufficient.

Oh, and the answer to the question above, What is the units digit of \(3^{15} + 4\)? , is 1, since 3^15 has the same units digit as 3^3, so 3^15 ends in 7. When we add 4, we get a number ending in 1. _________________

GMAT Tutor in Toronto

If you are looking for online GMAT math tutoring, or if you are interested in buying my advanced Quant books and problem sets, please contact me at ianstewartgmat at gmail.com

gmatclubot

Re: DS number theory
[#permalink]
04 Nov 2010, 15:20

Excellent posts dLo saw your blog too..!! Man .. you have got some writing skills. And Just to make an argument = You had such an amazing resume ; i am glad...

So Much $$$ Business school costs a lot. This is obvious, whether you are a full-ride scholarship student or are paying fully out-of-pocket. Aside from the (constantly rising)...

They say you get better at doing something by doing it. then doing it again ... and again ... and again, and you keep doing it until one day you look...