GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
125 views
Given a integer N greater than zero.

How many sequences of 1's and 2's are there such that sum of the numbers in the sequence = N ?

(not necessary that every sequence must contain both 1 and 2 )

example :

for N = 2 ; 11,2 => ans = 2 sequences of 1's and 2's

for N = 3 ; 11,12,21 => ans = 3 sequences of 1's and 2's
asked in Combinatory by Veteran (47k points)  
retagged by | 125 views

1 Answer

+3 votes
Best answer

It is (N+1)th fibonacci number.

Observe the pattern: http://ideone.com/QLb1CZ

answered by Loyal (3k points)  
selected by
thanks this can be solved by dynamic as well as generating function or matrix exponentiation. similar to domino tiling
Yes, the recurrence relation is $F(0) = 1$, $F(1) = 1$ and $F(n) = F(n-1) + F(n-2)$, $\forall$ $n$ $\geq$ $2$.
@Air1. Hats off bro for you thought about the recurrance :)
The chapter on generating function from concrete mathematics, well described for this kind of problem.


Top Users May 2017
  1. akash.dinkar12

    3338 Points

  2. pawan kumarln

    2108 Points

  3. Bikram

    1922 Points

  4. sh!va

    1682 Points

  5. Arjun

    1614 Points

  6. Devshree Dubey

    1272 Points

  7. Debashish Deka

    1208 Points

  8. Angkit

    1056 Points

  9. LeenSharma

    1018 Points

  10. Arnab Bhadra

    812 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 22 - 28
  1. Bikram

    1008 Points

  2. pawan kumarln

    734 Points

  3. Arnab Bhadra

    726 Points

  4. Arjun

    342 Points

  5. bharti

    328 Points


22,893 questions
29,196 answers
65,302 comments
27,695 users