Home > Numbers
Recursive reaches one million (Posted on 20190815) 

Define a function f mapping positive integers to positive integers by f(1)=1, and f(n)=f(n1)+n if f(n1)<=n
and f(n)=f(n1)n if f(n1)>n
For n≥2,
i) Find the smallest integer n such that f(n) = 1,000,000
ii) Find the smallest integer n such that f(n) = 2,000,000
Comments: (
You must be logged in to post comments.)


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:
