the question no where says n is an integer or for that matter its positve.
am i missing something here?
Night reader wrote: an easy entry; it tests a^n - b^n reformation --> every time n={n is integer, 2,3,4, ... +infinity} (a-b) is one factor present ahead of the reformation
a^2 - b^2=(a-b)(a+b), a^3 - b^3=(a-b)(a^2 +ab + b^2)
st(1) given the explanation above, this is Not Sufficient, as n can be odd OR even;
st(2) a^n + b^n is not divisible by a + b, if n=1 --> (a^1 + b^1)/(a + b) is quite divisible BUT when n=2 or 4 or 6 ... (a^2 + b^2)/(a + b). In fact a^3 + b^3=(a+b)((a^2 -ab + b^2), hence n must be even for st(2) to be true and our answer is No, n is not odd, it's even. st(2) is Sufficient - B
Is n odd ?
1. a^n - b^n is divisible by a - b
2. a^n + b^n is not divisible by a + brohu27 wrote:re-opening an old thread (this was todays BTG ath question)
can someone explain the solution wth exact steps? unable to figure out