[VA] SRC #012c - Then and Now: Sum

[John Keith]

(11-30-2022 07:01 PM)Valentin Albillo Wrote:  .

John Keith Wrote:it's really quite a complex and interesting series. Being recursive it can take some time to compute for larger numbers [...]

Not really, unless the numbers are humongously large. For instance, f(1,000,000,000) needs only the initial call and 4 recursive calls, if I counted'em right.

John Keith Wrote:This is still basically brute force and I don't have a complete program ready yet but at least the germ of an idea.

Good. Do persevere and post your completed program when ready, please. Remember: post code (no panels), sample run, result, timing and comments if at all possible.


Best regards.
V.

Unfortunately my program was just a brute force one and as many have found, brute force is a dead end for this challenge. After summing 2^17 terms and seeing no convergence, it was obvious that I was getting nowhere. I was never anywhere near an analytical solution such as Werner's. Also as you mentioned, the recursion did not turn out to be a problem. It was an interesting and enjoyable challenge, though. Maybe next time...