Studiosity - f3105250-3b2d-0137-787f-0afe20bbc746

University of Sydney - ASTAR.TV

Maths - Mathematics - Specialist / Extension
April 07, 2019 16:40

Whiteboard 1

Chat transcript

You asked a question:

I'd like to – Start from this point in the question

” Can you help me with part ii of the attached file ”

You shared a file:

IMG20190407163635.jpg

Specialist said:
Hi, I'm your subject specialist.

You said:

f3105250-3b2d-0137-787f-0afe20bbc746 Page 1 of 7
 Studiosity - f3105250-3b2d-0137-787f-0afe20bbc746

hi

Specialist said:
Have you done anything so far on this question?

You said:
I proved part i but havent made any other progress

Specialist said:
Okay. Do you have any ideas what approach we should take to prove part ii?

You said:
can we start by expanding the LHS
expand the sum

Specialist said:
Not quite. We can't expand the sum if we don't know what the value of n is, since that tells us how many terms we will have in the sum.
To prove that this equation is true, we should complete a proof by induction.
Are you familiar with doing proofs by induction?

You said:
yes

Specialist said:
Great. Can you tell me what the key steps are in doing one?

You said:
Butt is it ok to prove by induction if we dont even know if it is true for all positive integers

Specialist said:
We want to prove that this is true for all positive integer values of n
Since n > r, and the smallest value of r in the sum is 0.

You said:
oh ok i get it
So Step One of induction would be to prove true for n=1

Specialist said:
That's right. And Step Two?

You said:
Assume true for n=k and prove true for n=k+1 using the assumption

Specialist said:
That's right. Let's start with Step One.
We want to prove that the statement is true for n = 1.
What will our first step be?

You said:
rewrite the left hand side with one as n
and write the sum

Specialist said:
That's right. What will that give us?
I'm happy for us to put working onto the whiteboard or to keep typing it into the chat with the equation editor - whichever you prefer

You said:
the whiteboard please
would both lhs and rhs =2

f3105250-3b2d-0137-787f-0afe20bbc746 Page 2 of 7
 Studiosity - f3105250-3b2d-0137-787f-0afe20bbc746

Specialist said:
That's not quite right. Can you write the expanded left hand side with n = 1 onto the whiteboard.
*?

You said:
1
n+r
∑( )
r
0
1 1
( )+( )
0 1
2
isntthishowudoit

Specialist said:
This isn't quite right.
Remember that the top of the combination is n + r.
In the first term, r = 0, so you're correct that the combination is (1 + 0, 0)

You said:
oh yes

Specialist said:
In the second term, r = 1, so the combination becomes (1 + 1, 1)

You said:
so it would e 3

Specialist said:
That's right.

You said:
and rhs also = 3

Specialist said:
Great.
So, we've proved that the statement is true for n = 1.

You said:
yep

Specialist said:
Let's move on to Step Two.

You said:
assume true for n=k

Specialist said:
That's right. And try to prove it is true for n = k+1.
Where would we start on doing this?

You said:
i will send a picture just a moment

Specialist said:
That's sounds like a good idea :)

You shared a file:

IMG20190407165551.jpg

f3105250-3b2d-0137-787f-0afe20bbc746 Page 3 of 7
 Studiosity - f3105250-3b2d-0137-787f-0afe20bbc746

Specialist said:
That's a great start.
Next, how can we expand the sum in the n = k+1 equation so that we can apply our assumption from n = k?

You said:
im not quite sure

Specialist said:
For the first sum, we expand it out to get:
(k, 0) + (k+1, 1) + (k+2, 2) + ... + (k+k-2, k-2) + (k+k-1, k-1) + (k+k, k)

You said:
yep

Specialist said:
Can you do a similar expansion for the sum in the second equation?
(i.e. first few terms & last few terms)

You said:
just a moment

Specialist said:
Let me know if you'd like some help

You said:
(k+1,0)+(k+2,1)+(k+3,2)+...+(k+1+k,k)+(k+1+k+1,k+1)
is it correct?

Specialist said:
Sorry for the delay - There's quite a few terms for me to check there.
Yes, that's right.

You said:
no problemo

f3105250-3b2d-0137-787f-0afe20bbc746 Page 4 of 7
 Studiosity - f3105250-3b2d-0137-787f-0afe20bbc746

but how would we change that to insert the assumption

Specialist said:
We're going to need to apply the proof from part (i) somehow
While you compare the two expanded sums that we just wrote out, can you give me a minute to look back over what I've done so far on paper and
work out what our next step will be?

You said:
ok
ill also try to find a link between part i and ii too

Specialist said:
Sorry that this is taking longer than expected. I'm still working to find a solution here.
Have you had any ideas at your end?

You said:
i tried playing around with part i
and i got this
ill attatch a photo now
IMG20190407171931.jpg

Specialist said:
That's looking awesome - great work!
Do you have any ideas what we would do next?

You said:
are we allowed to work the assumption
so like change it a bit

Specialist said:
We can rearrange the assumption equation as much as we want, as long as it was still created by substituting n = k into the equation that we're
proving.

You said:
ok
i was thinking about canging the range of the sum of the assumption

f3105250-3b2d-0137-787f-0afe20bbc746 Page 5 of 7
 Studiosity - f3105250-3b2d-0137-787f-0afe20bbc746

from 0 to k

Specialist said:
Yes, we can do that.

You said:
to 1 tok

Specialist said:
You'll just need to add / subtract the relevant terms from both sides of the equation.

You said:
and subtract 1 from the LHS
RHS*
because anything C 0 =1
(i mean anything choose 0=1)

Specialist said:
Yes, that's correct.

You said:
so this is what i have know
now*
IMG20190407172700.jpg

Specialist said:
There's just one problem that I see here.
In the assumption, we're summing from 1 to k.
In the equation that you've written out using part (i), we're summing from 1 to k + r.

You said:
oh yeah

Specialist said:
I would recommend writing that equation out with sums from 1 to k instead.

f3105250-3b2d-0137-787f-0afe20bbc746 Page 6 of 7
 Studiosity - f3105250-3b2d-0137-787f-0afe20bbc746

(since you chose the values you would sum between for that equation)

You said:
i dont really get what you mean

Specialist said:
From part (i): nCr + nC(r+1) = (n+1)C(r+1)
This is true for any value of n > r.

You said:
ok
so ur saying i should change the value i let n equal to

Specialist said:
Not quite.
You've set n = k+r:

You said:
yes

Specialist said:
(k+r)Cr + (k+r)C(r+1) = (k+r+1)C(r+1)
This is true for all values of r >= 0
As long as k >= 1.
Is this still clear?

You said:
yep

Specialist said:
Great. Since this is true for all values of r >=0, as long as k>=1, we can sum this equation for any values of r >= 0 and the summed equation will still
be true.

You said:
yes

Specialist said:
We could write out the equation for r = 0 to k, for r = 1 to n+k, for r = 1 to 50
As long as all the values of r are non-negative integers, the equation will be valid for each value of r and therefore the sum is valid.
We should therefore choose to sum this equation between a useful range of values.

You said:
so from i to k
1 to k

Specialist said:
e.g. when we substitute n = k into the equation from (ii), we get a sum from r = 0 to k. That would be a useful range to use as we could then apply the
assumption from n = k without any rearranging
Yes, from r = 1 to k would also be good.

f3105250-3b2d-0137-787f-0afe20bbc746 Page 7 of 7