Hmmm. The first few Fibonacci numbers are 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ... Of these, 3, 13, and 55 have binary representations with two 1-bits in a row. And 9, 10, 17, 18, etc are not included. So what was your question?
Dave On Jun 7, 9:28 pm, Rohit Saraf <rohit.kumar.sa...@gmail.com> wrote: > So u want efficient algo for fibonacci numbers? > > -- > -------------------------------------------------- > Rohit Saraf > Second Year Undergraduate, > Dept. of Computer Science and Engineering > IIT Bombayhttp://www.cse.iitb.ac.in/~rohitfeb14 -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
