Concerning the limit of the numerator of a rational function
$begingroup$
I have a basic question about the limits of rational sequences:
Suppose we know that a sequence $(a_{n})$ converges to $0$ and that each $a_n$ is defined by $a_n := frac{b_n}{c_n}$ for two sequences $(b_{n})$ and $(c_{n})$. We further know that $(c_{n})$ goes to infinity, i.e
$$lim_{n rightarrow infty} c_n = infty.$$
Can we deduce from this that $lim_{n rightarrow infty} b_n = 0$ and if yes how?
Edit: I have an additional question: Are we at least able to deduce that $b_{(n)}$ converges?
sequences-and-series limits
$endgroup$
add a comment |
$begingroup$
I have a basic question about the limits of rational sequences:
Suppose we know that a sequence $(a_{n})$ converges to $0$ and that each $a_n$ is defined by $a_n := frac{b_n}{c_n}$ for two sequences $(b_{n})$ and $(c_{n})$. We further know that $(c_{n})$ goes to infinity, i.e
$$lim_{n rightarrow infty} c_n = infty.$$
Can we deduce from this that $lim_{n rightarrow infty} b_n = 0$ and if yes how?
Edit: I have an additional question: Are we at least able to deduce that $b_{(n)}$ converges?
sequences-and-series limits
$endgroup$
add a comment |
$begingroup$
I have a basic question about the limits of rational sequences:
Suppose we know that a sequence $(a_{n})$ converges to $0$ and that each $a_n$ is defined by $a_n := frac{b_n}{c_n}$ for two sequences $(b_{n})$ and $(c_{n})$. We further know that $(c_{n})$ goes to infinity, i.e
$$lim_{n rightarrow infty} c_n = infty.$$
Can we deduce from this that $lim_{n rightarrow infty} b_n = 0$ and if yes how?
Edit: I have an additional question: Are we at least able to deduce that $b_{(n)}$ converges?
sequences-and-series limits
$endgroup$
I have a basic question about the limits of rational sequences:
Suppose we know that a sequence $(a_{n})$ converges to $0$ and that each $a_n$ is defined by $a_n := frac{b_n}{c_n}$ for two sequences $(b_{n})$ and $(c_{n})$. We further know that $(c_{n})$ goes to infinity, i.e
$$lim_{n rightarrow infty} c_n = infty.$$
Can we deduce from this that $lim_{n rightarrow infty} b_n = 0$ and if yes how?
Edit: I have an additional question: Are we at least able to deduce that $b_{(n)}$ converges?
sequences-and-series limits
sequences-and-series limits
edited Dec 17 '18 at 14:10
3nondatur
asked Dec 17 '18 at 13:10
3nondatur3nondatur
399111
399111
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
No.
What about $$left( a_n right)=left( frac{1}{n}right)$$
where $a_n=frac{1}{n}$,
$ b_n=1$ and $ c_n=n$
Edit-Edited to answer your additional question.
Again No.
What about $$left( a_n right)=left( frac{n}{n^2}right)$$
where $a_n=frac{n}{n^2}$,
$ b_n=n$ and $ c_n=n^2$
$endgroup$
add a comment |
$begingroup$
No, that’s not true. For instance, for $b_n = n$ and $c_n = n^2$, we have
$$lim_{n to infty}frac{b_n}{c_n} = 0$$
while both sequences tend to $infty$. More generally, when both $b_n$ and $c_n$ are polynomials with $c_n$ having the higher degree, the limit tends to $0$, even though both polynomials may tend to $infty$.
Edit: Also no, the example above once again shows this. Both polynomials clearly diverge to $infty$, but since the denominator has a greater degree, it diverges faster. Hence, the limit tends to $0$.
$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%2f3043916%2fconcerning-the-limit-of-the-numerator-of-a-rational-function%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$
No.
What about $$left( a_n right)=left( frac{1}{n}right)$$
where $a_n=frac{1}{n}$,
$ b_n=1$ and $ c_n=n$
Edit-Edited to answer your additional question.
Again No.
What about $$left( a_n right)=left( frac{n}{n^2}right)$$
where $a_n=frac{n}{n^2}$,
$ b_n=n$ and $ c_n=n^2$
$endgroup$
add a comment |
$begingroup$
No.
What about $$left( a_n right)=left( frac{1}{n}right)$$
where $a_n=frac{1}{n}$,
$ b_n=1$ and $ c_n=n$
Edit-Edited to answer your additional question.
Again No.
What about $$left( a_n right)=left( frac{n}{n^2}right)$$
where $a_n=frac{n}{n^2}$,
$ b_n=n$ and $ c_n=n^2$
$endgroup$
add a comment |
$begingroup$
No.
What about $$left( a_n right)=left( frac{1}{n}right)$$
where $a_n=frac{1}{n}$,
$ b_n=1$ and $ c_n=n$
Edit-Edited to answer your additional question.
Again No.
What about $$left( a_n right)=left( frac{n}{n^2}right)$$
where $a_n=frac{n}{n^2}$,
$ b_n=n$ and $ c_n=n^2$
$endgroup$
No.
What about $$left( a_n right)=left( frac{1}{n}right)$$
where $a_n=frac{1}{n}$,
$ b_n=1$ and $ c_n=n$
Edit-Edited to answer your additional question.
Again No.
What about $$left( a_n right)=left( frac{n}{n^2}right)$$
where $a_n=frac{n}{n^2}$,
$ b_n=n$ and $ c_n=n^2$
edited Dec 17 '18 at 13:58
answered Dec 17 '18 at 13:13
Rakesh BhattRakesh Bhatt
952214
952214
add a comment |
add a comment |
$begingroup$
No, that’s not true. For instance, for $b_n = n$ and $c_n = n^2$, we have
$$lim_{n to infty}frac{b_n}{c_n} = 0$$
while both sequences tend to $infty$. More generally, when both $b_n$ and $c_n$ are polynomials with $c_n$ having the higher degree, the limit tends to $0$, even though both polynomials may tend to $infty$.
Edit: Also no, the example above once again shows this. Both polynomials clearly diverge to $infty$, but since the denominator has a greater degree, it diverges faster. Hence, the limit tends to $0$.
$endgroup$
add a comment |
$begingroup$
No, that’s not true. For instance, for $b_n = n$ and $c_n = n^2$, we have
$$lim_{n to infty}frac{b_n}{c_n} = 0$$
while both sequences tend to $infty$. More generally, when both $b_n$ and $c_n$ are polynomials with $c_n$ having the higher degree, the limit tends to $0$, even though both polynomials may tend to $infty$.
Edit: Also no, the example above once again shows this. Both polynomials clearly diverge to $infty$, but since the denominator has a greater degree, it diverges faster. Hence, the limit tends to $0$.
$endgroup$
add a comment |
$begingroup$
No, that’s not true. For instance, for $b_n = n$ and $c_n = n^2$, we have
$$lim_{n to infty}frac{b_n}{c_n} = 0$$
while both sequences tend to $infty$. More generally, when both $b_n$ and $c_n$ are polynomials with $c_n$ having the higher degree, the limit tends to $0$, even though both polynomials may tend to $infty$.
Edit: Also no, the example above once again shows this. Both polynomials clearly diverge to $infty$, but since the denominator has a greater degree, it diverges faster. Hence, the limit tends to $0$.
$endgroup$
No, that’s not true. For instance, for $b_n = n$ and $c_n = n^2$, we have
$$lim_{n to infty}frac{b_n}{c_n} = 0$$
while both sequences tend to $infty$. More generally, when both $b_n$ and $c_n$ are polynomials with $c_n$ having the higher degree, the limit tends to $0$, even though both polynomials may tend to $infty$.
Edit: Also no, the example above once again shows this. Both polynomials clearly diverge to $infty$, but since the denominator has a greater degree, it diverges faster. Hence, the limit tends to $0$.
edited Dec 17 '18 at 14:01
answered Dec 17 '18 at 13:22
KM101KM101
6,0251525
6,0251525
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%2f3043916%2fconcerning-the-limit-of-the-numerator-of-a-rational-function%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