Two-sided logarithm inequality
$begingroup$
I couldn't find a duplicate question, so I apologize if this has been asked before.
I'm trying to show that
$$ n - 1 < left(log left( frac{n}{n-1}right)right)^{-1} < n tag{1} $$
I've verified this numerically, and it even seems to be the case that
$$ lim_{n to infty} frac{1}{log left( n / (n - 1)right)} = n - frac{1}{2} $$
Again, I've only verified the two statements above numerically, and I'm having a hard time proving them. The inequality seems to make some intuitive sense since, if you consider a logarithm as counting the number of digits in base $e$ then
$$ log(n) - log(n - 1) sim frac{1}{n} tag{2} $$
However, (2) is only a hunch and I'm not sure how to formalize it. I'm wondering how do I prove the inequality (1)?.
Hints are definitely welcome.
limits inequality logarithms
$endgroup$
add a comment |
$begingroup$
I couldn't find a duplicate question, so I apologize if this has been asked before.
I'm trying to show that
$$ n - 1 < left(log left( frac{n}{n-1}right)right)^{-1} < n tag{1} $$
I've verified this numerically, and it even seems to be the case that
$$ lim_{n to infty} frac{1}{log left( n / (n - 1)right)} = n - frac{1}{2} $$
Again, I've only verified the two statements above numerically, and I'm having a hard time proving them. The inequality seems to make some intuitive sense since, if you consider a logarithm as counting the number of digits in base $e$ then
$$ log(n) - log(n - 1) sim frac{1}{n} tag{2} $$
However, (2) is only a hunch and I'm not sure how to formalize it. I'm wondering how do I prove the inequality (1)?.
Hints are definitely welcome.
limits inequality logarithms
$endgroup$
3
$begingroup$
Cf. this question
$endgroup$
– J. W. Tanner
2 days ago
add a comment |
$begingroup$
I couldn't find a duplicate question, so I apologize if this has been asked before.
I'm trying to show that
$$ n - 1 < left(log left( frac{n}{n-1}right)right)^{-1} < n tag{1} $$
I've verified this numerically, and it even seems to be the case that
$$ lim_{n to infty} frac{1}{log left( n / (n - 1)right)} = n - frac{1}{2} $$
Again, I've only verified the two statements above numerically, and I'm having a hard time proving them. The inequality seems to make some intuitive sense since, if you consider a logarithm as counting the number of digits in base $e$ then
$$ log(n) - log(n - 1) sim frac{1}{n} tag{2} $$
However, (2) is only a hunch and I'm not sure how to formalize it. I'm wondering how do I prove the inequality (1)?.
Hints are definitely welcome.
limits inequality logarithms
$endgroup$
I couldn't find a duplicate question, so I apologize if this has been asked before.
I'm trying to show that
$$ n - 1 < left(log left( frac{n}{n-1}right)right)^{-1} < n tag{1} $$
I've verified this numerically, and it even seems to be the case that
$$ lim_{n to infty} frac{1}{log left( n / (n - 1)right)} = n - frac{1}{2} $$
Again, I've only verified the two statements above numerically, and I'm having a hard time proving them. The inequality seems to make some intuitive sense since, if you consider a logarithm as counting the number of digits in base $e$ then
$$ log(n) - log(n - 1) sim frac{1}{n} tag{2} $$
However, (2) is only a hunch and I'm not sure how to formalize it. I'm wondering how do I prove the inequality (1)?.
Hints are definitely welcome.
limits inequality logarithms
limits inequality logarithms
edited 2 days ago
egreg
185k1486206
185k1486206
asked 2 days ago
Enrico BorbaEnrico Borba
451139
451139
3
$begingroup$
Cf. this question
$endgroup$
– J. W. Tanner
2 days ago
add a comment |
3
$begingroup$
Cf. this question
$endgroup$
– J. W. Tanner
2 days ago
3
3
$begingroup$
Cf. this question
$endgroup$
– J. W. Tanner
2 days ago
$begingroup$
Cf. this question
$endgroup$
– J. W. Tanner
2 days ago
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Your inequality is equivalent to$$frac1{n-1}>logleft(frac n{n-1}right)>frac1n,$$which, in turn, is equivalent to$$frac1{n-1}>log(n)-log(n-1)>frac1n.$$Now, use the fact that$$log(n)-log(n-1)=int_{n-1}^nfrac{mathrm dt}t.$$
$endgroup$
$begingroup$
Awesome hint. Thanks!
$endgroup$
– Enrico Borba
2 days ago
$begingroup$
I'm glad I could help.
$endgroup$
– José Carlos Santos
2 days ago
add a comment |
$begingroup$
Let's try with a reductio ad absurdum :
1 disequality
Suppose that for some $n$:
$$log^{-1}(frac{n}{n-1})<n-1 $$
Notice that $log^{-1}(frac{n}{n-1})=log_{frac{n}{n-1}}(e)$ so:
$log_{frac{n}{n-1}}(e)<n-1$
$(frac{n}{n-1})^{n-1}>e$
Now $ n-1=x $:
$(1+frac{1}{x})^{x}>e$
But this is absurd because $(1+frac{1}{x})^{x}$ is strictly increasing and his limit is $e$.
2 disequality
As before:
$$log^{-1}(frac{n}{n-1})>n $$
$log_{frac{n}{n-1}}(e)>n$
$(frac{n}{n-1})^{n}<e$
And this is absurd because that function is strictly decreasing and his limit value is $e$
New contributor
$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%2f3160970%2ftwo-sided-logarithm-inequality%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$
Your inequality is equivalent to$$frac1{n-1}>logleft(frac n{n-1}right)>frac1n,$$which, in turn, is equivalent to$$frac1{n-1}>log(n)-log(n-1)>frac1n.$$Now, use the fact that$$log(n)-log(n-1)=int_{n-1}^nfrac{mathrm dt}t.$$
$endgroup$
$begingroup$
Awesome hint. Thanks!
$endgroup$
– Enrico Borba
2 days ago
$begingroup$
I'm glad I could help.
$endgroup$
– José Carlos Santos
2 days ago
add a comment |
$begingroup$
Your inequality is equivalent to$$frac1{n-1}>logleft(frac n{n-1}right)>frac1n,$$which, in turn, is equivalent to$$frac1{n-1}>log(n)-log(n-1)>frac1n.$$Now, use the fact that$$log(n)-log(n-1)=int_{n-1}^nfrac{mathrm dt}t.$$
$endgroup$
$begingroup$
Awesome hint. Thanks!
$endgroup$
– Enrico Borba
2 days ago
$begingroup$
I'm glad I could help.
$endgroup$
– José Carlos Santos
2 days ago
add a comment |
$begingroup$
Your inequality is equivalent to$$frac1{n-1}>logleft(frac n{n-1}right)>frac1n,$$which, in turn, is equivalent to$$frac1{n-1}>log(n)-log(n-1)>frac1n.$$Now, use the fact that$$log(n)-log(n-1)=int_{n-1}^nfrac{mathrm dt}t.$$
$endgroup$
Your inequality is equivalent to$$frac1{n-1}>logleft(frac n{n-1}right)>frac1n,$$which, in turn, is equivalent to$$frac1{n-1}>log(n)-log(n-1)>frac1n.$$Now, use the fact that$$log(n)-log(n-1)=int_{n-1}^nfrac{mathrm dt}t.$$
edited 2 days ago
answered 2 days ago
José Carlos SantosJosé Carlos Santos
170k23132238
170k23132238
$begingroup$
Awesome hint. Thanks!
$endgroup$
– Enrico Borba
2 days ago
$begingroup$
I'm glad I could help.
$endgroup$
– José Carlos Santos
2 days ago
add a comment |
$begingroup$
Awesome hint. Thanks!
$endgroup$
– Enrico Borba
2 days ago
$begingroup$
I'm glad I could help.
$endgroup$
– José Carlos Santos
2 days ago
$begingroup$
Awesome hint. Thanks!
$endgroup$
– Enrico Borba
2 days ago
$begingroup$
Awesome hint. Thanks!
$endgroup$
– Enrico Borba
2 days ago
$begingroup$
I'm glad I could help.
$endgroup$
– José Carlos Santos
2 days ago
$begingroup$
I'm glad I could help.
$endgroup$
– José Carlos Santos
2 days ago
add a comment |
$begingroup$
Let's try with a reductio ad absurdum :
1 disequality
Suppose that for some $n$:
$$log^{-1}(frac{n}{n-1})<n-1 $$
Notice that $log^{-1}(frac{n}{n-1})=log_{frac{n}{n-1}}(e)$ so:
$log_{frac{n}{n-1}}(e)<n-1$
$(frac{n}{n-1})^{n-1}>e$
Now $ n-1=x $:
$(1+frac{1}{x})^{x}>e$
But this is absurd because $(1+frac{1}{x})^{x}$ is strictly increasing and his limit is $e$.
2 disequality
As before:
$$log^{-1}(frac{n}{n-1})>n $$
$log_{frac{n}{n-1}}(e)>n$
$(frac{n}{n-1})^{n}<e$
And this is absurd because that function is strictly decreasing and his limit value is $e$
New contributor
$endgroup$
add a comment |
$begingroup$
Let's try with a reductio ad absurdum :
1 disequality
Suppose that for some $n$:
$$log^{-1}(frac{n}{n-1})<n-1 $$
Notice that $log^{-1}(frac{n}{n-1})=log_{frac{n}{n-1}}(e)$ so:
$log_{frac{n}{n-1}}(e)<n-1$
$(frac{n}{n-1})^{n-1}>e$
Now $ n-1=x $:
$(1+frac{1}{x})^{x}>e$
But this is absurd because $(1+frac{1}{x})^{x}$ is strictly increasing and his limit is $e$.
2 disequality
As before:
$$log^{-1}(frac{n}{n-1})>n $$
$log_{frac{n}{n-1}}(e)>n$
$(frac{n}{n-1})^{n}<e$
And this is absurd because that function is strictly decreasing and his limit value is $e$
New contributor
$endgroup$
add a comment |
$begingroup$
Let's try with a reductio ad absurdum :
1 disequality
Suppose that for some $n$:
$$log^{-1}(frac{n}{n-1})<n-1 $$
Notice that $log^{-1}(frac{n}{n-1})=log_{frac{n}{n-1}}(e)$ so:
$log_{frac{n}{n-1}}(e)<n-1$
$(frac{n}{n-1})^{n-1}>e$
Now $ n-1=x $:
$(1+frac{1}{x})^{x}>e$
But this is absurd because $(1+frac{1}{x})^{x}$ is strictly increasing and his limit is $e$.
2 disequality
As before:
$$log^{-1}(frac{n}{n-1})>n $$
$log_{frac{n}{n-1}}(e)>n$
$(frac{n}{n-1})^{n}<e$
And this is absurd because that function is strictly decreasing and his limit value is $e$
New contributor
$endgroup$
Let's try with a reductio ad absurdum :
1 disequality
Suppose that for some $n$:
$$log^{-1}(frac{n}{n-1})<n-1 $$
Notice that $log^{-1}(frac{n}{n-1})=log_{frac{n}{n-1}}(e)$ so:
$log_{frac{n}{n-1}}(e)<n-1$
$(frac{n}{n-1})^{n-1}>e$
Now $ n-1=x $:
$(1+frac{1}{x})^{x}>e$
But this is absurd because $(1+frac{1}{x})^{x}$ is strictly increasing and his limit is $e$.
2 disequality
As before:
$$log^{-1}(frac{n}{n-1})>n $$
$log_{frac{n}{n-1}}(e)>n$
$(frac{n}{n-1})^{n}<e$
And this is absurd because that function is strictly decreasing and his limit value is $e$
New contributor
New contributor
answered 2 days ago
EurekaEureka
21611
21611
New contributor
New contributor
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%2f3160970%2ftwo-sided-logarithm-inequality%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
3
$begingroup$
Cf. this question
$endgroup$
– J. W. Tanner
2 days ago