vdirectioner234 vdirectioner234
  • 03-08-2018
  • Mathematics
contestada

Let f(n) be the number of subsets of {1,2,...,n} that contain no two consecutive elements. Find the recurrence relation satisfied by f(n).

Respuesta :

konrad509
konrad509 konrad509
  • 03-08-2018

[tex] f(1)=1\\
f(n)=f(n-1)+n-1} [/tex]

Answer Link

Otras preguntas

How do i solve this?
The continents of Africa and South America used to "for together" like puzzle pieces. About how far back in time would you have to go to find Africa and South A
Currently, Puerto Rico is a commonwealth. What are three options for the future political status of Puerto Rico
Describe the FITT training principles
The angle turns through 1-9 of the circle
I always order the same dessert—lemon meringue pie.
Why would minerals take millions of years to form? Explain please. If you do, you will be the brainliest with an extra 18 points.
10,000 times 0.95answer
Is X=15 an algebraic expression?
Round 0.1528125 for the answer