Hi,
try to see the problem in a different way; choosing 3 students from a group
of 7. This is a simpler point of view. Then let the other 4 students make
another group of size 4.
I recommend Revolving Door algorithm to find C(7,3), which is covered at
Knuth's TAOCP pre-fascicle 3a. There are also
Hello all,
I have a recurrence relation of the form
T(n) = T(n-2^log n) + O(n) --- how do i solve such a recurrence
relation ?
I have tried an approach for this. Is this right ? ---
let kn = n-2^log n hence k ranges from 0 < k < [(2^log n -
2^log(n-1))/2n]
ie 0 < k < [2^(log n - 2)]
Let's say I have 7 students and I would like to find out how many
different ways I can arrange them in two groups, one of size 3 and one
of size 4. The answer is simple, using binomial coefficient we can
compute:
7 choose 4 = (7 / 4) = 35
and
7 choose 3 = (7 / 3) = 35
Now, I would like to print
