p2.py

Created on March 22, 2022

341 Bytes

from maths import*

propriété ensemble de parties 
d'un ensemble 

Le nbr de parties de E est 2^n 

PREUVE 

Soit E={e1;e2;...;en} card(E)=n

On associe à chaque partie de E un
n-uplet de [0,1]

S={e2;e4;e5} -> (0;1;0;1;1;0...0)
(0;0;0;0;1;1;0;...;1)->S2={e5;e6;en}

ainsi il y a n-uplets que de partie
de E donc card(P(E))=2^n

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

Ensure the proper functioning of the site (essential cookies); and
Track your browsing to send you personalized communications if you have created a professional account on the site and can be contacted (audience measurement cookies).

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