Two-sided logarithm inequalityProving an inequality without an integral: $frac 1x+1leq ln (1+x)- ln (x) leq frac 1x$Is there a constant that reverses Jensen's inequality?Proof regarding Robin's inequality (RI).Normal pdf/cdf inequalityIs it possible to solve this equation with logarithms and exponents?How to find $logx$ close to exact value in two digits with these methods?Imprecise logarithms that reference sets of numbers.Taking complex logarithm of some multiplicative identitiesLogarithm and exponent of real quaternionsMulti-logarithm generalisation with multipliersWhy is this inequality about KL-divergence true?
How does the reference system of the Majjhima Nikaya work?
How will losing mobility of one hand affect my career as a programmer?
Bob has never been a M before
How can "mimic phobia" be cured or prevented?
Do the concepts of IP address and network interface not belong to the same layer?
Do Legal Documents Require Signing In Standard Pen Colors?
Divine apple island
Is there a conventional notation or name for the slip angle?
Drawing a topological "handle" with Tikz
Is a file system driver implemented using a kernel module in Linux?
Did US corporations pay demonstrators in the German demonstrations against article 13?
Is camera lens focus an exact point or a range?
What's the difference between 違法 and 不法?
How should I respond when I lied about my education and the company finds out through background check?
Can I sign legal documents with a smiley face?
Gibbs free energy in standard state vs. equilibrium
Hot bath for aluminium engine block and heads
Why did the HMS Bounty go back to a time when whales are already rare?
Global amount of publications over time
When quoting, must I also copy hyphens used to divide words that continue on the next line?
Is it possible to use .desktop files to open local pdf files on specific pages with a browser?
How can Trident be so inexpensive? Will it orbit Triton or just do a (slow) flyby?
Why has "pence" been used in this sentence, not "pences"?
How can I remove extra parentheses in a plot callout?
Two-sided logarithm inequality
Proving an inequality without an integral: $frac 1x+1leq ln (1+x)- ln (x) leq frac 1x$Is there a constant that reverses Jensen's inequality?Proof regarding Robin's inequality (RI).Normal pdf/cdf inequalityIs it possible to solve this equation with logarithms and exponents?How to find $logx$ close to exact value in two digits with these methods?Imprecise logarithms that reference sets of numbers.Taking complex logarithm of some multiplicative identitiesLogarithm and exponent of real quaternionsMulti-logarithm generalisation with multipliersWhy is this inequality about KL-divergence true?
$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( fracnn-1right)right)^-1 < n tag1 $$
I've verified this numerically, and it even seems to be the case that
$$ lim_n to infty frac1log left( n / (n - 1)right) = n - frac12 $$
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 frac1n tag2 $$
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( fracnn-1right)right)^-1 < n tag1 $$
I've verified this numerically, and it even seems to be the case that
$$ lim_n to infty frac1log left( n / (n - 1)right) = n - frac12 $$
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 frac1n tag2 $$
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 hours 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( fracnn-1right)right)^-1 < n tag1 $$
I've verified this numerically, and it even seems to be the case that
$$ lim_n to infty frac1log left( n / (n - 1)right) = n - frac12 $$
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 frac1n tag2 $$
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( fracnn-1right)right)^-1 < n tag1 $$
I've verified this numerically, and it even seems to be the case that
$$ lim_n to infty frac1log left( n / (n - 1)right) = n - frac12 $$
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 frac1n tag2 $$
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 1 hour ago
egreg
185k1486206
185k1486206
asked 2 hours ago
Enrico BorbaEnrico Borba
446139
446139
3
$begingroup$
Cf. this question
$endgroup$
– J. W. Tanner
2 hours ago
add a comment |
3
$begingroup$
Cf. this question
$endgroup$
– J. W. Tanner
2 hours ago
3
3
$begingroup$
Cf. this question
$endgroup$
– J. W. Tanner
2 hours ago
$begingroup$
Cf. this question
$endgroup$
– J. W. Tanner
2 hours ago
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Your inequality is equivalent to$$frac1n-1>logleft(frac nn-1right)>frac1n,$$which, in turn, is equivalent to$$frac1n-1>log(n)-log(n-1)>frac1n.$$Now, use the fact that$$log(n)-log(n-1)=int_n-1^nfracmathrm dtt.$$
$endgroup$
$begingroup$
Awesome hint. Thanks!
$endgroup$
– Enrico Borba
1 hour ago
$begingroup$
I'm glad I could help.
$endgroup$
– José Carlos Santos
1 hour ago
add a comment |
$begingroup$
Let's try with a reductio ad absurdum :
1 disequality
Suppose that for some $n$:
$$log^-1(fracnn-1)<n-1 $$
Notice that $log^-1(fracnn-1)=log_fracnn-1(e)$ so:
$log_fracnn-1(e)<n-1$
$(fracnn-1)^n-1>e$
Now $ n-1=x $:
$(1+frac1x)^x>e$
But this is absurd because $(1+frac1x)^x$ is strictly increasing and his limit is $e$.
2 disequality
As before:
$$log^-1(fracnn-1)>n $$
$log_fracnn-1(e)>n$
$(fracnn-1)^n<e$
And this is absurd because that function is strictly decreasing and his limit value is $e$
New contributor
Eureka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$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$$frac1n-1>logleft(frac nn-1right)>frac1n,$$which, in turn, is equivalent to$$frac1n-1>log(n)-log(n-1)>frac1n.$$Now, use the fact that$$log(n)-log(n-1)=int_n-1^nfracmathrm dtt.$$
$endgroup$
$begingroup$
Awesome hint. Thanks!
$endgroup$
– Enrico Borba
1 hour ago
$begingroup$
I'm glad I could help.
$endgroup$
– José Carlos Santos
1 hour ago
add a comment |
$begingroup$
Your inequality is equivalent to$$frac1n-1>logleft(frac nn-1right)>frac1n,$$which, in turn, is equivalent to$$frac1n-1>log(n)-log(n-1)>frac1n.$$Now, use the fact that$$log(n)-log(n-1)=int_n-1^nfracmathrm dtt.$$
$endgroup$
$begingroup$
Awesome hint. Thanks!
$endgroup$
– Enrico Borba
1 hour ago
$begingroup$
I'm glad I could help.
$endgroup$
– José Carlos Santos
1 hour ago
add a comment |
$begingroup$
Your inequality is equivalent to$$frac1n-1>logleft(frac nn-1right)>frac1n,$$which, in turn, is equivalent to$$frac1n-1>log(n)-log(n-1)>frac1n.$$Now, use the fact that$$log(n)-log(n-1)=int_n-1^nfracmathrm dtt.$$
$endgroup$
Your inequality is equivalent to$$frac1n-1>logleft(frac nn-1right)>frac1n,$$which, in turn, is equivalent to$$frac1n-1>log(n)-log(n-1)>frac1n.$$Now, use the fact that$$log(n)-log(n-1)=int_n-1^nfracmathrm dtt.$$
edited 1 hour ago
answered 2 hours ago
José Carlos SantosJosé Carlos Santos
170k23132238
170k23132238
$begingroup$
Awesome hint. Thanks!
$endgroup$
– Enrico Borba
1 hour ago
$begingroup$
I'm glad I could help.
$endgroup$
– José Carlos Santos
1 hour ago
add a comment |
$begingroup$
Awesome hint. Thanks!
$endgroup$
– Enrico Borba
1 hour ago
$begingroup$
I'm glad I could help.
$endgroup$
– José Carlos Santos
1 hour ago
$begingroup$
Awesome hint. Thanks!
$endgroup$
– Enrico Borba
1 hour ago
$begingroup$
Awesome hint. Thanks!
$endgroup$
– Enrico Borba
1 hour ago
$begingroup$
I'm glad I could help.
$endgroup$
– José Carlos Santos
1 hour ago
$begingroup$
I'm glad I could help.
$endgroup$
– José Carlos Santos
1 hour ago
add a comment |
$begingroup$
Let's try with a reductio ad absurdum :
1 disequality
Suppose that for some $n$:
$$log^-1(fracnn-1)<n-1 $$
Notice that $log^-1(fracnn-1)=log_fracnn-1(e)$ so:
$log_fracnn-1(e)<n-1$
$(fracnn-1)^n-1>e$
Now $ n-1=x $:
$(1+frac1x)^x>e$
But this is absurd because $(1+frac1x)^x$ is strictly increasing and his limit is $e$.
2 disequality
As before:
$$log^-1(fracnn-1)>n $$
$log_fracnn-1(e)>n$
$(fracnn-1)^n<e$
And this is absurd because that function is strictly decreasing and his limit value is $e$
New contributor
Eureka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
Let's try with a reductio ad absurdum :
1 disequality
Suppose that for some $n$:
$$log^-1(fracnn-1)<n-1 $$
Notice that $log^-1(fracnn-1)=log_fracnn-1(e)$ so:
$log_fracnn-1(e)<n-1$
$(fracnn-1)^n-1>e$
Now $ n-1=x $:
$(1+frac1x)^x>e$
But this is absurd because $(1+frac1x)^x$ is strictly increasing and his limit is $e$.
2 disequality
As before:
$$log^-1(fracnn-1)>n $$
$log_fracnn-1(e)>n$
$(fracnn-1)^n<e$
And this is absurd because that function is strictly decreasing and his limit value is $e$
New contributor
Eureka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
Let's try with a reductio ad absurdum :
1 disequality
Suppose that for some $n$:
$$log^-1(fracnn-1)<n-1 $$
Notice that $log^-1(fracnn-1)=log_fracnn-1(e)$ so:
$log_fracnn-1(e)<n-1$
$(fracnn-1)^n-1>e$
Now $ n-1=x $:
$(1+frac1x)^x>e$
But this is absurd because $(1+frac1x)^x$ is strictly increasing and his limit is $e$.
2 disequality
As before:
$$log^-1(fracnn-1)>n $$
$log_fracnn-1(e)>n$
$(fracnn-1)^n<e$
And this is absurd because that function is strictly decreasing and his limit value is $e$
New contributor
Eureka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
Let's try with a reductio ad absurdum :
1 disequality
Suppose that for some $n$:
$$log^-1(fracnn-1)<n-1 $$
Notice that $log^-1(fracnn-1)=log_fracnn-1(e)$ so:
$log_fracnn-1(e)<n-1$
$(fracnn-1)^n-1>e$
Now $ n-1=x $:
$(1+frac1x)^x>e$
But this is absurd because $(1+frac1x)^x$ is strictly increasing and his limit is $e$.
2 disequality
As before:
$$log^-1(fracnn-1)>n $$
$log_fracnn-1(e)>n$
$(fracnn-1)^n<e$
And this is absurd because that function is strictly decreasing and his limit value is $e$
New contributor
Eureka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Eureka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered 2 hours ago
EurekaEureka
1297
1297
New contributor
Eureka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Eureka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Eureka is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
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 hours ago