probas.py

Created by mathislatouche2

Created on December 13, 2023

697 Bytes

# Type your text here
Probas :
P(AunionB)=P(A)+P(B)-P(AinterB)

P(AinterB)=P(A)xP(B)sachant A

P(Abarre)=1-P(A)

Equiprobabilites :
  
P(A)=nombre de cas favorables/
nombre de cas possible


Chapitre 2 :
  
P(A)sachantB = P(AinterB)/P(B)

P(AinterB)=P(A)+P(B)-P(AunionB)

Interdependance :
  
P(AinterB)=P(A)xP(B)

Chapitre 3 :
  
P(AinterB)=P(A)xP(B)sachant A

G represente gain
P represente proba

Loi de proba variable aleatoire:
Valeurs : G=-8
Proba : P(G=-8)=1/9

Valeurs : G=7
Proba : P(G=7)=2/9

Lesperance (proba x gain):
1/9x(-8) + 2/9x(7) + ...

La variance:
on reprends le nombre obtenu en
faisant l'esperance et on met
au carre:
  
1/9x(2-(-8))**2 + 2/9x(2-7)**2
+ ...

During your visit to our site, NumWorks needs to install "cookies" or use other technologies to collect data about you in order to:

With the exception of Cookies essential to the operation of the site, NumWorks leaves you the choice: you can accept Cookies for audience measurement by clicking on the "Accept and continue" button, or refuse these Cookies by clicking on the "Continue without accepting" button or by continuing your browsing. You can update your choice at any time by clicking on the link "Manage my cookies" at the bottom of the page. For more information, please consult our cookies policy.

Accept and continue Continue without accepting