|
thmo รุนลายคราม 2535 หนุกๆ เดกอ่อนคิดได้ ผู้ใหญ่คิดดี
โพสต์เมื่อ:
22:38 วันที่ 23 มิ.ย. 2550 ชมแล้ว:
333 ตอบแล้ว:
7
เชิญเลย
![]() จำนวน 7 ความเห็น, หน้า่ | -1- ช่วยกันคิดนะครับ ขุดๆ ยังไม่มีไอเดียเลยครับ อย่าคิดลึกดิครับมันไม่ยาก Hint: 1) [a(n)]^2 = [a(n-1)+1/a(n-1)]^2 =[a(n-1)]^2 + 2 + [1/a(n-1)]^2. 2) Use 1) to show that [a(n-1)]^2+2 < [a(n)]^2 <= [a(n-1)]^2 + 3. 3) Use 2) to show that 2n-1 <= [a(n)]^2 <= 3n-2 for any n. (The equality holds only when n=1). Batominovski (IP:129.187.179.91) A stronger ineqality: 4n^2-2n-1 <= [a(n)]^4 <= 6n^2-3n-2. This one implies that 71 < a(2535) < 79. Another much stronger: 8n^3-3n^2-6n-2 <= [a(n)]^6 <= 12n^3-9n^2/2-27n/2+7. This one gives 71 < a(2535) < 77. One can justify that a(n) approaches sqrt(2n) as n approaches infinity. (Reference: Putnam Exam'2006 Problem B6). Batominovski (IP:129.187.179.91) อสมการสองอันหลังนี่ คนคิดเค้าหาพวก 4n2-2n-1 มาได้ยังไงเนี่ย To show that a(n) ~ sqrt(2n), we may proceed by the following argument. Let f_k(n) and g_k(n) be polynomials in n such that f_k(n) <= [a(n)]^(2k) <= g_k(n). (For examples, f_1(n) = 2n-1, g_1(n) = 3n-2, f_2(n) = 4n^2-2n-1, and g_2(n) = 6n^2-3n-2.) Note that [a(n)]^(2k) = [a(n-1)]^(2k) + C(2k,1)*[a(n-1)]^(2k-2) + ... (lower order terms). Hence, [a(n)]^(2k) >= [a(n-1)]^(2k) + 2k*[a(n-1)]^(2k-2) >= [a(n-1)]^(2k) + 2k*f_{k-1}(n-1). Therefore, f_k(n) = sum(2k*f_{k-1}(j-1), j=1,...,n) + o((n^{k-1}). We can proceed by induction on k that f_k(n) = 2^k*n^k + o(n^{k-1}). Similar argument can be applied to prove that g_k(n) = (3/2)*2^k*n^k + o(n^{k-1}). Thus, f_k(n)/(2n)^k = 1 + o(1/n) and g_k(n)/(2n)^k = 3/2 + o(1/n). Consequently lim_{n->\infty} a(n)/sqrt(2n) <= lim_{k->\infty} lim_{n->\infty}[g_k(n)/(2n)^k]^(1/k) = lim_{k->\infty} (3/2)^(1/k) = 1. Moreover, lim_{n->\infty} a(n)/sqrt(2n) >= lim_{k->\infty} lim_{n->\infty}[f_k(n)/(2n)^k]^(1/k) = lim_{k->\infty} (1)^(1/k) = 1. This proves our assertion. (The similar pattern to this proof is used to determine those polynomials krub.) Batominovski (IP:129.187.179.91) |