MedVision ad

Can someone tell me why? (1 Viewer)

Giant Lobster

Active Member
Joined
Jul 3, 2003
Messages
1,322
Location
asdads
Gender
Male
HSC
2004
By definition, e = lim{n -> infinite} (1 + 1/n)^n

But why is
lim{n -> infinite} (1 - 1/n)^n = 1/e ?
 

wogboy

Terminator
Joined
Sep 2, 2002
Messages
653
Location
Sydney
Gender
Male
HSC
2002
Find the general case first.

lim {n-> infinity} (1+a/n)^n
= lim {n -> infinity} e^(ln[(1+a/n)^n])
= lim {n -> infinity} e^[n*ln(1+a/n)]
= e^[ lim {n -> infinity} n*ln(1+a/n) ]
= e^[ lim {n -> infinity} ln(1+a/n) / (1/n) ]

Now the question is how do we find lim {n -> infinity} ln(1+a/n) / (1/n) ? You have to use a certain rule known as L'Hoptial's rule. I'll explain this later.

= e^[ lim {n -> infinity} (-a/n^2)/(1+a/n) / (-1/n^2) ]
= e^[ lim {n -> infinity} a/(1+a/n) ]
= lim {n -> infinity} e^( a/(1+a/n) )
= e^a

so finally:

lim {n-> infinity} (1+a/n)^n = e^a

sub in a = 1 and you get the limit value of e, sub in a = -1, and you get the limit value of 1/e.

--------------------------------------------
L'Hopital's Rule:

if you have two functions f(x) and g(x), both continuous & differentiable (which means f'(x) and g'(x) are continuous too) at x=a, and if f(a) = g(a) = 0 then:

lim {x -> a} f(x)/g(x) = lim {x -> a } f'(x)/g'(x)

This can be proven from first principles of differentiation, but don't bother with it :)
 
Last edited:

Giant Lobster

Active Member
Joined
Jul 3, 2003
Messages
1,322
Location
asdads
Gender
Male
HSC
2004
amazing...
Im beginning to realise this e number is fascinating (yeh i sound so newb)

if its too too much truble, can u show me why

lim(n -> infinite) [ sum(k=0 to n) { x^k/k! } ] = e^x
 

wogboy

Terminator
Joined
Sep 2, 2002
Messages
653
Location
Sydney
Gender
Male
HSC
2002
lim(n -> infinite) [ sum(k=0 to n) { x^k/k! } ] = e^x
ok here's a really cheap no frills proof:

let f(x) = sum(k = 0 -> n) x^k/k!
= 1 + x + x^2/2 + x^3/6 + ... + x^n/n!


therefore,
f'(x) = 1 + x + x^2/2 + ... + x^(n-1)/(n-1)!
= f(x) - x^n/n!

f'(x) = f(x) - x^n/n!

let g(x) = lim {n -> infinity} f(x)
so g(x) = 1 + x + x^2/2 + x^3/6 + ....
g'(x) = g(x) - lim {n -> infinity} (x^n/n!)

lim {n -> infinity} x^n/n! = 0, for any finite value of x (the factorial function grows alot faster than an exponential function, you can prove this)

g'(x) = g(x)
so g(x) = C*e^x
but g(0) = 1 => C = 1
g(x) = e^x

but we already know g(x) = lim {n -> infinity} sum{k = 0 to n} x^k/k!

lim {n -> infinity} sum {k = 0 to n} x^k/k! = e^x

-------------------------------------------

This is actually known as the taylor series expansion of the function f(x) = e^x.

You'll actually notice that sum(k=0 to n) x^k/k! is actually a polynomial of nth degree!

Taylor series are a way of approximating a function to a polynomial, and the higher the degree of the polynomial you use the more accurate (in fact to represent a function 100% accurately by a polynomial, your polynomial needs to be of infinite degree!). This is how computers & calculators compute certain values like sin(100) or ln(6) etc. They don't store & retrieve the values, they approximate the function (e.g. sin() ) to a high degree polynomial and then sub & solve. All continuous & differentiable functions (not just f(x) = e^x) have taylor series expansions.
 
Last edited:

Grey Council

Legend
Joined
Oct 14, 2003
Messages
1,426
Gender
Male
HSC
2004
haven't i always said that wogboy is a genius? Moreover, he is the most darn helpful genius ever. :)

BTW, wogboy, do you do this sort of stuff in Uni? Your doing engineering of some sort, arent ya?
 

Giant Lobster

Active Member
Joined
Jul 3, 2003
Messages
1,322
Location
asdads
Gender
Male
HSC
2004
thats just bloody amazing...
ive always wondered how those trig functions are calculated electronically

hey, you mentioned its a "no frills" proof; by that do u mean theres a more "correct" proof out there?

and how do u prove that factorial grows the fastest?
i know it goes lnx < x^n < n^x < x! as x -> infinite (n E J)

in fact, how do u prove any one of these? i think it may be possible to prove anything up to n^x using harder 3u methods, but dunno how to treat x!
 

flyin'

EDIT
Joined
Aug 21, 2002
Messages
6,677
Gender
Undisclosed
HSC
N/A
You usually won't be asked to prove any of these just like that. They will work you through certain steps to derive a result.
 

wogboy

Terminator
Joined
Sep 2, 2002
Messages
653
Location
Sydney
Gender
Male
HSC
2002
Yep it's 1st year uni level (so don't stress out over it yet :p ). If you study something with a substantial amount of maths (e.g. pure math, engineering, science, actuarial etc) you will come across this stuff.
 

wogboy

Terminator
Joined
Sep 2, 2002
Messages
653
Location
Sydney
Gender
Male
HSC
2002
hey, you mentioned its a "no frills" proof; by that do u mean theres a more "correct" proof out there?
Not really, it's no frills because I only proved what you asked for (i.e. that particular infinite sum equal to e^x). I could have gone further and proven the general case for any function having a taylor series expansion and deriving the taylor formula, but nah I can't be bothered. If your still interested then use Google to search for "taylor series".
 

KeypadSDM

B4nn3d
Joined
Apr 9, 2003
Messages
2,631
Location
Sydney, Inner West
Gender
Male
HSC
2003
Man, i've been trying to prove the:
x<sup>n</sup> < n<sup>x</sup>
For 0 < n < x (n, x E Z)
By differentiation, showing that the gradient of n<sup>x</sup> is always greater than the gradient of x<sup>n</sup> and hence that x<sup>n</sup> < n<sup>x</sup>
But I haven't had any hints, so I don't really know how to do it ... Ugh.
 

J0n

N/A
Joined
Aug 28, 2003
Messages
410
Gender
Male
HSC
2004
What? What about n=1 and x=2?
0 < 1 < 2
2<sup>1</sup> < 1<sup>2</sup> is not true
and n=2 and x=3
0 < 2 < 3
3<sup>2</sup> < 2<sup>3</sup> is not true either
 

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

Top