1. Math
  2. Advanced Math
  3. solve 12 by using 11 find the recurrence and find...

Question: solve 12 by using 11 find the recurrence and find...

Question details

11. Let f(n) be the number of subsets of Inl that contain no two consecu- tive elements, for integer n. Find the recurrence that is satisfied by these numbers, and then find the numbers themselves 12. For given integers n, k, let f(n, k) be the number of k-subsets of [n] that contain no two consecutive elements. Find the recurrenco that is satisfied by these numbers, find a suitable gencrating function and find the num- bers themselves. Show the numerical values of f (n, k) in a Pascal triangle arrangement, for ns6.

solve 12 by using 11 find the recurrence and find genrating function and the numbers themselves .show the numerical values .

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution