#Hard limit

34 messages · Page 1 of 1 (latest)

regal zephyr
#

It just goes to 0

#

Since n^n grows way faster

#

You can prove it using induction or something

unborn geyser
#

...wait, how does that rewrite go?

rancid carbon
#

You are right...

#

I was thinking of 1/n as the power but it was -n

#

But I still want a proof of the limit

regal zephyr
#

Just prove that it’s bound by 0 and monotone decreasing for all n, n greater 5 or something

rancid carbon
#

I can show that it's monotonely decreasing and has a lower bound on 0

#

That shows the its convergent

#

But it doesn't really mean that the limit is 0

#

I mean, it's also lower bound by -1 and -2 and -3 and so on but it doesn't mean that the limit is -1 or -2 or -3 and so n

regal zephyr
#

Ye I guess you would have to proof that 0 is the biggest lower bound before

rancid carbon
#

Epsilon delta definition style?

#

Or are there other methods to do this?

regal zephyr
#

You basically say 0 is the biggest since any bigger one would be surpassed at some point but you have to of course proof that that point exists

rancid carbon
#

so basically epsilon delta

#

i think

regal zephyr
#

Ye basically

rancid carbon
#

🤔

regal zephyr
#

Not sure that that’s the easiest and best way to prove it tho. I’ll think about other strategies since this seems like quite a bit of work

unborn geyser
rancid carbon
#

I think so too, that's why I asked if there are other ways of proving this

unborn geyser
#

Think about it like this: n!/n^n = 1/n * 2/n * 3/n * ... * (n - 1)/n * n/n

rancid carbon
#

ye

unborn geyser
#
= (1 - (n - 1)/n) * (1 - (n - 2)/n) * ... * (1 - 1/n) * 1```
unborn geyser
rancid carbon
#

Thanks a lot

unborn geyser
#

In particular, note n! * 2^(n - 1)/n^n = 1 * (n - 1)! * (2/n)^(n - 1)

flat jetty
rancid carbon
#

i am late but wasnt there a formula to approximate a factorial for big numbers of n?

#

involving square root and pi?

#

yep, stirling