Prove that $(1-x)^n leq 1 -xn+frac{n(n-1)}{2}x^2$ when $0leq xleq 1$ and $ngeq2$
$begingroup$
Reading a book I saw this inequality
$$
(1-x)^n leq 1 -xn+frac{n(n-1)}{2}x^2
$$
when $0leq xleq 1$ and following the author it descended from the inclusion-exclusion principle. I don't understand why. Moreover is there a simple proof of this inequality?
Thanks
I've tried to prove the inequality in the following way:
From the binomial theorem:
$$
(1-x)^n = sum_{k=0}^{n}{{n}choose{k}}(-1)^{k}x^k=1 -xn+frac{n(n-1)}{2}x^2+sum_{k=3}^{n}{{n}choose{k}}(-1)^{k}x^k
$$
and so we need to prove that:
$$
sum_{k=3}^{n}{{n}choose{k}}(-1)^{k}x^kleq0
$$
when $0leq xleq1$.
I've tried to use the inequality
$$
sum_{k=3}^{n}{{n}choose{k}}(-1)^{k}leq0
$$
that I can prove from $0=(1-1)^n$ and then I've tried to group some terms in the sum but without success.
inequality binomial-coefficients inclusion-exclusion
$endgroup$
add a comment |
$begingroup$
Reading a book I saw this inequality
$$
(1-x)^n leq 1 -xn+frac{n(n-1)}{2}x^2
$$
when $0leq xleq 1$ and following the author it descended from the inclusion-exclusion principle. I don't understand why. Moreover is there a simple proof of this inequality?
Thanks
I've tried to prove the inequality in the following way:
From the binomial theorem:
$$
(1-x)^n = sum_{k=0}^{n}{{n}choose{k}}(-1)^{k}x^k=1 -xn+frac{n(n-1)}{2}x^2+sum_{k=3}^{n}{{n}choose{k}}(-1)^{k}x^k
$$
and so we need to prove that:
$$
sum_{k=3}^{n}{{n}choose{k}}(-1)^{k}x^kleq0
$$
when $0leq xleq1$.
I've tried to use the inequality
$$
sum_{k=3}^{n}{{n}choose{k}}(-1)^{k}leq0
$$
that I can prove from $0=(1-1)^n$ and then I've tried to group some terms in the sum but without success.
inequality binomial-coefficients inclusion-exclusion
$endgroup$
1
$begingroup$
Perhaps $nleq 2$ should be $n geq 2$.
$endgroup$
– Kavi Rama Murthy
Dec 5 '18 at 10:11
$begingroup$
Yes, you are right! I fixed it, thanks
$endgroup$
– Alex
Dec 5 '18 at 10:13
add a comment |
$begingroup$
Reading a book I saw this inequality
$$
(1-x)^n leq 1 -xn+frac{n(n-1)}{2}x^2
$$
when $0leq xleq 1$ and following the author it descended from the inclusion-exclusion principle. I don't understand why. Moreover is there a simple proof of this inequality?
Thanks
I've tried to prove the inequality in the following way:
From the binomial theorem:
$$
(1-x)^n = sum_{k=0}^{n}{{n}choose{k}}(-1)^{k}x^k=1 -xn+frac{n(n-1)}{2}x^2+sum_{k=3}^{n}{{n}choose{k}}(-1)^{k}x^k
$$
and so we need to prove that:
$$
sum_{k=3}^{n}{{n}choose{k}}(-1)^{k}x^kleq0
$$
when $0leq xleq1$.
I've tried to use the inequality
$$
sum_{k=3}^{n}{{n}choose{k}}(-1)^{k}leq0
$$
that I can prove from $0=(1-1)^n$ and then I've tried to group some terms in the sum but without success.
inequality binomial-coefficients inclusion-exclusion
$endgroup$
Reading a book I saw this inequality
$$
(1-x)^n leq 1 -xn+frac{n(n-1)}{2}x^2
$$
when $0leq xleq 1$ and following the author it descended from the inclusion-exclusion principle. I don't understand why. Moreover is there a simple proof of this inequality?
Thanks
I've tried to prove the inequality in the following way:
From the binomial theorem:
$$
(1-x)^n = sum_{k=0}^{n}{{n}choose{k}}(-1)^{k}x^k=1 -xn+frac{n(n-1)}{2}x^2+sum_{k=3}^{n}{{n}choose{k}}(-1)^{k}x^k
$$
and so we need to prove that:
$$
sum_{k=3}^{n}{{n}choose{k}}(-1)^{k}x^kleq0
$$
when $0leq xleq1$.
I've tried to use the inequality
$$
sum_{k=3}^{n}{{n}choose{k}}(-1)^{k}leq0
$$
that I can prove from $0=(1-1)^n$ and then I've tried to group some terms in the sum but without success.
inequality binomial-coefficients inclusion-exclusion
inequality binomial-coefficients inclusion-exclusion
edited Dec 5 '18 at 10:12
Alex
asked Dec 5 '18 at 10:10
AlexAlex
32319
32319
1
$begingroup$
Perhaps $nleq 2$ should be $n geq 2$.
$endgroup$
– Kavi Rama Murthy
Dec 5 '18 at 10:11
$begingroup$
Yes, you are right! I fixed it, thanks
$endgroup$
– Alex
Dec 5 '18 at 10:13
add a comment |
1
$begingroup$
Perhaps $nleq 2$ should be $n geq 2$.
$endgroup$
– Kavi Rama Murthy
Dec 5 '18 at 10:11
$begingroup$
Yes, you are right! I fixed it, thanks
$endgroup$
– Alex
Dec 5 '18 at 10:13
1
1
$begingroup$
Perhaps $nleq 2$ should be $n geq 2$.
$endgroup$
– Kavi Rama Murthy
Dec 5 '18 at 10:11
$begingroup$
Perhaps $nleq 2$ should be $n geq 2$.
$endgroup$
– Kavi Rama Murthy
Dec 5 '18 at 10:11
$begingroup$
Yes, you are right! I fixed it, thanks
$endgroup$
– Alex
Dec 5 '18 at 10:13
$begingroup$
Yes, you are right! I fixed it, thanks
$endgroup$
– Alex
Dec 5 '18 at 10:13
add a comment |
4 Answers
4
active
oldest
votes
$begingroup$
If true for some $n$, then
begin{align}
(1-x)^{n+1}&le(1-x)left(1-nx+frac{n(n-1)}2x^2right)\
&=1-(n+1)x+frac{(n+1)n}2x^2-frac{n(n-1)}2x^3\
&le1-(n+1)x+frac{(n+1)n}2x^2.
end{align}
and now use induction.
$endgroup$
$begingroup$
Thanks! Any connection with the inclusion-exclusion principle?
$endgroup$
– Alex
Dec 5 '18 at 10:44
2
$begingroup$
@Alex en.wikipedia.org/wiki/…
$endgroup$
– Lord Shark the Unknown
Dec 5 '18 at 11:22
add a comment |
$begingroup$
Interpretation in terms of inclusion-exclusion principle is not too difficult either, though it could become verbose. Consider a coin with probability $x in (0, 1)$ of turning Heads. Suppose you want to find the probability of getting only Tails when tossing $n$ such coins. The probability is obviously $(1-x)^n$ by independence of the events.
OTOH, we can look at the probability of all events, i.e. $1$, and reduce from it the probability of all events where there is a Head in each coin individually. This leads to $1-nx$, as there are $n$ coins. However the second term clearly double counts cases where two Heads simultaneously appears, so we add back these, i.e. $binom{n}{2}x^2$, to get $1-nx+frac12n(n-1)x^2$. We notice that the last term has double counted all cases where three coins had Heads simultaneously, so this is an overestimate, so $(1-x)^n leqslant 1-nx+frac12n(n-1)x^2$
$endgroup$
add a comment |
$begingroup$
For $n=2$ the proof is trivial, we consider $n>2$.
Let $f(x) = (1-x)^n$ and $g(x)=1-nx+frac{n(n-1)}{2}x^2$. You have clearly
$$f(0) = g(0),quad f'(0) = g'(0),quad f''(0)=g''(0)$$
However, the third derivative writes
$$ f'''(x) = -n(n-1)(n-2) (1-x)^{n-3} < 0 = g'''(x).$$
Given that $f''(0)=g''(0)$ it is easy to see that $forall xin[0,1], f'(x)le g'(x)$. Now use $f(0)=g(0)$ to obtain that $forall xin[0,1], f(x)le g(x)$.
$endgroup$
$begingroup$
Thank you very much
$endgroup$
– Alex
Dec 5 '18 at 10:43
add a comment |
$begingroup$
You can apply Taylor around 0. Let $f = (1-x)^n$, then $f'(0) = -n$, $f''(0) = n (n-1)$, and $f'''(xi) = -n(n-1)(n-2)(1 - xi)^{n-3}$.
$$(1-x)^n = 1 - nx + frac{n(n-1)}{2} x^2 + frac{f'''(xi)}{6} , x^3,$$
for some $xi in [0, x]$. Since $x leq 1$, $f'''(xi) leq 0$, and so the remainder term is non-positive.
$endgroup$
1
$begingroup$
up to $f''' <0$ for $x in[0,1]$ =)
$endgroup$
– TZakrevskiy
Dec 5 '18 at 10:52
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%2f3026897%2fprove-that-1-xn-leq-1-xn-fracnn-12x2-when-0-leq-x-leq-1-and-n%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
If true for some $n$, then
begin{align}
(1-x)^{n+1}&le(1-x)left(1-nx+frac{n(n-1)}2x^2right)\
&=1-(n+1)x+frac{(n+1)n}2x^2-frac{n(n-1)}2x^3\
&le1-(n+1)x+frac{(n+1)n}2x^2.
end{align}
and now use induction.
$endgroup$
$begingroup$
Thanks! Any connection with the inclusion-exclusion principle?
$endgroup$
– Alex
Dec 5 '18 at 10:44
2
$begingroup$
@Alex en.wikipedia.org/wiki/…
$endgroup$
– Lord Shark the Unknown
Dec 5 '18 at 11:22
add a comment |
$begingroup$
If true for some $n$, then
begin{align}
(1-x)^{n+1}&le(1-x)left(1-nx+frac{n(n-1)}2x^2right)\
&=1-(n+1)x+frac{(n+1)n}2x^2-frac{n(n-1)}2x^3\
&le1-(n+1)x+frac{(n+1)n}2x^2.
end{align}
and now use induction.
$endgroup$
$begingroup$
Thanks! Any connection with the inclusion-exclusion principle?
$endgroup$
– Alex
Dec 5 '18 at 10:44
2
$begingroup$
@Alex en.wikipedia.org/wiki/…
$endgroup$
– Lord Shark the Unknown
Dec 5 '18 at 11:22
add a comment |
$begingroup$
If true for some $n$, then
begin{align}
(1-x)^{n+1}&le(1-x)left(1-nx+frac{n(n-1)}2x^2right)\
&=1-(n+1)x+frac{(n+1)n}2x^2-frac{n(n-1)}2x^3\
&le1-(n+1)x+frac{(n+1)n}2x^2.
end{align}
and now use induction.
$endgroup$
If true for some $n$, then
begin{align}
(1-x)^{n+1}&le(1-x)left(1-nx+frac{n(n-1)}2x^2right)\
&=1-(n+1)x+frac{(n+1)n}2x^2-frac{n(n-1)}2x^3\
&le1-(n+1)x+frac{(n+1)n}2x^2.
end{align}
and now use induction.
answered Dec 5 '18 at 10:41
Lord Shark the UnknownLord Shark the Unknown
103k1160132
103k1160132
$begingroup$
Thanks! Any connection with the inclusion-exclusion principle?
$endgroup$
– Alex
Dec 5 '18 at 10:44
2
$begingroup$
@Alex en.wikipedia.org/wiki/…
$endgroup$
– Lord Shark the Unknown
Dec 5 '18 at 11:22
add a comment |
$begingroup$
Thanks! Any connection with the inclusion-exclusion principle?
$endgroup$
– Alex
Dec 5 '18 at 10:44
2
$begingroup$
@Alex en.wikipedia.org/wiki/…
$endgroup$
– Lord Shark the Unknown
Dec 5 '18 at 11:22
$begingroup$
Thanks! Any connection with the inclusion-exclusion principle?
$endgroup$
– Alex
Dec 5 '18 at 10:44
$begingroup$
Thanks! Any connection with the inclusion-exclusion principle?
$endgroup$
– Alex
Dec 5 '18 at 10:44
2
2
$begingroup$
@Alex en.wikipedia.org/wiki/…
$endgroup$
– Lord Shark the Unknown
Dec 5 '18 at 11:22
$begingroup$
@Alex en.wikipedia.org/wiki/…
$endgroup$
– Lord Shark the Unknown
Dec 5 '18 at 11:22
add a comment |
$begingroup$
Interpretation in terms of inclusion-exclusion principle is not too difficult either, though it could become verbose. Consider a coin with probability $x in (0, 1)$ of turning Heads. Suppose you want to find the probability of getting only Tails when tossing $n$ such coins. The probability is obviously $(1-x)^n$ by independence of the events.
OTOH, we can look at the probability of all events, i.e. $1$, and reduce from it the probability of all events where there is a Head in each coin individually. This leads to $1-nx$, as there are $n$ coins. However the second term clearly double counts cases where two Heads simultaneously appears, so we add back these, i.e. $binom{n}{2}x^2$, to get $1-nx+frac12n(n-1)x^2$. We notice that the last term has double counted all cases where three coins had Heads simultaneously, so this is an overestimate, so $(1-x)^n leqslant 1-nx+frac12n(n-1)x^2$
$endgroup$
add a comment |
$begingroup$
Interpretation in terms of inclusion-exclusion principle is not too difficult either, though it could become verbose. Consider a coin with probability $x in (0, 1)$ of turning Heads. Suppose you want to find the probability of getting only Tails when tossing $n$ such coins. The probability is obviously $(1-x)^n$ by independence of the events.
OTOH, we can look at the probability of all events, i.e. $1$, and reduce from it the probability of all events where there is a Head in each coin individually. This leads to $1-nx$, as there are $n$ coins. However the second term clearly double counts cases where two Heads simultaneously appears, so we add back these, i.e. $binom{n}{2}x^2$, to get $1-nx+frac12n(n-1)x^2$. We notice that the last term has double counted all cases where three coins had Heads simultaneously, so this is an overestimate, so $(1-x)^n leqslant 1-nx+frac12n(n-1)x^2$
$endgroup$
add a comment |
$begingroup$
Interpretation in terms of inclusion-exclusion principle is not too difficult either, though it could become verbose. Consider a coin with probability $x in (0, 1)$ of turning Heads. Suppose you want to find the probability of getting only Tails when tossing $n$ such coins. The probability is obviously $(1-x)^n$ by independence of the events.
OTOH, we can look at the probability of all events, i.e. $1$, and reduce from it the probability of all events where there is a Head in each coin individually. This leads to $1-nx$, as there are $n$ coins. However the second term clearly double counts cases where two Heads simultaneously appears, so we add back these, i.e. $binom{n}{2}x^2$, to get $1-nx+frac12n(n-1)x^2$. We notice that the last term has double counted all cases where three coins had Heads simultaneously, so this is an overestimate, so $(1-x)^n leqslant 1-nx+frac12n(n-1)x^2$
$endgroup$
Interpretation in terms of inclusion-exclusion principle is not too difficult either, though it could become verbose. Consider a coin with probability $x in (0, 1)$ of turning Heads. Suppose you want to find the probability of getting only Tails when tossing $n$ such coins. The probability is obviously $(1-x)^n$ by independence of the events.
OTOH, we can look at the probability of all events, i.e. $1$, and reduce from it the probability of all events where there is a Head in each coin individually. This leads to $1-nx$, as there are $n$ coins. However the second term clearly double counts cases where two Heads simultaneously appears, so we add back these, i.e. $binom{n}{2}x^2$, to get $1-nx+frac12n(n-1)x^2$. We notice that the last term has double counted all cases where three coins had Heads simultaneously, so this is an overestimate, so $(1-x)^n leqslant 1-nx+frac12n(n-1)x^2$
answered Dec 5 '18 at 13:10
MacavityMacavity
35.2k52554
35.2k52554
add a comment |
add a comment |
$begingroup$
For $n=2$ the proof is trivial, we consider $n>2$.
Let $f(x) = (1-x)^n$ and $g(x)=1-nx+frac{n(n-1)}{2}x^2$. You have clearly
$$f(0) = g(0),quad f'(0) = g'(0),quad f''(0)=g''(0)$$
However, the third derivative writes
$$ f'''(x) = -n(n-1)(n-2) (1-x)^{n-3} < 0 = g'''(x).$$
Given that $f''(0)=g''(0)$ it is easy to see that $forall xin[0,1], f'(x)le g'(x)$. Now use $f(0)=g(0)$ to obtain that $forall xin[0,1], f(x)le g(x)$.
$endgroup$
$begingroup$
Thank you very much
$endgroup$
– Alex
Dec 5 '18 at 10:43
add a comment |
$begingroup$
For $n=2$ the proof is trivial, we consider $n>2$.
Let $f(x) = (1-x)^n$ and $g(x)=1-nx+frac{n(n-1)}{2}x^2$. You have clearly
$$f(0) = g(0),quad f'(0) = g'(0),quad f''(0)=g''(0)$$
However, the third derivative writes
$$ f'''(x) = -n(n-1)(n-2) (1-x)^{n-3} < 0 = g'''(x).$$
Given that $f''(0)=g''(0)$ it is easy to see that $forall xin[0,1], f'(x)le g'(x)$. Now use $f(0)=g(0)$ to obtain that $forall xin[0,1], f(x)le g(x)$.
$endgroup$
$begingroup$
Thank you very much
$endgroup$
– Alex
Dec 5 '18 at 10:43
add a comment |
$begingroup$
For $n=2$ the proof is trivial, we consider $n>2$.
Let $f(x) = (1-x)^n$ and $g(x)=1-nx+frac{n(n-1)}{2}x^2$. You have clearly
$$f(0) = g(0),quad f'(0) = g'(0),quad f''(0)=g''(0)$$
However, the third derivative writes
$$ f'''(x) = -n(n-1)(n-2) (1-x)^{n-3} < 0 = g'''(x).$$
Given that $f''(0)=g''(0)$ it is easy to see that $forall xin[0,1], f'(x)le g'(x)$. Now use $f(0)=g(0)$ to obtain that $forall xin[0,1], f(x)le g(x)$.
$endgroup$
For $n=2$ the proof is trivial, we consider $n>2$.
Let $f(x) = (1-x)^n$ and $g(x)=1-nx+frac{n(n-1)}{2}x^2$. You have clearly
$$f(0) = g(0),quad f'(0) = g'(0),quad f''(0)=g''(0)$$
However, the third derivative writes
$$ f'''(x) = -n(n-1)(n-2) (1-x)^{n-3} < 0 = g'''(x).$$
Given that $f''(0)=g''(0)$ it is easy to see that $forall xin[0,1], f'(x)le g'(x)$. Now use $f(0)=g(0)$ to obtain that $forall xin[0,1], f(x)le g(x)$.
answered Dec 5 '18 at 10:28
TZakrevskiyTZakrevskiy
20.2k12354
20.2k12354
$begingroup$
Thank you very much
$endgroup$
– Alex
Dec 5 '18 at 10:43
add a comment |
$begingroup$
Thank you very much
$endgroup$
– Alex
Dec 5 '18 at 10:43
$begingroup$
Thank you very much
$endgroup$
– Alex
Dec 5 '18 at 10:43
$begingroup$
Thank you very much
$endgroup$
– Alex
Dec 5 '18 at 10:43
add a comment |
$begingroup$
You can apply Taylor around 0. Let $f = (1-x)^n$, then $f'(0) = -n$, $f''(0) = n (n-1)$, and $f'''(xi) = -n(n-1)(n-2)(1 - xi)^{n-3}$.
$$(1-x)^n = 1 - nx + frac{n(n-1)}{2} x^2 + frac{f'''(xi)}{6} , x^3,$$
for some $xi in [0, x]$. Since $x leq 1$, $f'''(xi) leq 0$, and so the remainder term is non-positive.
$endgroup$
1
$begingroup$
up to $f''' <0$ for $x in[0,1]$ =)
$endgroup$
– TZakrevskiy
Dec 5 '18 at 10:52
add a comment |
$begingroup$
You can apply Taylor around 0. Let $f = (1-x)^n$, then $f'(0) = -n$, $f''(0) = n (n-1)$, and $f'''(xi) = -n(n-1)(n-2)(1 - xi)^{n-3}$.
$$(1-x)^n = 1 - nx + frac{n(n-1)}{2} x^2 + frac{f'''(xi)}{6} , x^3,$$
for some $xi in [0, x]$. Since $x leq 1$, $f'''(xi) leq 0$, and so the remainder term is non-positive.
$endgroup$
1
$begingroup$
up to $f''' <0$ for $x in[0,1]$ =)
$endgroup$
– TZakrevskiy
Dec 5 '18 at 10:52
add a comment |
$begingroup$
You can apply Taylor around 0. Let $f = (1-x)^n$, then $f'(0) = -n$, $f''(0) = n (n-1)$, and $f'''(xi) = -n(n-1)(n-2)(1 - xi)^{n-3}$.
$$(1-x)^n = 1 - nx + frac{n(n-1)}{2} x^2 + frac{f'''(xi)}{6} , x^3,$$
for some $xi in [0, x]$. Since $x leq 1$, $f'''(xi) leq 0$, and so the remainder term is non-positive.
$endgroup$
You can apply Taylor around 0. Let $f = (1-x)^n$, then $f'(0) = -n$, $f''(0) = n (n-1)$, and $f'''(xi) = -n(n-1)(n-2)(1 - xi)^{n-3}$.
$$(1-x)^n = 1 - nx + frac{n(n-1)}{2} x^2 + frac{f'''(xi)}{6} , x^3,$$
for some $xi in [0, x]$. Since $x leq 1$, $f'''(xi) leq 0$, and so the remainder term is non-positive.
edited Dec 5 '18 at 11:31
answered Dec 5 '18 at 10:32
Roberto RastapopoulosRoberto Rastapopoulos
899424
899424
1
$begingroup$
up to $f''' <0$ for $x in[0,1]$ =)
$endgroup$
– TZakrevskiy
Dec 5 '18 at 10:52
add a comment |
1
$begingroup$
up to $f''' <0$ for $x in[0,1]$ =)
$endgroup$
– TZakrevskiy
Dec 5 '18 at 10:52
1
1
$begingroup$
up to $f''' <0$ for $x in[0,1]$ =)
$endgroup$
– TZakrevskiy
Dec 5 '18 at 10:52
$begingroup$
up to $f''' <0$ for $x in[0,1]$ =)
$endgroup$
– TZakrevskiy
Dec 5 '18 at 10:52
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%2f3026897%2fprove-that-1-xn-leq-1-xn-fracnn-12x2-when-0-leq-x-leq-1-and-n%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
1
$begingroup$
Perhaps $nleq 2$ should be $n geq 2$.
$endgroup$
– Kavi Rama Murthy
Dec 5 '18 at 10:11
$begingroup$
Yes, you are right! I fixed it, thanks
$endgroup$
– Alex
Dec 5 '18 at 10:13