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.

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:

(1) can you prove it? (2) Q contains 2 and 3 and so divisible by 6.

(1):

(x + y)^n will contains n + 1 terms in its expansion: n of those terms will have some factor of x and the last one will be y^n. Now let x = 6 and y = 1. Regardless of what n is, there will be one y^n or 1^n term in the expansion plus a whole bunch of other terms all divisible by 6. Hence, if we subtract out the y^n term, we are left with a sum of terms all divisible by x (or 6) hence the sum of those terms is also divisible by 6.
_________________

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

Hmm. Is this something that a GMAT candidate is expected to know? Can you derive this using elementary math?
_________________

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

Sorry. I don't see how you conclude step 2 from step 1. In fact, step 2 simply states what you are trying to prove.
_________________

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

yes, step 3 is just the extrapolation of step 2. you can derive step 2 from step 1, as x^n - y^n = (x-y)*1 for n=1, x^k - y^k will follow the same pattern.

proof:

step 1.
n=1
x^n - y^n = (x-y)

step 2.
n=k
x^k-y^k = (x-y) * some interger .........eq 1. relate this with step 1.

yes, the best way is to put in the integers and come onto the result. I was just trying to prove it using basic maths...

Yes, you can use numbers, but this does not prove that it is true for ALL n.

For example, it is not obvious to me why x^4132 - y^4132 MUST have (x-y) as one of its factors.

I'm sorry. It is not obvious to me why x^k - y^k = (x-y) * some number. In addition, step 3 says nothing different that step 2, but neither give me any rationale of why it is true. Your attempt at an inductive proof is incomplete - you must show 1) GIVEN x^k - y^k is divisible by x-y then IT FOLLOWS that x^(k+1) - y^(k+1) is also divisible by x-y. 2); it works for k = 1. Number 2 is fine, but number 1 doesn't work for me.

The explanation of why this is so is the essense of your "proof" and IMO you have simply hand-waved it by.
_________________

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

when x and y are integers, (x+y) will be an integer. for all the values of n, the result will be (x-y) * an integer.

n=2, (x-y)*(x+y)...this is an integer n=3, (x-y)*(x^2+y^2+xy)...this is an integer n=4, (x-y)(x+y)(x^2+y^2)....these 2 are integers ....

this leads to (x^n - y^n)/(x-y) = an integer.

think, this suffice.

All you have done is demonstrate that it works for the first 4 terms. While this certainly suggests the result, it is definitely not PROOF.
_________________

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 01 Dec 2003, 02:45, edited 1 time in total.

Q=[7^N]тАУ[1^N], a distribution will always contain member [7тАУ1], or 6.

This certainly seems to be true but can you PROVE it for ALL n via a simple proof?

I.e.;Given Q = x^n - 1, prove that for ALL positive integers n, Q is a multiple of x-1

stolyar, i have faith in you....
_________________

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