L

@Loric256

Exemple2

Python
4 weeks ago
def f(x): return(2-x**2) def rect(n,a,b): s=0 S=0 h=(b-a)/n for k in range (n): s=s+f(a+h*k)*h for k in range (1,n+1):

TP n°1 p=254 (10/05/26)

Python
1 month ago
import math def f(x): return math.sqrt(1 + x**2) def petits_rectangles(n): s = 0 for k in range(n): s = s + f(k/n) * (1/n) return s

Exo 96 p201

Python
3 months ago
from math import * def somme(n): v = log(2) S = v for i in range(1, n): v = log(2 - exp(-v)) S = S + v return S print (somme(10))

Méthode de Newton

Python
4 months ago
def comparaison(n): a = methode_1(0, 1, n)[0] b = methode_1(0, 1, n)[1] i = 0 while x>a or x<b : i += 1 return i

Méthode de Newton

Python
4 months ago
def nombre_derive_approche(a): h = 1e-10 return (f(a + h) - f(a)) / h def methode_Newton(n): x = 1 for i in range(n): x = x - f(x) / nombre_derive_approche(x) return x

Méthode de Newton

Python
4 months ago
def methode_1(a, b, n): for i in range(n): m = (a + b) / 2 if f(a) * f(m) < 0: b = m else: a = m return [a, b]

Méthode de Newton

Python
4 months ago
import math def f(x): return x * math.exp(x) - 1 def methode_1(a, b, n): for i in range(n): m = (a + b) / 2 if f(a) * f(m) < 0: b = m