All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Beautiful recursion (Posted on 2019-09-03) Difficulty: 3 of 5
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: ( Back to comment list | You must be logged in to post comments.)
No Subject Comment 2 of 2 |
10? 
bullet force
  Posted by johanson scarlet on 2019-09-25 03:32:27
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

Chatterbox:
Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information