Inequality $n^{sqrt{n+2}}>(n+1)^{sqrt{n+1}}$ solution

Multi tool use
$begingroup$
How to find the solution of inequality
$$n^{sqrt{n+2}}>(n+1)^{sqrt{n+1}}$$
for integers with basic analysis without derivatives.
I don't have any idea how to start with it.
inequality
$endgroup$
add a comment |
$begingroup$
How to find the solution of inequality
$$n^{sqrt{n+2}}>(n+1)^{sqrt{n+1}}$$
for integers with basic analysis without derivatives.
I don't have any idea how to start with it.
inequality
$endgroup$
$begingroup$
This is not true for $n=1$
$endgroup$
– Bo5man
Dec 18 '18 at 21:38
$begingroup$
@Bo5man I'm looking for the integer from what it's true
$endgroup$
– avan1235
Dec 18 '18 at 21:42
$begingroup$
From the statement I could not interpret that. Thanks for clarifying.
$endgroup$
– Bo5man
Dec 18 '18 at 21:47
add a comment |
$begingroup$
How to find the solution of inequality
$$n^{sqrt{n+2}}>(n+1)^{sqrt{n+1}}$$
for integers with basic analysis without derivatives.
I don't have any idea how to start with it.
inequality
$endgroup$
How to find the solution of inequality
$$n^{sqrt{n+2}}>(n+1)^{sqrt{n+1}}$$
for integers with basic analysis without derivatives.
I don't have any idea how to start with it.
inequality
inequality
edited Dec 18 '18 at 21:53
avan1235
asked Dec 18 '18 at 21:26
avan1235avan1235
3297
3297
$begingroup$
This is not true for $n=1$
$endgroup$
– Bo5man
Dec 18 '18 at 21:38
$begingroup$
@Bo5man I'm looking for the integer from what it's true
$endgroup$
– avan1235
Dec 18 '18 at 21:42
$begingroup$
From the statement I could not interpret that. Thanks for clarifying.
$endgroup$
– Bo5man
Dec 18 '18 at 21:47
add a comment |
$begingroup$
This is not true for $n=1$
$endgroup$
– Bo5man
Dec 18 '18 at 21:38
$begingroup$
@Bo5man I'm looking for the integer from what it's true
$endgroup$
– avan1235
Dec 18 '18 at 21:42
$begingroup$
From the statement I could not interpret that. Thanks for clarifying.
$endgroup$
– Bo5man
Dec 18 '18 at 21:47
$begingroup$
This is not true for $n=1$
$endgroup$
– Bo5man
Dec 18 '18 at 21:38
$begingroup$
This is not true for $n=1$
$endgroup$
– Bo5man
Dec 18 '18 at 21:38
$begingroup$
@Bo5man I'm looking for the integer from what it's true
$endgroup$
– avan1235
Dec 18 '18 at 21:42
$begingroup$
@Bo5man I'm looking for the integer from what it's true
$endgroup$
– avan1235
Dec 18 '18 at 21:42
$begingroup$
From the statement I could not interpret that. Thanks for clarifying.
$endgroup$
– Bo5man
Dec 18 '18 at 21:47
$begingroup$
From the statement I could not interpret that. Thanks for clarifying.
$endgroup$
– Bo5man
Dec 18 '18 at 21:47
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
You are looking for the smallest $n$ such that
$$frac{n^{sqrt{n+2}}}{(n+1)^{sqrt{n+1}}} > 1$$ Take logarithms and search for the zero of
$$g(n)=sqrt{n+2} log (n)-sqrt{n+1} log (n+1)$$ Assume that $n$ is large and use
$$sqrt{n+2}sim sqrt n+frac 1 { sqrt n}$$
$$sqrt{n+1}sim sqrt n+frac 1 {2 sqrt n}$$
$$log(n+1)=log(n)+logleft(1+frac 1 nright)sim log(n)+frac 1 n$$ Replace to get
$$g(n) sim -frac{1}{2n^{3/2}} (2 n-n log (n)+1)$$
The solution of $2 n-n log (n)+1=0$ is given in terms of Lambert function; so, the approximation is
$$n =frac{1}{Wleft(frac{1}{e^2}right)}$$ Since the argument is small, use $W(x)approx frac{x}{x+1}$ which makes $color{red}{n=1+e^2 approx 8.39}$ while the exact solution of $g(n)=0$ in the real domain would be $8.70$. Then $color{red}{n=9}$.
Let us check the values of $$f(n)=n^{sqrt{n+2}}-(n+1)^{sqrt{n+1}}$$
$$f(8)=8^{sqrt{10}}-729 approx -11.50 qquad f(9)=9^{sqrt{11}}-10^{sqrt{10}}approx 8.68$$
$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%2f3045728%2finequality-n-sqrtn2n1-sqrtn1-solution%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
You are looking for the smallest $n$ such that
$$frac{n^{sqrt{n+2}}}{(n+1)^{sqrt{n+1}}} > 1$$ Take logarithms and search for the zero of
$$g(n)=sqrt{n+2} log (n)-sqrt{n+1} log (n+1)$$ Assume that $n$ is large and use
$$sqrt{n+2}sim sqrt n+frac 1 { sqrt n}$$
$$sqrt{n+1}sim sqrt n+frac 1 {2 sqrt n}$$
$$log(n+1)=log(n)+logleft(1+frac 1 nright)sim log(n)+frac 1 n$$ Replace to get
$$g(n) sim -frac{1}{2n^{3/2}} (2 n-n log (n)+1)$$
The solution of $2 n-n log (n)+1=0$ is given in terms of Lambert function; so, the approximation is
$$n =frac{1}{Wleft(frac{1}{e^2}right)}$$ Since the argument is small, use $W(x)approx frac{x}{x+1}$ which makes $color{red}{n=1+e^2 approx 8.39}$ while the exact solution of $g(n)=0$ in the real domain would be $8.70$. Then $color{red}{n=9}$.
Let us check the values of $$f(n)=n^{sqrt{n+2}}-(n+1)^{sqrt{n+1}}$$
$$f(8)=8^{sqrt{10}}-729 approx -11.50 qquad f(9)=9^{sqrt{11}}-10^{sqrt{10}}approx 8.68$$
$endgroup$
add a comment |
$begingroup$
You are looking for the smallest $n$ such that
$$frac{n^{sqrt{n+2}}}{(n+1)^{sqrt{n+1}}} > 1$$ Take logarithms and search for the zero of
$$g(n)=sqrt{n+2} log (n)-sqrt{n+1} log (n+1)$$ Assume that $n$ is large and use
$$sqrt{n+2}sim sqrt n+frac 1 { sqrt n}$$
$$sqrt{n+1}sim sqrt n+frac 1 {2 sqrt n}$$
$$log(n+1)=log(n)+logleft(1+frac 1 nright)sim log(n)+frac 1 n$$ Replace to get
$$g(n) sim -frac{1}{2n^{3/2}} (2 n-n log (n)+1)$$
The solution of $2 n-n log (n)+1=0$ is given in terms of Lambert function; so, the approximation is
$$n =frac{1}{Wleft(frac{1}{e^2}right)}$$ Since the argument is small, use $W(x)approx frac{x}{x+1}$ which makes $color{red}{n=1+e^2 approx 8.39}$ while the exact solution of $g(n)=0$ in the real domain would be $8.70$. Then $color{red}{n=9}$.
Let us check the values of $$f(n)=n^{sqrt{n+2}}-(n+1)^{sqrt{n+1}}$$
$$f(8)=8^{sqrt{10}}-729 approx -11.50 qquad f(9)=9^{sqrt{11}}-10^{sqrt{10}}approx 8.68$$
$endgroup$
add a comment |
$begingroup$
You are looking for the smallest $n$ such that
$$frac{n^{sqrt{n+2}}}{(n+1)^{sqrt{n+1}}} > 1$$ Take logarithms and search for the zero of
$$g(n)=sqrt{n+2} log (n)-sqrt{n+1} log (n+1)$$ Assume that $n$ is large and use
$$sqrt{n+2}sim sqrt n+frac 1 { sqrt n}$$
$$sqrt{n+1}sim sqrt n+frac 1 {2 sqrt n}$$
$$log(n+1)=log(n)+logleft(1+frac 1 nright)sim log(n)+frac 1 n$$ Replace to get
$$g(n) sim -frac{1}{2n^{3/2}} (2 n-n log (n)+1)$$
The solution of $2 n-n log (n)+1=0$ is given in terms of Lambert function; so, the approximation is
$$n =frac{1}{Wleft(frac{1}{e^2}right)}$$ Since the argument is small, use $W(x)approx frac{x}{x+1}$ which makes $color{red}{n=1+e^2 approx 8.39}$ while the exact solution of $g(n)=0$ in the real domain would be $8.70$. Then $color{red}{n=9}$.
Let us check the values of $$f(n)=n^{sqrt{n+2}}-(n+1)^{sqrt{n+1}}$$
$$f(8)=8^{sqrt{10}}-729 approx -11.50 qquad f(9)=9^{sqrt{11}}-10^{sqrt{10}}approx 8.68$$
$endgroup$
You are looking for the smallest $n$ such that
$$frac{n^{sqrt{n+2}}}{(n+1)^{sqrt{n+1}}} > 1$$ Take logarithms and search for the zero of
$$g(n)=sqrt{n+2} log (n)-sqrt{n+1} log (n+1)$$ Assume that $n$ is large and use
$$sqrt{n+2}sim sqrt n+frac 1 { sqrt n}$$
$$sqrt{n+1}sim sqrt n+frac 1 {2 sqrt n}$$
$$log(n+1)=log(n)+logleft(1+frac 1 nright)sim log(n)+frac 1 n$$ Replace to get
$$g(n) sim -frac{1}{2n^{3/2}} (2 n-n log (n)+1)$$
The solution of $2 n-n log (n)+1=0$ is given in terms of Lambert function; so, the approximation is
$$n =frac{1}{Wleft(frac{1}{e^2}right)}$$ Since the argument is small, use $W(x)approx frac{x}{x+1}$ which makes $color{red}{n=1+e^2 approx 8.39}$ while the exact solution of $g(n)=0$ in the real domain would be $8.70$. Then $color{red}{n=9}$.
Let us check the values of $$f(n)=n^{sqrt{n+2}}-(n+1)^{sqrt{n+1}}$$
$$f(8)=8^{sqrt{10}}-729 approx -11.50 qquad f(9)=9^{sqrt{11}}-10^{sqrt{10}}approx 8.68$$
edited Dec 19 '18 at 10:32
answered Dec 19 '18 at 10:18
Claude LeiboviciClaude Leibovici
121k1157134
121k1157134
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%2f3045728%2finequality-n-sqrtn2n1-sqrtn1-solution%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
QUxaYCHL2G,VSnGRbxGR
$begingroup$
This is not true for $n=1$
$endgroup$
– Bo5man
Dec 18 '18 at 21:38
$begingroup$
@Bo5man I'm looking for the integer from what it's true
$endgroup$
– avan1235
Dec 18 '18 at 21:42
$begingroup$
From the statement I could not interpret that. Thanks for clarifying.
$endgroup$
– Bo5man
Dec 18 '18 at 21:47