20.07.2013 Views

Culegere de probleme de Analiz˘a numeric˘a

Culegere de probleme de Analiz˘a numeric˘a

Culegere de probleme de Analiz˘a numeric˘a

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

se obt¸ine pentru valoarea <strong>de</strong>rivatei <strong>de</strong> ordinuln+1în 0<br />

(arctanx) (n+1) = x=0 1<br />

2i (−1)n <br />

1 1<br />

n! −<br />

(x−i) n+1 (x+i) n+1<br />

<br />

x=0<br />

=<br />

(−1) n+1 <br />

1 1<br />

n! −<br />

(−i) n+1 (i) n+1<br />

<br />

= (−1) n+1 n!sin(n+1) π<br />

2 .<br />

Formula MacLaurin corespunzătoare este<br />

arctanx = x− x3<br />

3<br />

Raza <strong>de</strong> convergent¸ă este<br />

+ x5<br />

5<br />

R = lim<br />

n→∞<br />

+... x2n+1<br />

2n+1 +(Rn+1f)(x).<br />

an<br />

an+1<br />

= 1.<br />

Problema 1.0.4 Să se <strong>de</strong>termine punctele <strong>de</strong> maxim s¸i <strong>de</strong> minim ale următoarelor<br />

funct¸ii:<br />

a) f : − 1<br />

<br />

1<br />

6 3 , → R,f(x) = 2x −x +3;<br />

2 2<br />

b) f : R → R, f(x) = 2cosx+x 2 .<br />

Solut¸ie.<br />

a) f ′ (x) = 12x 5 −3x 2 = 3x 2 (4x 3 −1) are rădăcinile realex1,2 = 0 s¸ix3,4,5 =<br />

1<br />

3√ 4 .<br />

f ′′ (x) = 60x 4 −6x, f ′′ (0) = 0,<br />

f ′′′ (x) = 240x 3 −6 = 6(40x 3 −1), f ′′′ (0) = −6 ⇒ 0 punct <strong>de</strong> inflexiune.<br />

Funct¸ia nu are puncte <strong>de</strong> extrem pe − 1<br />

2<br />

, 1<br />

2<br />

b) f ′ (x) = −2sinx+x = 2(x−sinx), f ′ (0) = 0,<br />

f ′′ (x) = −2cosx+2 = 2(1−cosx), f ′′ (0) = 0<br />

f ′′′ (x) = 2sinx, f ′′′ (0) = 0,<br />

f IV (x) = 2cosx, f IV (0) = 2.<br />

x = 0 este punct <strong>de</strong> minim s¸i f(0) = 2.<br />

Problema 1.0.5 Să se <strong>de</strong>termine numărul natural n astfel ca pentru a = 0 s¸i<br />

f : R → R, f(x) = e x Tnf să aproximezef în[−1,1] cu trei zecimale exacte.<br />

.<br />

5

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!