combinatoire.py

Created by anaali

Created on February 11, 2024

389 Bytes

# Type your text here
résultat ordonné?
* oui 
  repetition?
  -oui 
    code cadena 
    card(E**k)=n**k
  -non
    arrangement (k-uplet)
    classement
    Akn = (n!)/(n-k)!
        =n(n-1)(n-2)...(n-(k-1))
* non 
  (n k)= Akn /k!
      = n!/k!(n-k)!

card (P(E))=2**n
relation de Pascal:
  (n k)= (n-1 k)+(n-1 k-1)
Triangle pascal:
(n 0)+(n 1)+.+(n n-1)+(n n)=2**