ref129.py

Created by fatoundira

Created on November 27, 2024

684 Bytes


# Type your text here
card u card = card +card
contraire= soustraction
(kn)=n(n-1)(n-2)...(n-k+1):k!=n!:k!(n-k)! 
(n0)=1
(n1)=n
symetrie(n n-p)=(np)
relation pascal:
  pr tt 1<k<n (n-1 k-1)+(n-1 k)=(nk)
   e(x)=nxp
   v(x)=nxpx(1-p)
   loi bernoulli ayant 2 issues 
   succes =1 p(X=1)=p
   echec =0 p(x=0)=1-p
n=nombre de fois quon fait lepreuve de bernou
p =proba davoir un succes pour une epreuve
ex 
on prend un pass paris 125 on veut savoir si ...
on definit le succes ... p(s)=
cette exp est une epreuve de B e parametre p=
on repete cette exp de maniere id et indep 125 fois
soit x la variable aleatoire qui compte ...
donc X suit la loi de bino de parametre ...

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.