perplexus.info :: Just Math : Beautiful recursion

Beautiful recursion (Posted on 2019-09-03)

A function is defined recursively by f(0) = 0 and f(n) = n - f(f(n - 1)) for n > 0. Find f(10,000,000,000).

No Solution Yet Submitted by Danish Ahmed Khan

No Rating

Comments: ( You must be logged in to post comments.)

Subject	Author	Date
No Subject	johanson scarlet	2019-09-25 03:32:27
computer observation and solution	Charlie	2019-09-03 11:14:16

Please log in:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info