Infi-1 6

Infi-1 6

Operations on infinites #lemma

+=C>0,C=C<0,C=an,bn0anbn?0,,:Special casesanbn?an=17n,bn=3nanbn=17n3n=173173an=17n,bn=3n2anbn=17n3n2=173n0

Sandwich theorem #theorem

an,bn,cn{anbncnanL,cnLbnL{ε>0nεa:n>nεa:|anL|<εε>0nεc:n>nεc:|cnL|<εε>0nε=max(nεa,nεc):n>nε:Lε<anbncn<L+εεnε=max(nεa,nεc):n>nε:|bnL|<εbnL
anL,an>0L>0?L0?an=1n0L0anbn,anL,bnMLM?Lε<anbn<MεL<Man0,mbnManbn0?manbnanManmanm0=0ManM0=0bnan0|an|0an0ε<|an|<εε<an<ε|an|0an0ε<an<εε<|an|<εan0|an|0
an,anbnbn?M>0nM:n>nM:bnan>MM>0nM:n>nM:bn>Mbnan,bnanbnM>0nM:n>nM:bnan>MM>0nM:n>nM:bn>Mbn

Bernoulli #theorem

x>1(1+x)n1+nx
W>1WnW=1Wn=111<W<1Wn0W1WnL,,
W>1Wn=(1+W1)nx=W1(1+W1)n1+(W1)nW>1(W1)>01+(W1)nWn
1<W<1W=0Wn=00|W|n=|Wn||Wn|0Wn0|Wn|=(11|W|)n1|W|>1(1|W|)n1(1|W|)n0|Wn|0Wn0