Prove $x geq 2$ implies $x^{n} geq 2^{n}$
Prove $x geq 2$ implies $x^{n} geq 2^{n}$.
By induction. Clearly it holds for $n = 1$ by the assumption. Now assume $x geq 2$ and $x^{k} geq 2^{k}$ for some $k in mathbb{N}$.
Then combine the assumption inequality and $x geq 2$ to get $x cdot x^{k} geq 2 cdot 2^{k}$, which gives our result.
Is it correct?
induction
add a comment |
Prove $x geq 2$ implies $x^{n} geq 2^{n}$.
By induction. Clearly it holds for $n = 1$ by the assumption. Now assume $x geq 2$ and $x^{k} geq 2^{k}$ for some $k in mathbb{N}$.
Then combine the assumption inequality and $x geq 2$ to get $x cdot x^{k} geq 2 cdot 2^{k}$, which gives our result.
Is it correct?
induction
1
It is correct. If you wanted to be a little more thorough you could say $xcdot x^kgeq 2cdot x^kgeq 2cdot 2^k,$ but I personally don't think that step is necessary.
– Melody
Dec 3 '18 at 8:36
If you are a beginner at the university, you should :)
– Stockfish
Dec 3 '18 at 8:55
add a comment |
Prove $x geq 2$ implies $x^{n} geq 2^{n}$.
By induction. Clearly it holds for $n = 1$ by the assumption. Now assume $x geq 2$ and $x^{k} geq 2^{k}$ for some $k in mathbb{N}$.
Then combine the assumption inequality and $x geq 2$ to get $x cdot x^{k} geq 2 cdot 2^{k}$, which gives our result.
Is it correct?
induction
Prove $x geq 2$ implies $x^{n} geq 2^{n}$.
By induction. Clearly it holds for $n = 1$ by the assumption. Now assume $x geq 2$ and $x^{k} geq 2^{k}$ for some $k in mathbb{N}$.
Then combine the assumption inequality and $x geq 2$ to get $x cdot x^{k} geq 2 cdot 2^{k}$, which gives our result.
Is it correct?
induction
induction
asked Dec 3 '18 at 8:34
joseph
4329
4329
1
It is correct. If you wanted to be a little more thorough you could say $xcdot x^kgeq 2cdot x^kgeq 2cdot 2^k,$ but I personally don't think that step is necessary.
– Melody
Dec 3 '18 at 8:36
If you are a beginner at the university, you should :)
– Stockfish
Dec 3 '18 at 8:55
add a comment |
1
It is correct. If you wanted to be a little more thorough you could say $xcdot x^kgeq 2cdot x^kgeq 2cdot 2^k,$ but I personally don't think that step is necessary.
– Melody
Dec 3 '18 at 8:36
If you are a beginner at the university, you should :)
– Stockfish
Dec 3 '18 at 8:55
1
1
It is correct. If you wanted to be a little more thorough you could say $xcdot x^kgeq 2cdot x^kgeq 2cdot 2^k,$ but I personally don't think that step is necessary.
– Melody
Dec 3 '18 at 8:36
It is correct. If you wanted to be a little more thorough you could say $xcdot x^kgeq 2cdot x^kgeq 2cdot 2^k,$ but I personally don't think that step is necessary.
– Melody
Dec 3 '18 at 8:36
If you are a beginner at the university, you should :)
– Stockfish
Dec 3 '18 at 8:55
If you are a beginner at the university, you should :)
– Stockfish
Dec 3 '18 at 8:55
add a comment |
2 Answers
2
active
oldest
votes
Functions $F(x) = A^x$ are always increasing as long as $A > 1$. Thus, with $A=x$ and $x=n$, we have
$$ x geq 2 implies x^n geq 2^n $$
add a comment |
begin{align}
x^{k+1} &=x(x^k) \
&ge x(2^k) text{, since } x>0.\
&ge 2(2^k)text{, since } xge2 text{ and } 2^k >0\
&ge 2^{k+1}
end{align}
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%2f3023784%2fprove-x-geq-2-implies-xn-geq-2n%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
Functions $F(x) = A^x$ are always increasing as long as $A > 1$. Thus, with $A=x$ and $x=n$, we have
$$ x geq 2 implies x^n geq 2^n $$
add a comment |
Functions $F(x) = A^x$ are always increasing as long as $A > 1$. Thus, with $A=x$ and $x=n$, we have
$$ x geq 2 implies x^n geq 2^n $$
add a comment |
Functions $F(x) = A^x$ are always increasing as long as $A > 1$. Thus, with $A=x$ and $x=n$, we have
$$ x geq 2 implies x^n geq 2^n $$
Functions $F(x) = A^x$ are always increasing as long as $A > 1$. Thus, with $A=x$ and $x=n$, we have
$$ x geq 2 implies x^n geq 2^n $$
answered Dec 3 '18 at 8:37
Jimmy Sabater
1,951219
1,951219
add a comment |
add a comment |
begin{align}
x^{k+1} &=x(x^k) \
&ge x(2^k) text{, since } x>0.\
&ge 2(2^k)text{, since } xge2 text{ and } 2^k >0\
&ge 2^{k+1}
end{align}
add a comment |
begin{align}
x^{k+1} &=x(x^k) \
&ge x(2^k) text{, since } x>0.\
&ge 2(2^k)text{, since } xge2 text{ and } 2^k >0\
&ge 2^{k+1}
end{align}
add a comment |
begin{align}
x^{k+1} &=x(x^k) \
&ge x(2^k) text{, since } x>0.\
&ge 2(2^k)text{, since } xge2 text{ and } 2^k >0\
&ge 2^{k+1}
end{align}
begin{align}
x^{k+1} &=x(x^k) \
&ge x(2^k) text{, since } x>0.\
&ge 2(2^k)text{, since } xge2 text{ and } 2^k >0\
&ge 2^{k+1}
end{align}
answered Dec 3 '18 at 8:39
Siong Thye Goh
99.5k1464117
99.5k1464117
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3023784%2fprove-x-geq-2-implies-xn-geq-2n%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
It is correct. If you wanted to be a little more thorough you could say $xcdot x^kgeq 2cdot x^kgeq 2cdot 2^k,$ but I personally don't think that step is necessary.
– Melody
Dec 3 '18 at 8:36
If you are a beginner at the university, you should :)
– Stockfish
Dec 3 '18 at 8:55