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 <[email protected]> wrote: > how do u come to this formula T(n)=fib(n+2).. plz explain > > > On 7 June 2010 21:19, saurabh gupta <[email protected]> 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 series >> which is interesting. >> >> >> On Sat, Jun 5, 2010 at 11:40 AM, Raj N <[email protected]> wrote: >> >>> @sharad: What about 101 even it doesn't have two 1's in a row >>> >>> >>> On Sat, Jun 5, 2010 at 8:59 AM, sharad kumar <[email protected]>wrote: >>> >>>> @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 <[email protected]> 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 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 understanding it. >>>>> Thanks!! >>>>> >>>>> -- >>>>> You received this message because you are subscribed to the Google >>>>> Groups "Algorithm Geeks" group. >>>>> To post to this group, send email to [email protected]. >>>>> To unsubscribe from this group, send email to >>>>> [email protected]<algogeeks%[email protected]> >>>>> . >>>>> For more options, visit this group at >>>>> http://groups.google.com/group/algogeeks?hl=en. >>>>> >>>>> >>>> >>>> >>>> -- >>>> yezhu malai vaasa venkataramana Govinda Govinda >>>> >>>> -- >>>> You received this message because you are subscribed to the Google >>>> Groups "Algorithm Geeks" group. >>>> To post to this group, send email to [email protected]. >>>> To unsubscribe from this group, send email to >>>> [email protected]<algogeeks%[email protected]> >>>> . >>>> For more options, visit this group at >>>> http://groups.google.com/group/algogeeks?hl=en. >>>> >>> >>> -- >>> You received this message because you are subscribed to the Google Groups >>> "Algorithm Geeks" group. >>> To post to this group, send email to [email protected]. >>> To unsubscribe from this group, send email to >>> [email protected]<algogeeks%[email protected]> >>> . >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >> >> >> >> -- >> Man goes to doctor. Says he's depressed. Says life seems harsh and cruel. >> Says he feels all alone in a threatening world where what lies ahead is >> vague and uncertain. Doctor says "Treatment is simple. Great clown >> Pagliacci is in town tonight. Go and see him. That should pick you up." >> Man >> bursts into tears. Says "But, doctor...I am Pagliacci." >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]<algogeeks%[email protected]> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
