Re: [微積] 證明數列遞增且有界

看板Math作者 (QQ)時間13年前 (2011/05/30 19:41), 編輯推噓1(100)
留言1則, 1人參與, 最新討論串2/2 (看更多)
※ 引述《KOREALee (韓國最高)》之銘言: : 標題: [微積] 證明數列遞增且有界 : 時間: Mon May 30 19:13:49 2011 : : Let the sequence : : : 1 n : An = (1+ ---) : n : : : 1.show that An is increasing : : 2.show that An is bounded 1 1. By comparison with ── , we find when N >= No n^2 ∞ 1 Σ ─── is conv. n=N n! Since ∞ 1 Σ ─── is conv. (by p-series) n=N n^2 ∞ 1 2. Denote Σ ─── is A n=0 n! 1 Consider An=(1 + ──)^n n n n 1 n 1 n 1 = C + C *(──)^1 + ... + C *(──)^k + ... + C *(──)^n 0 1 n k n n n So we have n*(n-1)*...*(n-k+1) 1 = 1 + 1 + ... + ──────────*(──)^k + ... k! n where n*(n-1)*...*(n-k+1) 1 1 n n-1 n-k+1 ──────────*(──)^k = ── * (──) * (──) *...*(───) k! n k! n n n 1 1 k-1 = ── * 1 * (1- ──) *...*(1- ──) k! n n So we can rewrite An as: 1 1 1 1 2 An = 2 + ──*(1- ──) + ──*(1- ──)*(1- ──) +... 2! n 3! n n 1 1 k-1 + ── * (1- ──) *...*(1- ──) + ... k! n n 1 1 n-1 + ── * (1- ──) *...*(1- ──) n! n n 1 < e (Since each item is smaller then ──) k! So far we have showed that An is bounded and An+1 > An is trivial (by comparing each item) -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 111.243.154.184 ※ 編輯: znmkhxrw 來自: 111.243.154.184 (05/30 19:46)

05/30 20:00, , 1F
good
05/30 20:00, 1F
文章代碼(AID): #1Duu9zdd (Math)
文章代碼(AID): #1Duu9zdd (Math)