@saurabh: Hey u're right this is interesting. I checked for n=5 its giving
13 i.e fib(7)
On Mon, Jun 7, 2010 at 9:19 PM, saurabh gupta sgup...@gmail.com wrote:
it might be referring to no of sequences (say T(n) ) with no consecutive
1's
for n = 3, ans would be 5 viz.
000, 001, 010, 100, 101
how do u come to this formula T(n)=fib(n+2).. plz explain
On 7 June 2010 21:19, saurabh gupta sgup...@gmail.com wrote:
it might be referring to no of sequences (say T(n) ) with no consecutive
1's
for n = 3, ans would be 5 viz.
000, 001, 010, 100, 101
T(n) = fib(n+2)
where fib = Fibonacci
I just checked out with so many possibilities and it is indeed matching. I
may not be correct though.
On Tue, Jun 8, 2010 at 7:50 PM, divya jain sweetdivya@gmail.com wrote:
how do u come to this formula T(n)=fib(n+2).. plz explain
On 7 June 2010 21:19, saurabh gupta sgup...@gmail.com
I found a nice explanation (from some other site) on how to get this formula
T(n) = fib(n+2).
Consider the set of all binary numbers of length n that end with 0. The
first n-1 positions can be anything (0 or 1). So if we take the set of all
binary numbers of length n-1 and append 0 to each of
recursion.
for length n if the count is T(n) then
T(n)
= 1st digit 0 + 1st digit 1
= T(n-1) + 1st digit 1 2nd digit 0
= T(n-1) + T(n-2)
QED.
On Tue, Jun 8, 2010 at 9:03 PM, Raj N rajn...@gmail.com wrote:
I just checked out with so many possibilities and it is indeed matching. I
may not be
it might be referring to no of sequences (say T(n) ) with no consecutive 1's
for n = 3, ans would be 5 viz.
000, 001, 010, 100, 101
T(n) = fib(n+2)
where fib = Fibonacci series
which is interesting.
On Sat, Jun 5, 2010 at 11:40 AM, Raj N rajn...@gmail.com wrote:
@sharad: What about 101 even
Hi,
I came across this question to find the number of sequences of n
binary digits that don't contain 2 1's in a row. I wanted to know what
exactly this means. Is it like if n=3 then compute all binary numbers
having 3 digits which don't have consecutive 1's 110, 011, 111 ??
If not help me
@rajn.can it be subsequence doesnt have one's too.hence 000,001,010,100 is
required answer.
On Sat, Jun 5, 2010 at 12:13 AM, Raj N rajn...@gmail.com wrote:
Hi,
I came across this question to find the number of sequences of n
binary digits that don't contain 2 1's in a row. I wanted to know
