5
$\begingroup$

Determine all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that, for every positive integer $n$, we have: $$2n+2001≤f(f(n))+f(n)≤2n+2002\,.$$

I don't know where to start as in is there a function that I can get to the solution by slightly modifying it? Any ideas

$\endgroup$

migrated from cs.stackexchange.com Nov 26 '18 at 8:26

This question came from our site for students, researchers and practitioners of computer science.

  • $\begingroup$ Please credit the original source. $\endgroup$ – Apass.Jack Nov 26 '18 at 3:59
0
$\begingroup$

How to start: You might start for example by checking what f(0) might be. Is f(0) = 0 possible, and if not, why not? If f(0) = 1, what can we then say about f(1)? What can we then say about f(2000) or f(2001)? Get a feeling for the problem. That's how you start.

$\endgroup$
0
$\begingroup$

Very old problem from the 2002 Balkan Mathematical Olympiad. You have to keep on iterating f(f(f(...(f(n)...))) and see what inequalities you get, see e.g.

https://artofproblemsolving.com/community/c6h76767

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.