GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
114 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 (36k points)  
retagged by | 114 views

1 Answer

+3 votes
Best answer

It is (N+1)th fibonacci number.

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

answered by Loyal (2.9k 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 Jan 2017
  1. Debashish Deka

    8126 Points

  2. sudsho

    5042 Points

  3. Habibkhan

    4706 Points

  4. Vijay Thakur

    4458 Points

  5. Bikram

    4348 Points

  6. saurabh rai

    4212 Points

  7. Arjun

    4010 Points

  8. santhoshdevulapally

    3722 Points

  9. GateSet

    3292 Points

  10. Sushant Gokhale

    3286 Points

Monthly Topper: Rs. 500 gift card

19,122 questions
24,033 answers
52,725 comments
20,276 users