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

at what phase of mitosis does the number of chromosomes double
Which nations are run by a prime minister? Canada Greenland Mexico U.S
What is pennies ,how much is dimes and what is nickels???
on friday night, john ate pizza for dinner and had 1/2 of the pizza left over. on saturday, he ate 1/3 of what was left. how much pizza did john eat on sunday?
besides hard and soft list two other that cold be used to divide nonliving things into two groups
Factor completely 49x2 − 81. a. (7x 9)2 b. (7x − 9)2 c. (7x 9)(7x − 9) d. 7x − 9
What do parrotfish eat?
HELP IN THIS QUESTION
which subordinating conjunction completes the complex sentence correctly?__ i sit down to eat dinner,the phone rings.a. wheneverb. althoughc. ifd. because
Who was the first to write about the connection between economic growth and capitalism? a. karl marx b. thomas malthus c. adam smith d. eugene debs