#Proving that Binomial coefficient is an integer
90 messages · Page 1 of 1 (latest)
YSG
you can look at the binomial coefficient through the lens of combinations
the 1/(n - k)! product just means that you're getting the first k products of n!
the 1/k! term just means you're excluding the number of ways to do something
this should nicely cancel out because getting the first k products of n! means getting a product that's an integer
still thinking about this though
I didn't really understand
20
I don't know what's this principle sorry
well you can do it like this
there are 3 spots
and there are 6 people
so you can also do it like this
after choosing a person, you have 5 people left to choose and after choosing another person, you have 4 people left to choose
this means 6x5x4
but at the same time you don't want repetition of the arrangements
yeah it's probably just called different in english
yeah we study in french
so divide by number of ways
or 3x2x1
you sometimes get like
p1 p2 p3
but here it doesn't matter the index because we didn't create any distinction
here p1 p2 p3 different from p2 p1 p3 and p3 p1 p2
yes
so the reasonable thing to do is just split it by dividing by number of ways
what is the 'number of ways'
yes
how do you calculate the number of ways ? I don't get this part
well you know how k is like
number of things you can put
say you have n
you want to put n things into k spots
that's 1/k! product in binomial coefficient
the 1/(n - k)! thing just gives us first k product of n
so say n = 6 and k = 3 just like last time
first 3 things of n is just 6x5x4
number of ways can be calculated just from 3!
because k = 3
oh okay
And just to be sure, in the 20 we found, we consider that p1 p2 p3 is different than p2 p3 p1 right ?
we consider both same because
we didn't make difference between p1 p2 p3 and p2 p3 p1
which is why we divide by number of ways
we only want one of them
i get it now
and 3! ways to arrange 3 indices
yesss
finally understood lol
and for example if i say i have 6 persons sitting at a table and I want to know how many ways are possible for them to sit ( like each time two of them exchange place that's a possible way) idk if I was clear
Can we use the binomial coefficient in this case ?
here's my answer I don't know if it's correct : I use the binomial coefficient and take n equals 6 and k also equals 6 but I dont divide by the k! so in the end I will get 6! as the answer
yes as long as two persons have no difference
you can use them for these problems
what do you mean by no difference ?
that would be called a permutation
but yeah
suppose you want to seat bob, alice and james in two seats
find number of ways to seat them
I guess i would use the binomial coeffcient : n equals 3 and k=2
because three of them are distinct you can't use it here
except if you multiply by number of ways to arrange three things in three spots
but it's no different from saying: we want to seat 3 people in two seats