Sujet : Re: (1 Combination 2) = 0 -- Better explanation?
De : ben (at) *nospam* bsb.me.uk (Ben Bacarisse)
Groupes : comp.lang.python sci.math sci.langDate : 16. Jul 2024, 12:35:33
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <87sew9in7e.fsf@bsb.me.uk>
References : 1
User-Agent : Gnus/5.13 (Gnus v5.13)
HenHanna <
HenHanna@devnull.tb> writes:
Python says: (1 Combination 2) = 0
Ok... It's Impossible (to do).
------- is there a Better explanation?
JB has given you an explanation to do with generalising the algebraic
equations, but there are also simple explanations from first principles.
(5 Combination 0) = 1 <---- This is explained by Comb(5,0)=Comb(5,5)
in general: Comb(N,r)=Comb(N,N-r)
I'll write |[5,0]| for this. In general |[n,m]| is the number of
m-element subsets of a typical set of n elements. So how many
zero-element subsets of such a set are there? Just 1. |[n,0]| = 1.
And how many 2-element subsets of a 1-element set are there? 0, so
|[1,2]| = 0.
-- Ben.