Informatika va at

5.14. Hisoblansin: y= ;

5.15. Hisoblansin:

a) y=cos(x)+cos(x²)+cos(x³)+...+cos(x³⁰);

b) y=1!+2!+3!+...+n!, n>1.

d) sinx, sinsinx, sinsinsinx,... sonlar orasidan moduli 10^-4 dan kichik bo'lgan birinchi n-had topilsin.

5.16. Fibonachchi sonlari quyidagicha aniqlanadi:

f₀=f₁=1, f_n=f_n-1 + f_n-2, n=2,3,...

a) fibonachchi sonlarining 40-hadi topilsin;

b) berilgan m (m>0) sonidan katta bo'lgan birinchi fibonachchi soni topilsin;

v) qiymati 1000 dan oshmaydigan fibonachchi sonlarining yig'indisi – s topilsin;

5.17. Standart funksiyalardan foydalanmagan holda (abs-bundan mustasno) berilgan >0 aniqlikda quyidagilar hisoblansin:

a) u=yex =1+x/1!+x²/2!+...+xⁿ/n!+... ;

b) u=shx= x+x³/3!+x⁵/5!+...+x^{2 n+1}/(2n+1)!+... ;

d) u=cosx= 1-x²/2!+x⁴/4!-...+(-1) ⁿx^{2 n}/(2n)!+... ;

g) u=ln(1+x)= x-x²/2+x³/3-...+(-1)^n-1xⁿ/n+...(|x|<1) ;

d) u=arctgx= x-x³/3+x⁵/5-...+(-1) ⁿx ^{2 n+1}/(2n+1)+...(|x|<1).

Yig'indini hisoblashda navbatdagi qo'shiluvchi had moduli bo'yicha  dan kichik bo'lgan holda talab qilingan aniqlikka erishilgan deb hisob­lansin va keyingi barcha qo'shiluvchilar hisobga olinmasligi mumkin. 5.18. var k,i :integer; x,y :real;

Quyidagi programma bo'laklaridagi xatolar topilsin.

a) y:=0; for x:=0.1 to 0.9 do y:=y+sin(x) ;

b) k:=81; y:=1; for i:=1 to sqrt(k) do y:=2*y ;

v) k:=0; for i:=1 to 9 do k:=k+sqr(i); k:=K*i ;

g) k:=1; for i:=1 to 64 do begin i:=2*; k:=k+1 end .