Boundedness criterion for a sequence

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite












Let $x_1=0$.
$x_n+1=ax_n+frac1n$ where $a>0$.
Prove that $x_n$ is bounded iff $0<a<1$.



In the if part,
we have $x_n+1-x_n<frac1n$
From this we get $x_n<sum_k=1^n-1 frac1k$.
But I cannot show that the sequence is uniformly bounded.
No ideas for the only if part.







share|cite|improve this question

















  • 1




    In the if part you have not used the fact that $0<alpha<1$. Moreover, $sum_k=1^n-1k^-1$ is not bounded.
    – Julián Aguirre
    Jul 31 at 15:13










  • Hint: prove that your recurrence has the closed form $$ x_n = frac1n-1 + fracan-2+fraca^2n-3+dots+fraca^n-21 $$
    – Mike Earnest
    Jul 31 at 15:31










  • We have $x_2=1.$ If $ageq 1$ then use induction on $n geq 2:$ If $x_ngeq S(n-1)=sum_j=1^n-1(1/j)$ then $x_n+1=$ $ax_n+1/ngeq x_n+1/ngeq $ $S(n-1)+1/n=S(n).$
    – DanielWainfleet
    Jul 31 at 15:32











  • @MikeEarnest. Very good. Solves everything.
    – DanielWainfleet
    Jul 31 at 15:36














up vote
1
down vote

favorite












Let $x_1=0$.
$x_n+1=ax_n+frac1n$ where $a>0$.
Prove that $x_n$ is bounded iff $0<a<1$.



In the if part,
we have $x_n+1-x_n<frac1n$
From this we get $x_n<sum_k=1^n-1 frac1k$.
But I cannot show that the sequence is uniformly bounded.
No ideas for the only if part.







share|cite|improve this question

















  • 1




    In the if part you have not used the fact that $0<alpha<1$. Moreover, $sum_k=1^n-1k^-1$ is not bounded.
    – Julián Aguirre
    Jul 31 at 15:13










  • Hint: prove that your recurrence has the closed form $$ x_n = frac1n-1 + fracan-2+fraca^2n-3+dots+fraca^n-21 $$
    – Mike Earnest
    Jul 31 at 15:31










  • We have $x_2=1.$ If $ageq 1$ then use induction on $n geq 2:$ If $x_ngeq S(n-1)=sum_j=1^n-1(1/j)$ then $x_n+1=$ $ax_n+1/ngeq x_n+1/ngeq $ $S(n-1)+1/n=S(n).$
    – DanielWainfleet
    Jul 31 at 15:32











  • @MikeEarnest. Very good. Solves everything.
    – DanielWainfleet
    Jul 31 at 15:36












up vote
1
down vote

favorite









up vote
1
down vote

favorite











Let $x_1=0$.
$x_n+1=ax_n+frac1n$ where $a>0$.
Prove that $x_n$ is bounded iff $0<a<1$.



In the if part,
we have $x_n+1-x_n<frac1n$
From this we get $x_n<sum_k=1^n-1 frac1k$.
But I cannot show that the sequence is uniformly bounded.
No ideas for the only if part.







share|cite|improve this question













Let $x_1=0$.
$x_n+1=ax_n+frac1n$ where $a>0$.
Prove that $x_n$ is bounded iff $0<a<1$.



In the if part,
we have $x_n+1-x_n<frac1n$
From this we get $x_n<sum_k=1^n-1 frac1k$.
But I cannot show that the sequence is uniformly bounded.
No ideas for the only if part.









share|cite|improve this question












share|cite|improve this question




share|cite|improve this question








edited Jul 31 at 14:58
























asked Jul 31 at 14:52









Legend Killer

1,500523




1,500523







  • 1




    In the if part you have not used the fact that $0<alpha<1$. Moreover, $sum_k=1^n-1k^-1$ is not bounded.
    – Julián Aguirre
    Jul 31 at 15:13










  • Hint: prove that your recurrence has the closed form $$ x_n = frac1n-1 + fracan-2+fraca^2n-3+dots+fraca^n-21 $$
    – Mike Earnest
    Jul 31 at 15:31










  • We have $x_2=1.$ If $ageq 1$ then use induction on $n geq 2:$ If $x_ngeq S(n-1)=sum_j=1^n-1(1/j)$ then $x_n+1=$ $ax_n+1/ngeq x_n+1/ngeq $ $S(n-1)+1/n=S(n).$
    – DanielWainfleet
    Jul 31 at 15:32











  • @MikeEarnest. Very good. Solves everything.
    – DanielWainfleet
    Jul 31 at 15:36












  • 1




    In the if part you have not used the fact that $0<alpha<1$. Moreover, $sum_k=1^n-1k^-1$ is not bounded.
    – Julián Aguirre
    Jul 31 at 15:13










  • Hint: prove that your recurrence has the closed form $$ x_n = frac1n-1 + fracan-2+fraca^2n-3+dots+fraca^n-21 $$
    – Mike Earnest
    Jul 31 at 15:31










  • We have $x_2=1.$ If $ageq 1$ then use induction on $n geq 2:$ If $x_ngeq S(n-1)=sum_j=1^n-1(1/j)$ then $x_n+1=$ $ax_n+1/ngeq x_n+1/ngeq $ $S(n-1)+1/n=S(n).$
    – DanielWainfleet
    Jul 31 at 15:32











  • @MikeEarnest. Very good. Solves everything.
    – DanielWainfleet
    Jul 31 at 15:36







1




1




In the if part you have not used the fact that $0<alpha<1$. Moreover, $sum_k=1^n-1k^-1$ is not bounded.
– Julián Aguirre
Jul 31 at 15:13




In the if part you have not used the fact that $0<alpha<1$. Moreover, $sum_k=1^n-1k^-1$ is not bounded.
– Julián Aguirre
Jul 31 at 15:13












Hint: prove that your recurrence has the closed form $$ x_n = frac1n-1 + fracan-2+fraca^2n-3+dots+fraca^n-21 $$
– Mike Earnest
Jul 31 at 15:31




Hint: prove that your recurrence has the closed form $$ x_n = frac1n-1 + fracan-2+fraca^2n-3+dots+fraca^n-21 $$
– Mike Earnest
Jul 31 at 15:31












We have $x_2=1.$ If $ageq 1$ then use induction on $n geq 2:$ If $x_ngeq S(n-1)=sum_j=1^n-1(1/j)$ then $x_n+1=$ $ax_n+1/ngeq x_n+1/ngeq $ $S(n-1)+1/n=S(n).$
– DanielWainfleet
Jul 31 at 15:32





We have $x_2=1.$ If $ageq 1$ then use induction on $n geq 2:$ If $x_ngeq S(n-1)=sum_j=1^n-1(1/j)$ then $x_n+1=$ $ax_n+1/ngeq x_n+1/ngeq $ $S(n-1)+1/n=S(n).$
– DanielWainfleet
Jul 31 at 15:32













@MikeEarnest. Very good. Solves everything.
– DanielWainfleet
Jul 31 at 15:36




@MikeEarnest. Very good. Solves everything.
– DanielWainfleet
Jul 31 at 15:36















active

oldest

votes











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',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);








 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2868129%2fboundedness-criterion-for-a-sequence%23new-answer', 'question_page');

);

Post as a guest



































active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes










 

draft saved


draft discarded


























 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2868129%2fboundedness-criterion-for-a-sequence%23new-answer', 'question_page');

);

Post as a guest













































































Comments

Popular posts from this blog

What is the equation of a 3D cone with generalised tilt?

Relationship between determinant of matrix and determinant of adjoint?

Color the edges and diagonals of a regular polygon