Determine all functions $f : mathbb{N} rightarrow mathbb{N}$ such that, for every positive integer $n$, we...
$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
discrete-mathematics contest-math problem-solving functional-equations functional-inequalities
edited Dec 11 '18 at 19:27
Batominovski
1
asked Nov 26 '18 at 2:28
nafhgoodnafhgood
1,801422
$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.
add a comment |
$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
discrete-mathematics contest-math problem-solving functional-equations functional-inequalities
edited Dec 11 '18 at 19:27
Batominovski
1
asked Nov 26 '18 at 2:28
nafhgoodnafhgood
1,801422
$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
add a comment |
$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
discrete-mathematics contest-math problem-solving functional-equations functional-inequalities
edited Dec 11 '18 at 19:27
Batominovski
1
asked Nov 26 '18 at 2:28
nafhgoodnafhgood
1,801422
$endgroup$
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
discrete-mathematics contest-math problem-solving functional-equations functional-inequalities
discrete-mathematics contest-math problem-solving functional-equations functional-inequalities
edited Dec 11 '18 at 19:27
Batominovski
1
asked Nov 26 '18 at 2:28
nafhgoodnafhgood
1,801422
edited Dec 11 '18 at 19:27
Batominovski
1
asked Nov 26 '18 at 2:28
nafhgoodnafhgood
1,801422
edited Dec 11 '18 at 19:27
Batominovski
1
edited Dec 11 '18 at 19:27
Batominovski
1
edited Dec 11 '18 at 19:27
Batominovski
1
1
asked Nov 26 '18 at 2:28
nafhgoodnafhgood
1,801422
asked Nov 26 '18 at 2:28
nafhgoodnafhgood
1,801422
asked Nov 26 '18 at 2:28
nafhgoodnafhgood
1,801422
1,801422
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.
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
add a comment |
$begingroup$
Please credit the original source.
$endgroup$
– Apass.Jack
Nov 26 '18 at 3:59
$begingroup$
Please credit the original source.
$endgroup$
– Apass.Jack
Nov 26 '18 at 3:59
$begingroup$
Please credit the original source.
$endgroup$
– Apass.Jack
Nov 26 '18 at 3:59
add a comment |
2 Answers
2
active
oldest
votes
$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.
answered Nov 26 '18 at 8:18
gnasher729gnasher729
5,9871028
$endgroup$
add a comment |
$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
answered Nov 26 '18 at 8:41
Sorin TircSorin Tirc
1,530213
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3014034%2fdetermine-all-functions-f-mathbbn-rightarrow-mathbbn-such-that-for-e%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$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.
answered Nov 26 '18 at 8:18
gnasher729gnasher729
5,9871028
$endgroup$
add a comment |
$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.
answered Nov 26 '18 at 8:18
gnasher729gnasher729
5,9871028
$endgroup$
add a comment |
$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.
answered Nov 26 '18 at 8:18
gnasher729gnasher729
5,9871028
$endgroup$
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.
answered Nov 26 '18 at 8:18
gnasher729gnasher729
5,9871028
answered Nov 26 '18 at 8:18
gnasher729gnasher729
5,9871028
answered Nov 26 '18 at 8:18
gnasher729gnasher729
5,9871028
answered Nov 26 '18 at 8:18
gnasher729gnasher729
5,9871028
5,9871028
add a comment |
add a comment |
$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
answered Nov 26 '18 at 8:41
Sorin TircSorin Tirc
1,530213
$endgroup$
add a comment |
$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
answered Nov 26 '18 at 8:41
Sorin TircSorin Tirc
1,530213
$endgroup$
add a comment |
$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
answered Nov 26 '18 at 8:41
Sorin TircSorin Tirc
1,530213
$endgroup$
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
answered Nov 26 '18 at 8:41
Sorin TircSorin Tirc
1,530213
answered Nov 26 '18 at 8:41
Sorin TircSorin Tirc
1,530213
answered Nov 26 '18 at 8:41
Sorin TircSorin Tirc
1,530213
answered Nov 26 '18 at 8:41
Sorin TircSorin Tirc
1,530213
1,530213
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3014034%2fdetermine-all-functions-f-mathbbn-rightarrow-mathbbn-such-that-for-e%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Please credit the original source.
$endgroup$
– Apass.Jack
Nov 26 '18 at 3:59