F(0)+F(2)+...+F(2n) = F(2n+1) - 1
Wladimir Araujo Tavares *Federal University of Ceará <http://lia.ufc.br/%7Ewladimir/> Homepage <http://lia.ufc.br/%7Ewladimir/> | Maratona<https://sites.google.com/site/quixadamaratona/>| * On Sat, Oct 1, 2011 at 1:40 PM, rahul sharma <[email protected]>wrote: > nyone provide me with recursive sol of the following prob..... > > > find the sum of all even nos. in the fibbonacci series upto 1000....thnx in > davance > > -- > 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. > -- 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.
