Mixing
Principle of proof of infinitesimal sequence
$begingroup$
I have such tasks:
Prove by definition that a sequence ($a_n$) is infinitely small if:
1) $a_n=frac{3}{n}$
2) $a_n=frac{(-1)^n}{sqrt[3]{n}}$
3) $a_n=frac{1}{2n-1}$
4) $a_n=frac{2}{sqrt{n}+1}$
Tell me the sources for which I can learn to solve such tasks
analysis
asked Jan 6 at 10:45
yoloyyoloy
1033
$endgroup$
add a comment |
$begingroup$
I have such tasks:
Prove by definition that a sequence ($a_n$) is infinitely small if:
1) $a_n=frac{3}{n}$
2) $a_n=frac{(-1)^n}{sqrt[3]{n}}$
3) $a_n=frac{1}{2n-1}$
4) $a_n=frac{2}{sqrt{n}+1}$
Tell me the sources for which I can learn to solve such tasks
analysis
asked Jan 6 at 10:45
yoloyyoloy
1033
$endgroup$
add a comment |
$begingroup$
I have such tasks:
Prove by definition that a sequence ($a_n$) is infinitely small if:
1) $a_n=frac{3}{n}$
2) $a_n=frac{(-1)^n}{sqrt[3]{n}}$
3) $a_n=frac{1}{2n-1}$
4) $a_n=frac{2}{sqrt{n}+1}$
Tell me the sources for which I can learn to solve such tasks
analysis
asked Jan 6 at 10:45
yoloyyoloy
1033
$endgroup$
I have such tasks:
Prove by definition that a sequence ($a_n$) is infinitely small if:
1) $a_n=frac{3}{n}$
2) $a_n=frac{(-1)^n}{sqrt[3]{n}}$
3) $a_n=frac{1}{2n-1}$
4) $a_n=frac{2}{sqrt{n}+1}$
Tell me the sources for which I can learn to solve such tasks
analysis
analysis
asked Jan 6 at 10:45
yoloyyoloy
1033
asked Jan 6 at 10:45
yoloyyoloy
1033
asked Jan 6 at 10:45
yoloyyoloy
1033
asked Jan 6 at 10:45
yoloyyoloy
1033
asked Jan 6 at 10:45
yoloyyoloy
1033
1033
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Let $varepsilon>0$, you have to prove that $exists n_{varepsilon}$ such that $|a_{n}-0|<varepsilon$ $forall n>n_{varepsilon}$.
1) $frac{3}{n}<varepsiloniff 3<varepsilon n$.
$mathbb{R}$ is archimedean, so exists $n_{varepsilon}$ such that $3<varepsilon n_{varepsilon}$.
It's easy to prove that the sequence is strictly decreasing, and that finishes the proof.
2) It's quite the same: $|a_{n}-0|<varepsilon iff 1<varepsilon sqrt[3]{n} iff 1<varepsilon^{3} n$, so you can complete the proof in the same way as above.
3) $2n-1>n$, so you can repeat the same strategy used in the first case
4) You can reason as in the second case
I think you can learn how to solve exercise like this in any analysis 1 book you like.
answered Jan 6 at 13:56
ecrinecrin
3507
$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%2f3063706%2fprinciple-of-proof-of-infinitesimal-sequence%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$
Let $varepsilon>0$, you have to prove that $exists n_{varepsilon}$ such that $|a_{n}-0|<varepsilon$ $forall n>n_{varepsilon}$.
1) $frac{3}{n}<varepsiloniff 3<varepsilon n$.
$mathbb{R}$ is archimedean, so exists $n_{varepsilon}$ such that $3<varepsilon n_{varepsilon}$.
It's easy to prove that the sequence is strictly decreasing, and that finishes the proof.
2) It's quite the same: $|a_{n}-0|<varepsilon iff 1<varepsilon sqrt[3]{n} iff 1<varepsilon^{3} n$, so you can complete the proof in the same way as above.
3) $2n-1>n$, so you can repeat the same strategy used in the first case
4) You can reason as in the second case
I think you can learn how to solve exercise like this in any analysis 1 book you like.
answered Jan 6 at 13:56
ecrinecrin
3507
$endgroup$
add a comment |
$begingroup$
Let $varepsilon>0$, you have to prove that $exists n_{varepsilon}$ such that $|a_{n}-0|<varepsilon$ $forall n>n_{varepsilon}$.
1) $frac{3}{n}<varepsiloniff 3<varepsilon n$.
$mathbb{R}$ is archimedean, so exists $n_{varepsilon}$ such that $3<varepsilon n_{varepsilon}$.
It's easy to prove that the sequence is strictly decreasing, and that finishes the proof.
2) It's quite the same: $|a_{n}-0|<varepsilon iff 1<varepsilon sqrt[3]{n} iff 1<varepsilon^{3} n$, so you can complete the proof in the same way as above.
3) $2n-1>n$, so you can repeat the same strategy used in the first case
4) You can reason as in the second case
I think you can learn how to solve exercise like this in any analysis 1 book you like.
answered Jan 6 at 13:56
ecrinecrin
3507
$endgroup$
add a comment |
$begingroup$
Let $varepsilon>0$, you have to prove that $exists n_{varepsilon}$ such that $|a_{n}-0|<varepsilon$ $forall n>n_{varepsilon}$.
1) $frac{3}{n}<varepsiloniff 3<varepsilon n$.
$mathbb{R}$ is archimedean, so exists $n_{varepsilon}$ such that $3<varepsilon n_{varepsilon}$.
It's easy to prove that the sequence is strictly decreasing, and that finishes the proof.
2) It's quite the same: $|a_{n}-0|<varepsilon iff 1<varepsilon sqrt[3]{n} iff 1<varepsilon^{3} n$, so you can complete the proof in the same way as above.
3) $2n-1>n$, so you can repeat the same strategy used in the first case
4) You can reason as in the second case
I think you can learn how to solve exercise like this in any analysis 1 book you like.
answered Jan 6 at 13:56
ecrinecrin
3507
$endgroup$
Let $varepsilon>0$, you have to prove that $exists n_{varepsilon}$ such that $|a_{n}-0|<varepsilon$ $forall n>n_{varepsilon}$.
1) $frac{3}{n}<varepsiloniff 3<varepsilon n$.
$mathbb{R}$ is archimedean, so exists $n_{varepsilon}$ such that $3<varepsilon n_{varepsilon}$.
It's easy to prove that the sequence is strictly decreasing, and that finishes the proof.
2) It's quite the same: $|a_{n}-0|<varepsilon iff 1<varepsilon sqrt[3]{n} iff 1<varepsilon^{3} n$, so you can complete the proof in the same way as above.
3) $2n-1>n$, so you can repeat the same strategy used in the first case
4) You can reason as in the second case
I think you can learn how to solve exercise like this in any analysis 1 book you like.
answered Jan 6 at 13:56
ecrinecrin
3507
answered Jan 6 at 13:56
ecrinecrin
3507
answered Jan 6 at 13:56
ecrinecrin
3507
answered Jan 6 at 13:56
ecrinecrin
3507
3507
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%2f3063706%2fprinciple-of-proof-of-infinitesimal-sequence%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
