Convergence of the sequence $x_{k+1}=frac{1}{2}(x_k+frac{a}{x_k})$
Consider the sequence $x_{k+1}=frac{1}{2}(x_k+frac{a}{x_k}), agt 0, xinmathbb{R}$. Assume the sequence converges, what does it converge to?
I'm having trouble seeing how to start,
Any help would be appreciated
Thanks
real-analysis sequences-and-series
add a comment |
Consider the sequence $x_{k+1}=frac{1}{2}(x_k+frac{a}{x_k}), agt 0, xinmathbb{R}$. Assume the sequence converges, what does it converge to?
I'm having trouble seeing how to start,
Any help would be appreciated
Thanks
real-analysis sequences-and-series
add a comment |
Consider the sequence $x_{k+1}=frac{1}{2}(x_k+frac{a}{x_k}), agt 0, xinmathbb{R}$. Assume the sequence converges, what does it converge to?
I'm having trouble seeing how to start,
Any help would be appreciated
Thanks
real-analysis sequences-and-series
Consider the sequence $x_{k+1}=frac{1}{2}(x_k+frac{a}{x_k}), agt 0, xinmathbb{R}$. Assume the sequence converges, what does it converge to?
I'm having trouble seeing how to start,
Any help would be appreciated
Thanks
real-analysis sequences-and-series
real-analysis sequences-and-series
edited Nov 26 '18 at 7:21
Jean-Claude Arbaut
14.7k63464
14.7k63464
asked Mar 22 '13 at 17:47
bobdylan
91131432
91131432
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
The number $x$ to which it converges should satisfy $x =frac12left(x+frac a xright)$. Solve that equation for $x$. (It may help to begin by multiplying both sides by $x$, thereby getting rid of the fraction.)
add a comment |
If $x_n to g$, then, if $g ne 0$, we have $frac{1}{2}(x_n + frac{a}{x_n}) to frac{1}{2}(g+frac{a}{g})$. We also have $x_{n+1} to g$, so since $x_{n+1} = frac{1}{2}(x_n + frac{a}{x_n})$, we have that $g = frac{1}{2}(g + frac{a}{g})$.
add a comment |
This sequence has a closed form.
First, if $x_0=sqrt{a}$, $x_n=sqrt{a}$ for all $n$, and the sequence is constant. We will thus assume $x_0nesqrt{a}$ in the following.
Now, given $x_nnesqrt{a}$ for some $n$, we have
$$x_{n+1}-sqrt{a}=frac{1}{2}left(x_n+ frac{a}{x_n} right) - sqrt{a}=frac{1}{2}left( sqrt{x_n} - frac{sqrt{a}}{sqrt{x_n}}right)^2 > 0$$
Hence $x_n>sqrt{a}$ for all $n>0$. To simplify a bit, we can safely assume that $x_0 > sqrt{a}$ too.
We can thus write $x_n = sqrt{a} coth{t_n}$. Then
$$x_{n+1} = frac{1}{2}left( sqrt{a} coth{t_n} + frac{a}{sqrt{a} coth{t_n}} right) = frac{1}{2}sqrt{a} left( coth{t_n} + mathrm{th} t_nright) = sqrt{a} coth 2 t_n$$
We have thus $t_{n+1}=2 t_n$, and $t_n= 2^n t_0$, then for $x_n$ :
$$x_n=sqrt{a} coth left( 2^n arg coth frac{x_0}{sqrt{a}}right)$$
And the value inside parentheses tends to infinity, so $lim(x_n)=sqrt{a}$.
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%2f338098%2fconvergence-of-the-sequence-x-k1-frac12x-k-fracax-k%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
The number $x$ to which it converges should satisfy $x =frac12left(x+frac a xright)$. Solve that equation for $x$. (It may help to begin by multiplying both sides by $x$, thereby getting rid of the fraction.)
add a comment |
The number $x$ to which it converges should satisfy $x =frac12left(x+frac a xright)$. Solve that equation for $x$. (It may help to begin by multiplying both sides by $x$, thereby getting rid of the fraction.)
add a comment |
The number $x$ to which it converges should satisfy $x =frac12left(x+frac a xright)$. Solve that equation for $x$. (It may help to begin by multiplying both sides by $x$, thereby getting rid of the fraction.)
The number $x$ to which it converges should satisfy $x =frac12left(x+frac a xright)$. Solve that equation for $x$. (It may help to begin by multiplying both sides by $x$, thereby getting rid of the fraction.)
answered Mar 22 '13 at 17:50
Michael Hardy
1
1
add a comment |
add a comment |
If $x_n to g$, then, if $g ne 0$, we have $frac{1}{2}(x_n + frac{a}{x_n}) to frac{1}{2}(g+frac{a}{g})$. We also have $x_{n+1} to g$, so since $x_{n+1} = frac{1}{2}(x_n + frac{a}{x_n})$, we have that $g = frac{1}{2}(g + frac{a}{g})$.
add a comment |
If $x_n to g$, then, if $g ne 0$, we have $frac{1}{2}(x_n + frac{a}{x_n}) to frac{1}{2}(g+frac{a}{g})$. We also have $x_{n+1} to g$, so since $x_{n+1} = frac{1}{2}(x_n + frac{a}{x_n})$, we have that $g = frac{1}{2}(g + frac{a}{g})$.
add a comment |
If $x_n to g$, then, if $g ne 0$, we have $frac{1}{2}(x_n + frac{a}{x_n}) to frac{1}{2}(g+frac{a}{g})$. We also have $x_{n+1} to g$, so since $x_{n+1} = frac{1}{2}(x_n + frac{a}{x_n})$, we have that $g = frac{1}{2}(g + frac{a}{g})$.
If $x_n to g$, then, if $g ne 0$, we have $frac{1}{2}(x_n + frac{a}{x_n}) to frac{1}{2}(g+frac{a}{g})$. We also have $x_{n+1} to g$, so since $x_{n+1} = frac{1}{2}(x_n + frac{a}{x_n})$, we have that $g = frac{1}{2}(g + frac{a}{g})$.
answered Mar 22 '13 at 17:51
xyzzyz
5,5361221
5,5361221
add a comment |
add a comment |
This sequence has a closed form.
First, if $x_0=sqrt{a}$, $x_n=sqrt{a}$ for all $n$, and the sequence is constant. We will thus assume $x_0nesqrt{a}$ in the following.
Now, given $x_nnesqrt{a}$ for some $n$, we have
$$x_{n+1}-sqrt{a}=frac{1}{2}left(x_n+ frac{a}{x_n} right) - sqrt{a}=frac{1}{2}left( sqrt{x_n} - frac{sqrt{a}}{sqrt{x_n}}right)^2 > 0$$
Hence $x_n>sqrt{a}$ for all $n>0$. To simplify a bit, we can safely assume that $x_0 > sqrt{a}$ too.
We can thus write $x_n = sqrt{a} coth{t_n}$. Then
$$x_{n+1} = frac{1}{2}left( sqrt{a} coth{t_n} + frac{a}{sqrt{a} coth{t_n}} right) = frac{1}{2}sqrt{a} left( coth{t_n} + mathrm{th} t_nright) = sqrt{a} coth 2 t_n$$
We have thus $t_{n+1}=2 t_n$, and $t_n= 2^n t_0$, then for $x_n$ :
$$x_n=sqrt{a} coth left( 2^n arg coth frac{x_0}{sqrt{a}}right)$$
And the value inside parentheses tends to infinity, so $lim(x_n)=sqrt{a}$.
add a comment |
This sequence has a closed form.
First, if $x_0=sqrt{a}$, $x_n=sqrt{a}$ for all $n$, and the sequence is constant. We will thus assume $x_0nesqrt{a}$ in the following.
Now, given $x_nnesqrt{a}$ for some $n$, we have
$$x_{n+1}-sqrt{a}=frac{1}{2}left(x_n+ frac{a}{x_n} right) - sqrt{a}=frac{1}{2}left( sqrt{x_n} - frac{sqrt{a}}{sqrt{x_n}}right)^2 > 0$$
Hence $x_n>sqrt{a}$ for all $n>0$. To simplify a bit, we can safely assume that $x_0 > sqrt{a}$ too.
We can thus write $x_n = sqrt{a} coth{t_n}$. Then
$$x_{n+1} = frac{1}{2}left( sqrt{a} coth{t_n} + frac{a}{sqrt{a} coth{t_n}} right) = frac{1}{2}sqrt{a} left( coth{t_n} + mathrm{th} t_nright) = sqrt{a} coth 2 t_n$$
We have thus $t_{n+1}=2 t_n$, and $t_n= 2^n t_0$, then for $x_n$ :
$$x_n=sqrt{a} coth left( 2^n arg coth frac{x_0}{sqrt{a}}right)$$
And the value inside parentheses tends to infinity, so $lim(x_n)=sqrt{a}$.
add a comment |
This sequence has a closed form.
First, if $x_0=sqrt{a}$, $x_n=sqrt{a}$ for all $n$, and the sequence is constant. We will thus assume $x_0nesqrt{a}$ in the following.
Now, given $x_nnesqrt{a}$ for some $n$, we have
$$x_{n+1}-sqrt{a}=frac{1}{2}left(x_n+ frac{a}{x_n} right) - sqrt{a}=frac{1}{2}left( sqrt{x_n} - frac{sqrt{a}}{sqrt{x_n}}right)^2 > 0$$
Hence $x_n>sqrt{a}$ for all $n>0$. To simplify a bit, we can safely assume that $x_0 > sqrt{a}$ too.
We can thus write $x_n = sqrt{a} coth{t_n}$. Then
$$x_{n+1} = frac{1}{2}left( sqrt{a} coth{t_n} + frac{a}{sqrt{a} coth{t_n}} right) = frac{1}{2}sqrt{a} left( coth{t_n} + mathrm{th} t_nright) = sqrt{a} coth 2 t_n$$
We have thus $t_{n+1}=2 t_n$, and $t_n= 2^n t_0$, then for $x_n$ :
$$x_n=sqrt{a} coth left( 2^n arg coth frac{x_0}{sqrt{a}}right)$$
And the value inside parentheses tends to infinity, so $lim(x_n)=sqrt{a}$.
This sequence has a closed form.
First, if $x_0=sqrt{a}$, $x_n=sqrt{a}$ for all $n$, and the sequence is constant. We will thus assume $x_0nesqrt{a}$ in the following.
Now, given $x_nnesqrt{a}$ for some $n$, we have
$$x_{n+1}-sqrt{a}=frac{1}{2}left(x_n+ frac{a}{x_n} right) - sqrt{a}=frac{1}{2}left( sqrt{x_n} - frac{sqrt{a}}{sqrt{x_n}}right)^2 > 0$$
Hence $x_n>sqrt{a}$ for all $n>0$. To simplify a bit, we can safely assume that $x_0 > sqrt{a}$ too.
We can thus write $x_n = sqrt{a} coth{t_n}$. Then
$$x_{n+1} = frac{1}{2}left( sqrt{a} coth{t_n} + frac{a}{sqrt{a} coth{t_n}} right) = frac{1}{2}sqrt{a} left( coth{t_n} + mathrm{th} t_nright) = sqrt{a} coth 2 t_n$$
We have thus $t_{n+1}=2 t_n$, and $t_n= 2^n t_0$, then for $x_n$ :
$$x_n=sqrt{a} coth left( 2^n arg coth frac{x_0}{sqrt{a}}right)$$
And the value inside parentheses tends to infinity, so $lim(x_n)=sqrt{a}$.
edited Nov 25 '18 at 22:13
answered Mar 22 '13 at 18:18
Jean-Claude Arbaut
14.7k63464
14.7k63464
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%2f338098%2fconvergence-of-the-sequence-x-k1-frac12x-k-fracax-k%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