Question

In the top-down recursive algorithm for computing binomial coefficients, the number of recursive calls required to compute the value of "40 choose 14" will in general be less than the value of 40!/(14! X (40 - 14)!) Question 16 Not yet answered Marked out of 7.00 P Flag question Select one: True False In the binomial expansion of (a+b)20 the coefficients of a7b13 and a13b7 are th same. Question 17 Not yet answered Marked out of 7.00 Select one: True P Flag question False

Answer 1

16 Fale . ncr Becalde, No. of fametion calls for fording will be don Cr 80, (anco-1) nCo false. so, It is is 17. True. And! b=3 Nz 20 a = 2 we have, nal the any xtyn 410) 20 Ciz bet's take then, In the expansion of Cortege ricon y tne, x yt ncn y the co-efficient of at 61² = nC,3 the co-efficent of a² 6² = nC 4 troue) 20 C7 2007 20 C 13 e 77520 = Ста nC mi)