MedVision ad

Series and Sequences Question (2 Viewers)

GaDaMIt

Premium Member
Joined
Sep 6, 2005
Messages
428
Gender
Male
HSC
2007
ive proved 1/n + 2/n + 3/n ..... + n/n = (n+1)/2

and then it goes

hence find the sum of the first 300 terms of 1/1 + 1/2 + 2/2 + 1/3 + 2/3 + 3/3 + 1/4 + 2/4+ 3/4+ 4/4 .. etc

help please?

EDIT: Sorry typed up wrong denominator at the start =\
 
Last edited:

GaDaMIt

Premium Member
Joined
Sep 6, 2005
Messages
428
Gender
Male
HSC
2007
i meant first 300 terms...


and also another question, not maths related

why is BoS lagging so badly? is it just me or what?
 

Riviet

.
Joined
Oct 11, 2005
Messages
5,593
Gender
Undisclosed
HSC
N/A
GaDaMIt said:
why is BoS lagging so badly? is it just me or what?
Yeah, the server has been lagging alot in the last few days; mainly due to sudden influx of '06ers online on the forums and posting in them.
 

GaDaMIt

Premium Member
Joined
Sep 6, 2005
Messages
428
Gender
Male
HSC
2007
NVM sorry if anyone answered - BoS lagging badly anyway .. stupid question :p .. anyway another Q..

Tn = 2n + 3 + 2^n is a mix of AP and GP. USe combination of AP and GP formulae to find Sn?
 
Last edited:

Riviet

.
Joined
Oct 11, 2005
Messages
5,593
Gender
Undisclosed
HSC
N/A
The GP part is 2n and the AP part is 2n+3. Just apply sum of a GP and AP to each respectively to find Sn.
 

GaDaMIt

Premium Member
Joined
Sep 6, 2005
Messages
428
Gender
Male
HSC
2007
i just made a start on mathematical induction..

prove by mathematical induction for all positive integers n

1 + 2 + 2^2 + 2^3 ... + 2^n = 2^(n + 1) - 1



is there a mistake with this question? to my understanding of induction so far i have to prove its true for n = 1...

LHS = 1, RHS = 2^(1+1) - 1 = 2^2 - 1 = 4 - 1 = 3.. so wats going on????
 

Riviet

.
Joined
Oct 11, 2005
Messages
5,593
Gender
Undisclosed
HSC
N/A
For n=1, LHS = 20 + 21
=1 + 2
=3
=RHS :p
 
Last edited:

Riviet

.
Joined
Oct 11, 2005
Messages
5,593
Gender
Undisclosed
HSC
N/A
Assume true for n=k (k is a positve integer): 1 + 2 + 22 + ... + 2k = 2k+1 - 1
Required to prove true for n=k+1: 1 + 2 + 22 + ... + 2k + 2k+1 = 2k+2 - 1

LHS=1 + 2 + 22 + ... + 2k + 2k+1
=2k+1 - 1 + 2k+1, by assumption
=2.2k+1 - 1
=2k+2 - 1
=RHS

.'. true for n=k+1.

[insert your conclusion here]
 

Raginsheep

Active Member
Joined
Jun 14, 2004
Messages
1,227
Gender
Male
HSC
2005
Actually the value of n changes depending on the question. Gernerally it'll be for 0 or 1 but depending on restrictions, it might be 2, 3, 4...

In this case, n = 0 since the first term is 1 or 20.
 

GaDaMIt

Premium Member
Joined
Sep 6, 2005
Messages
428
Gender
Male
HSC
2007
Prove by induction that the sum of the angles of a polygon with n sides is n - 2 straight angles
[HINT: Dissect the (k+1)-gon into a k-gon and a triangle]


??
i am n00b :(
 

GaDaMIt

Premium Member
Joined
Sep 6, 2005
Messages
428
Gender
Male
HSC
2007
prove inequalities by induction .. 3^n > n^2 for n >= 2 (and also for n = 0 and 1)

wats up with that?

why not just have it as n >= 0?
 

Riviet

.
Joined
Oct 11, 2005
Messages
5,593
Gender
Undisclosed
HSC
N/A
BIG EDIT:

If n=0, 30=1, 02=0 => true for n=0
If n=1, 31=3, 12=1 => true for n=1
If n=2, 32=9, 22=4 => true for n=2

.'. It is true for n=0, 1, and 2

Assuming 3k > k2, k is a positive integer AND k>2

Required to prove 3k+1 > (k+1)2 ie 3k+1-(k+1)2 > 0

3k+1-(k+1)2=3k2-(k+1)2 by assumption

>3(2)2-(2+1)2 since k>2 because we already proved it true for n=0 and 1

=12-9

=3

>0 as required

[insert conclusion here]
 
Last edited:

GaDaMIt

Premium Member
Joined
Sep 6, 2005
Messages
428
Gender
Male
HSC
2007
Riviet said:
It works for n=0, 1 and 2 so I'm not sure why the question has that.

Assuming 3k > k2, k is a positive integer
Required to prove 3k+1 > k2

3k+1=3.3k
>3.k2 by assumption
>k2 since k is a positive integer, as required

[insert conclusion here]

Should be n = k+1 on the RHS... quoting you with all the "sups" is too confusing :p ill just hope you understand what im saying.. you need to prove its greater than (k+1)^2 for the last bit
 

Riviet

.
Joined
Oct 11, 2005
Messages
5,593
Gender
Undisclosed
HSC
N/A
Yeah, sorry about that, no wonder it seemed so easy, I'll try it again. :p
 
Last edited:

GaDaMIt

Premium Member
Joined
Sep 6, 2005
Messages
428
Gender
Male
HSC
2007
Also, wat point do u suggest to be tested as step 1? n = 0 or n = 2?
 

Riviet

.
Joined
Oct 11, 2005
Messages
5,593
Gender
Undisclosed
HSC
N/A
GaDaMIt said:
Also, wat point do u suggest to be tested as step 1? n = 0 or n = 2?
In an exam, I'd just prove all three to be safe if the question wasn't clear with the initial value. It does happen to work for n=0 and upwards.
 
Last edited:

SoulSearcher

Active Member
Joined
Oct 13, 2005
Messages
6,757
Location
Entangled in the fabric of space-time ...
Gender
Male
HSC
2007
Well here's this part of the proof, although I don't know how correct that is.

Continuing on, need to show that 3k+1 > (k+1)2
i.e. 3k+1 - (k+1)2 > 0
LHS = 3k+1 - (k+1)2
= 3*3k - (k2+2k+1)
> 3(k2) - (k2+2k+1), using the induction hypothesis
= 3k2 - k2 - 2k - 1
= 2k2 - 2k - 1
= 1/2 * (k2-k-1/2)
= 1/2 * [(k2-k+1/4) -1/2 -1/4]
= 1/2 * [(k - 1/2)2 -3/4]
= (k - 1/2)2/2 - 3/8
> 0, since k > 2

[insert conclusion]
 

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

Top