• 沒有找到結果。

1 21p+31p 1 4p

N/A
N/A
Protected

Academic year: 2022

Share "1 21p+31p 1 4p"

Copied!
2
0
0

加載中.... (立即查看全文)

全文

(1)

Chapter 11 Problems Plus

1. We already know that sin x = x x3!3 +x5!5 ::: + ( 1)2n+1 (2n+1)!x2n+1 + :::.

Substitute x by x3we have sin x3 = x3 x9

3! +x15

5! ::: + ( 1)2n+1 x6n+3 (2n + 1)!+ :::

and f(15)(0) is the coe¢ cient of x15 above, which is 5!1. 6.

1 +12+13+212 +2 31 +213 +312 + :::

= P1

n;m=0 1 2n 3m

= P1

n=0 1 2n

P1

m=0 1 3m

= P1

n=0 1 2n

1 1 13

= 111 2

1 1 13

= 3

10. Substitute ak= a0 a1 :::: ak 1 so that we have

nlim!1

Pk 1 p=0ap p

n + p p n + k

= lim

n!1

Pk 1

p=0ap p k 2n+p+k

= Pk 1 p=0ap lim

n!1 p k 2n+p+k

= 0 14.

1 21p+31p 1 4p+ :::

= 1 + 21p 221p +31p+ 41p 241p + :::

= 1 + 21p+31p+41p+ ::::

221p 1 +21p+31p+41p + :::

Hence de…ne A = 1 +21p+31p+41p+ :::. Then 1 +21p +31p +41p + :::

1 21p +31p 1

4p + ::: = A

A 22pA = 2p 1 2p 1 1:

21. As x 0, all the term are positive, hence there is no root on the right side of 0:

For x < 0, the series is

1 jxj 2! +jxj2

4! ::: = X1 n=0

( 1)n p jxj 2n

(2n)! = cosp jxj

Hence the root occur whilep

jxj = 2 + m for m = 0; 1; 2; ::: as x < 0.

1

(2)

25. One check that the derivative of f (x) := u3+ v3+ w3 3uvw is zero and f (0) = 1: One will use the following relation

u0(x) = w (x) ; w0(x) = v (x) ;

v0(x) = u (x) : 26.Follow the hint.

2

參考文獻

相關文件

Elements of Computing Systems, Nisan &amp; Schocken, MIT Press, www.nand2tetris.org , Chapter 1: Compiler II: Code Generation slide

[r]

[r]

Topology Homework 1: Chapter 2.. Page 31,

Homework 2, Advanced Calculus 1.. Rudin Chapter 2,

Find the size of permanent endowment needed to generate an annual $2,000 forever at 10% (annual) interest compounded

• Cell: A unit of main memory (typically 8 bits which is one byte).. – Most significant bit: the bit at the left (high- order) end of the conceptual row of bits in a

• Cell: A unit of main memory (typically 8 bits which is one byte). – Most significant bit: the bit at the left (high- order) end of the conceptual row of bits in a