Given $x_1 = a^1over k$ and $x_n+1 = left(aover x_nright)^1over k$ prove that $x_n = a^1-(-k)^-n over k +1$

Clash Royale CLAN TAG#URR8PPP
up vote
2
down vote
favorite
I'm solving various problems on sequences and here is one I'm stuck with:
Given $x_1 = a^1over k$ where $a > 0$, and $x_n+1 = left(aover x_nright)^1over k$ where $n in mathbb N$. Prove that:
$$
x_n = a^1-(-k)^-n over k +1
$$
Everything I've tried so far just gives me some identity. For example:
$$
beginalign
x_n+1 &= left(aover x_nright)^1over k = \
&= fraca^1over kx_n^1over k = \
&= fracx_1x_n^1over k
endalign
$$
Now try to express $x_n$:
$$
beginalign
x_n^1over k &= fracx_1x_n+1 iff \
iff x_n &= fracx_1^kx_n+1^k
endalign
$$
So this results in $x_n = x_n$ which doesn't show anything. I feel like there might be some smart substitution to translate the problem into some recurrence relation but don't see how.
Could someone please point me in the right direction?
sequences-and-series algebra-precalculus
add a comment |Â
up vote
2
down vote
favorite
I'm solving various problems on sequences and here is one I'm stuck with:
Given $x_1 = a^1over k$ where $a > 0$, and $x_n+1 = left(aover x_nright)^1over k$ where $n in mathbb N$. Prove that:
$$
x_n = a^1-(-k)^-n over k +1
$$
Everything I've tried so far just gives me some identity. For example:
$$
beginalign
x_n+1 &= left(aover x_nright)^1over k = \
&= fraca^1over kx_n^1over k = \
&= fracx_1x_n^1over k
endalign
$$
Now try to express $x_n$:
$$
beginalign
x_n^1over k &= fracx_1x_n+1 iff \
iff x_n &= fracx_1^kx_n+1^k
endalign
$$
So this results in $x_n = x_n$ which doesn't show anything. I feel like there might be some smart substitution to translate the problem into some recurrence relation but don't see how.
Could someone please point me in the right direction?
sequences-and-series algebra-precalculus
1
how about induction can we solve it using induction?
â James
Aug 9 at 15:07
@James assuming $x_1$ is the base case what would be the inductive step?
â roman
Aug 9 at 15:10
add a comment |Â
up vote
2
down vote
favorite
up vote
2
down vote
favorite
I'm solving various problems on sequences and here is one I'm stuck with:
Given $x_1 = a^1over k$ where $a > 0$, and $x_n+1 = left(aover x_nright)^1over k$ where $n in mathbb N$. Prove that:
$$
x_n = a^1-(-k)^-n over k +1
$$
Everything I've tried so far just gives me some identity. For example:
$$
beginalign
x_n+1 &= left(aover x_nright)^1over k = \
&= fraca^1over kx_n^1over k = \
&= fracx_1x_n^1over k
endalign
$$
Now try to express $x_n$:
$$
beginalign
x_n^1over k &= fracx_1x_n+1 iff \
iff x_n &= fracx_1^kx_n+1^k
endalign
$$
So this results in $x_n = x_n$ which doesn't show anything. I feel like there might be some smart substitution to translate the problem into some recurrence relation but don't see how.
Could someone please point me in the right direction?
sequences-and-series algebra-precalculus
I'm solving various problems on sequences and here is one I'm stuck with:
Given $x_1 = a^1over k$ where $a > 0$, and $x_n+1 = left(aover x_nright)^1over k$ where $n in mathbb N$. Prove that:
$$
x_n = a^1-(-k)^-n over k +1
$$
Everything I've tried so far just gives me some identity. For example:
$$
beginalign
x_n+1 &= left(aover x_nright)^1over k = \
&= fraca^1over kx_n^1over k = \
&= fracx_1x_n^1over k
endalign
$$
Now try to express $x_n$:
$$
beginalign
x_n^1over k &= fracx_1x_n+1 iff \
iff x_n &= fracx_1^kx_n+1^k
endalign
$$
So this results in $x_n = x_n$ which doesn't show anything. I feel like there might be some smart substitution to translate the problem into some recurrence relation but don't see how.
Could someone please point me in the right direction?
sequences-and-series algebra-precalculus
asked Aug 9 at 15:02
roman
4391413
4391413
1
how about induction can we solve it using induction?
â James
Aug 9 at 15:07
@James assuming $x_1$ is the base case what would be the inductive step?
â roman
Aug 9 at 15:10
add a comment |Â
1
how about induction can we solve it using induction?
â James
Aug 9 at 15:07
@James assuming $x_1$ is the base case what would be the inductive step?
â roman
Aug 9 at 15:10
1
1
how about induction can we solve it using induction?
â James
Aug 9 at 15:07
how about induction can we solve it using induction?
â James
Aug 9 at 15:07
@James assuming $x_1$ is the base case what would be the inductive step?
â roman
Aug 9 at 15:10
@James assuming $x_1$ is the base case what would be the inductive step?
â roman
Aug 9 at 15:10
add a comment |Â
2 Answers
2
active
oldest
votes
up vote
2
down vote
accepted
$$x_1=a^frac1k$$
now calculate $x_2$ using $x_n+1 = left(aover x_nright)^1over k$
thus $$x_2= (fracax_1)^frac1k$$
thus $$x_2=a^frac1k*x_1^frac-1k=a^frac1k-frac1k^2$$
now solve for $x_3$ using $x_2$ obtained above
you will get $$x_3=a^frac1k-frac1k^2+frac1k^3$$
also $$x_4=a^frac1k-frac1k^2+frac1k^3-frac1k^4$$
hope you are seeing the pattern so
we can write it for $x_n$
now the problem reduces to summing the series for n(even) $$S_n=frac1k-frac1k^2+frac1k^3-frac1k^4+.....-frac1k^n$$
I guess to find the pattern here is not the main problem. As the OP wrote he was not able to prove the formula $$x_n=a^frac1-(-k)^-nk+1$$
â mrtaurho
Aug 9 at 15:25
we can easily prove it it is simple series sum in the power of a
â James
Aug 9 at 15:26
Ah yes. Sorry, I have mistaken your idea. Yeah this is a quite impressing way to approach to this problem.
â mrtaurho
Aug 9 at 15:34
2
This actually answers the question, after finding a common formula for the sum I got what is required to prove
â roman
Aug 9 at 15:41
add a comment |Â
up vote
2
down vote
Hint. One may just rewrite the initial relation as
$$
left(-kright)^n+1ln (x_n+1)-left(-kright)^nln (x_n)=ln left[a^left(-kright)^nright]
$$ recognizing a telescoping sum then using logarithmic properties.
add a comment |Â
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
2
down vote
accepted
$$x_1=a^frac1k$$
now calculate $x_2$ using $x_n+1 = left(aover x_nright)^1over k$
thus $$x_2= (fracax_1)^frac1k$$
thus $$x_2=a^frac1k*x_1^frac-1k=a^frac1k-frac1k^2$$
now solve for $x_3$ using $x_2$ obtained above
you will get $$x_3=a^frac1k-frac1k^2+frac1k^3$$
also $$x_4=a^frac1k-frac1k^2+frac1k^3-frac1k^4$$
hope you are seeing the pattern so
we can write it for $x_n$
now the problem reduces to summing the series for n(even) $$S_n=frac1k-frac1k^2+frac1k^3-frac1k^4+.....-frac1k^n$$
I guess to find the pattern here is not the main problem. As the OP wrote he was not able to prove the formula $$x_n=a^frac1-(-k)^-nk+1$$
â mrtaurho
Aug 9 at 15:25
we can easily prove it it is simple series sum in the power of a
â James
Aug 9 at 15:26
Ah yes. Sorry, I have mistaken your idea. Yeah this is a quite impressing way to approach to this problem.
â mrtaurho
Aug 9 at 15:34
2
This actually answers the question, after finding a common formula for the sum I got what is required to prove
â roman
Aug 9 at 15:41
add a comment |Â
up vote
2
down vote
accepted
$$x_1=a^frac1k$$
now calculate $x_2$ using $x_n+1 = left(aover x_nright)^1over k$
thus $$x_2= (fracax_1)^frac1k$$
thus $$x_2=a^frac1k*x_1^frac-1k=a^frac1k-frac1k^2$$
now solve for $x_3$ using $x_2$ obtained above
you will get $$x_3=a^frac1k-frac1k^2+frac1k^3$$
also $$x_4=a^frac1k-frac1k^2+frac1k^3-frac1k^4$$
hope you are seeing the pattern so
we can write it for $x_n$
now the problem reduces to summing the series for n(even) $$S_n=frac1k-frac1k^2+frac1k^3-frac1k^4+.....-frac1k^n$$
I guess to find the pattern here is not the main problem. As the OP wrote he was not able to prove the formula $$x_n=a^frac1-(-k)^-nk+1$$
â mrtaurho
Aug 9 at 15:25
we can easily prove it it is simple series sum in the power of a
â James
Aug 9 at 15:26
Ah yes. Sorry, I have mistaken your idea. Yeah this is a quite impressing way to approach to this problem.
â mrtaurho
Aug 9 at 15:34
2
This actually answers the question, after finding a common formula for the sum I got what is required to prove
â roman
Aug 9 at 15:41
add a comment |Â
up vote
2
down vote
accepted
up vote
2
down vote
accepted
$$x_1=a^frac1k$$
now calculate $x_2$ using $x_n+1 = left(aover x_nright)^1over k$
thus $$x_2= (fracax_1)^frac1k$$
thus $$x_2=a^frac1k*x_1^frac-1k=a^frac1k-frac1k^2$$
now solve for $x_3$ using $x_2$ obtained above
you will get $$x_3=a^frac1k-frac1k^2+frac1k^3$$
also $$x_4=a^frac1k-frac1k^2+frac1k^3-frac1k^4$$
hope you are seeing the pattern so
we can write it for $x_n$
now the problem reduces to summing the series for n(even) $$S_n=frac1k-frac1k^2+frac1k^3-frac1k^4+.....-frac1k^n$$
$$x_1=a^frac1k$$
now calculate $x_2$ using $x_n+1 = left(aover x_nright)^1over k$
thus $$x_2= (fracax_1)^frac1k$$
thus $$x_2=a^frac1k*x_1^frac-1k=a^frac1k-frac1k^2$$
now solve for $x_3$ using $x_2$ obtained above
you will get $$x_3=a^frac1k-frac1k^2+frac1k^3$$
also $$x_4=a^frac1k-frac1k^2+frac1k^3-frac1k^4$$
hope you are seeing the pattern so
we can write it for $x_n$
now the problem reduces to summing the series for n(even) $$S_n=frac1k-frac1k^2+frac1k^3-frac1k^4+.....-frac1k^n$$
edited Aug 9 at 15:42
answered Aug 9 at 15:22
James
1,627318
1,627318
I guess to find the pattern here is not the main problem. As the OP wrote he was not able to prove the formula $$x_n=a^frac1-(-k)^-nk+1$$
â mrtaurho
Aug 9 at 15:25
we can easily prove it it is simple series sum in the power of a
â James
Aug 9 at 15:26
Ah yes. Sorry, I have mistaken your idea. Yeah this is a quite impressing way to approach to this problem.
â mrtaurho
Aug 9 at 15:34
2
This actually answers the question, after finding a common formula for the sum I got what is required to prove
â roman
Aug 9 at 15:41
add a comment |Â
I guess to find the pattern here is not the main problem. As the OP wrote he was not able to prove the formula $$x_n=a^frac1-(-k)^-nk+1$$
â mrtaurho
Aug 9 at 15:25
we can easily prove it it is simple series sum in the power of a
â James
Aug 9 at 15:26
Ah yes. Sorry, I have mistaken your idea. Yeah this is a quite impressing way to approach to this problem.
â mrtaurho
Aug 9 at 15:34
2
This actually answers the question, after finding a common formula for the sum I got what is required to prove
â roman
Aug 9 at 15:41
I guess to find the pattern here is not the main problem. As the OP wrote he was not able to prove the formula $$x_n=a^frac1-(-k)^-nk+1$$
â mrtaurho
Aug 9 at 15:25
I guess to find the pattern here is not the main problem. As the OP wrote he was not able to prove the formula $$x_n=a^frac1-(-k)^-nk+1$$
â mrtaurho
Aug 9 at 15:25
we can easily prove it it is simple series sum in the power of a
â James
Aug 9 at 15:26
we can easily prove it it is simple series sum in the power of a
â James
Aug 9 at 15:26
Ah yes. Sorry, I have mistaken your idea. Yeah this is a quite impressing way to approach to this problem.
â mrtaurho
Aug 9 at 15:34
Ah yes. Sorry, I have mistaken your idea. Yeah this is a quite impressing way to approach to this problem.
â mrtaurho
Aug 9 at 15:34
2
2
This actually answers the question, after finding a common formula for the sum I got what is required to prove
â roman
Aug 9 at 15:41
This actually answers the question, after finding a common formula for the sum I got what is required to prove
â roman
Aug 9 at 15:41
add a comment |Â
up vote
2
down vote
Hint. One may just rewrite the initial relation as
$$
left(-kright)^n+1ln (x_n+1)-left(-kright)^nln (x_n)=ln left[a^left(-kright)^nright]
$$ recognizing a telescoping sum then using logarithmic properties.
add a comment |Â
up vote
2
down vote
Hint. One may just rewrite the initial relation as
$$
left(-kright)^n+1ln (x_n+1)-left(-kright)^nln (x_n)=ln left[a^left(-kright)^nright]
$$ recognizing a telescoping sum then using logarithmic properties.
add a comment |Â
up vote
2
down vote
up vote
2
down vote
Hint. One may just rewrite the initial relation as
$$
left(-kright)^n+1ln (x_n+1)-left(-kright)^nln (x_n)=ln left[a^left(-kright)^nright]
$$ recognizing a telescoping sum then using logarithmic properties.
Hint. One may just rewrite the initial relation as
$$
left(-kright)^n+1ln (x_n+1)-left(-kright)^nln (x_n)=ln left[a^left(-kright)^nright]
$$ recognizing a telescoping sum then using logarithmic properties.
answered Aug 9 at 15:25
Olivier Oloa
106k17173293
106k17173293
add a comment |Â
add a comment |Â
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2877289%2fgiven-x-1-a1-over-k-and-x-n1-lefta-over-x-n-right1-over-k%23new-answer', 'question_page');
);
Post as a guest
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
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
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
1
how about induction can we solve it using induction?
â James
Aug 9 at 15:07
@James assuming $x_1$ is the base case what would be the inductive step?
â roman
Aug 9 at 15:10