The Student Room Group

Binomial question

Q:
http://prntscr.com/s0lngg

My w/o:
http://prntscr.com/s0lnpd

Ans is n=2k+1 in the textbook. Where did I go wrong??
Reply 1
Original post by TSR360
Q:
http://prntscr.com/s0lngg

My w/o:
http://prntscr.com/s0lnpd

Ans is n=2k+1 in the textbook. Where did I go wrong??


In your last line before you say "let y = n - k", you cancel a lot of the terms. But I think you are left with too much. On the RHS, where your last term before cancelling is (n - k), note that the term immediately before this will be (n - k + 1).
Reply 2
Original post by Pangol
In your last line before you say "let y = n - k", you cancel a lot of the terms. But I think you are left with too much. On the RHS, where your last term before cancelling is (n - k), note that the term immediately before this will be (n - k + 1).


I’m confused... what term are you talking about? Are you saying I can turn k! into n-k+1?
Reply 3
Original post by TSR360
I’m confused... what term are you talking about? Are you saying I can turn k! into n-k+1?

No - I'm talking about the bit where you go from

(k + 1)! [n(n - 1)...(n - k + 1)] = k! [n(n - 1)...(n - k)],

which I agree with, to

(k + 1)! (n - k + 1) = k! (n - k),

which I don't. What I was suggesting was that you include one more term in the bit in the square bracket on the RHS so that it reads

(k + 1)! [n(n - 1)...(n - k + 1)] = k! [n(n - 1)...(n - k + 1)(n - k)],

as this might make it easier to see how this cancels down.
Reply 4
Original post by Pangol
No - I'm talking about the bit where you go from

(k + 1)! [n(n - 1)...(n - k + 1)] = k! [n(n - 1)...(n - k)],

which I agree with, to

(k + 1)! (n - k + 1) = k! (n - k),

which I don't. What I was suggesting was that you include one more term in the bit in the square bracket on the RHS so that it reads

(k + 1)! [n(n - 1)...(n - k + 1)] = k! [n(n - 1)...(n - k + 1)(n - k)],

as this might make it easier to see how this cancels down.


If I include n-k+1 on the RHS then it cancels down to (k+1)!=k!(n-k) => n = (k+1)!/k! + k
which gives me n = 2k + 1! :smile: Thanks 👍
Reply 5
Original post by TSR360
If I include n-k+1 on the RHS then it cancels down to (k+1)!=k!(n-k) => n = (k+1)!/k! + k
which gives me n = 2k + 1! :smile: Thanks 👍

I notice that the original question doesn't say that you have to do this using the full factorial definition of nCk, so I wonder if they would accept this ad-hoc method:

When they say that nCk = nCk+1, they are saying that we have a row of Pascal's triangle where two adjacent terms are the same. Because we know a bit about Pascal's triangle, in particular that it is symmetrical, this means that we must be looking at an odd row (counting the top row, 1, as row 0). For example:

row 1: 1 1
row 3: 1 3 3 1
row 5: 1 5 10 10 5 1
etc.

So if n is odd, the two terms which are the same in row n (counting the first term as term 0) are terms (n - 1)/2 and (n + 1)/2. It is the first of these which is the k we want, so (n - 1)/2 = k, and we get n = 2k + 1.

Quick Reply

Latest