What is this? (1 Viewer)

rumour

Active Member
Joined
Feb 19, 2004
Messages
2,011
Location
Capital Hill
Gender
Undisclosed
HSC
2004
What topic would the following question be in?

It was in my BT+Prob. assessment, but the last bit seems to be a MI.

Does anyone know how to do it?

i.)Write down the formula for the coefficient of x^r in the expansion of (1 + x)^n, where r & n are positive integers & 1 < r < n (less than)

ii.)Let s & t be postive consecutive integers, with t= s + 1.
Show the s^2n + 2nt -1 is divisible by t^2.

iii.)Deduce the 5^20 + 119 is divisible by 36.
 
Last edited:

Estel

Tutor
Joined
Nov 12, 2003
Messages
1,261
Gender
Male
HSC
2005
2.. requires (t-1)^2k I believe, which would require binomial? Yes? No?
 

:: ck ::

Actuarial Boy
Joined
Jan 1, 2003
Messages
2,414
Gender
Male
HSC
2004
well of course it requires (t-1)^2k ... it says deduce .. :p

havent done binomial yet at school [ive done it.. but not in much detail] .. so not sure if its an induction q or not
 

Harimau

Member
Joined
Mar 24, 2003
Messages
430
Location
You are not me, therefore you are irrelevant
Gender
Male
HSC
2003
Part 1 is easy.

The Second Part i think is a little more challenging.

What we are required to show is that s^(2n) + 2nt - 1 is divisible by t^2

Now s^(2n) - 1 is clearly divisibly by t^2, just expand the binomiall and you can see for yourself.

the problem lies in the term 2nt/t^2, which simplifies to 2n/t.

So what you need to do is just to prove 2n/t is an integer, which i really don't know what to do.

n and t are both integers, but are not correlated with each other. So i don't know what do from there.

Part 3 is just using the formula derived in part 2. Sub n = 10, and t = 6 and it will work out.
 

CM_Tutor

Moderator
Moderator
Joined
Mar 11, 2004
Messages
2,644
Gender
Male
HSC
N/A
None of this is induction - it's all binomial.
Originally posted by rumour
ii.)Let s & t be postive consecutive integers, with t= s + 1.
Show the s^2n + 2nt -1 is divisible by t^2.

iii.)Deduce the 5^20 + 119 is divisible by 36.
s<sup>2n</sup> = (t - 1)<sup>2n</sup>, as t = s + 1
= <sup>2n</sup>C<sub>0</sub>t<sup>2n</sup> + <sup>2n</sup>C<sub>1</sub>t<sup>2n-1</sup>(-1)<sup>1</sup> + <sup>2n</sup>C<sub>2</sub>t<sup>2n-2</sup>(-1)<sup>2</sup> + <sup>2n</sup>C<sub>3</sub>t<sup>2n-3</sup>(-1)<sup>3</sup> + ... + <sup>2n</sup>C<sub>2n-1</sub>t<sup>2n-(2n-1)</sup>(-1)<sup>2n-1</sup> + <sup>2n</sup>C<sub>2n</sub>t<sup>2n-2n</sup>(-1)<sup>2n</sup>
= <sup>2n</sup>C<sub>0</sub>t<sup>2n</sup> - <sup>2n</sup>C<sub>1</sub>t<sup>2n-1</sup> + <sup>2n</sup>C<sub>2</sub>t<sup>2n-2</sup> - <sup>2n</sup>C<sub>3</sub>t<sup>2n-3</sup> + ... - <sup>2n</sup>C<sub>2n-1</sub>t + <sup>2n</sup>C<sub>2n</sub>
= t<sup>2</sup>(<sup>2n</sup>C<sub>0</sub>t<sup>2n-2</sup> - <sup>2n</sup>C<sub>1</sub>t<sup>2n-3</sup> + <sup>2n</sup>C<sub>2</sub>t<sup>2n-4</sup> - <sup>2n</sup>C<sub>3</sub>t<sup>2n-3</sup> + ... + <sup>2n</sup>C<sub>2n-2</sub>) - 2nt + 1, as <sup>2n</sup>C<sub>2n-1</sub> = 2n and <sup>2n</sup>C<sub>2n</sub> = 1
So, s<sup>2n</sup> + 2nt - 1 = t<sup>2</sup>(<sup>2n</sup>C<sub>0</sub>t<sup>2n-2</sup> - <sup>2n</sup>C<sub>1</sub>t<sup>2n-3</sup> + <sup>2n</sup>C<sub>2</sub>t<sup>2n-4</sup> - <sup>2n</sup>C<sub>3</sub>t<sup>2n-3</sup> + ... + <sup>2n</sup>C<sub>2n-2</sub>), which is divisible by t<sup>2</sup>

So, s<sup>2n</sup> + 2nt - 1 is divisible by t<sup>2</sup>, as required.

Now, put t = 6 and n = 10. It follows that s = 5, and hence 5<sup>20</sup> + 2(10)(6) - 1 = 5<sup>20</sup> + 119 is divisible by 6<sup>2</sup> = 36
 

Users Who Are Viewing This Thread (Users: 0, Guests: 1)

Top