Hi everybody!. I am looking for some websites like this site that have problem and solution (if consist dowloadable books are better!). Can you help me!
Please help me solve this problem please (sorry for not being of Volume 1): As we know about Fibonacci number: F[n]=F[n-1]+f[n-2]; Now: Enter a number S (S can have 200 digits, this is the dificulty!). Problem: Let present S equivalant sum of leaset numbers of Fibanacci. Hope you respond as soon ...