Solve Recurrence Relation $a_k=(a_k-1)^2-2$

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











up vote
4
down vote

favorite
1












$$a_k=left(a_k-1right)^2-2$$



$a_0=frac52$



Then find $$P=prod_k=0^infty left(1-frac1a_kright)$$



My try:



I rewrote the Recurrence equation as



$$a_k+1=(a_k-1-1)(a_k-1+1)$$ $implies$



$$frac1a_k-1-1=fraca_k-1+1a_k+1$$ $implies$



$$fraca_k-1a_k-1-1=frac(a_k-1)^2+a_k-1a_k+1=fraca_k+a_k-1+2a_k+1$$



any hint here?







share|cite|improve this question



















  • Related: math.stackexchange.com/q/121586, math.stackexchange.com/q/781024.
    – Martin R
    Jul 19 at 9:56










  • Correct me if I'm wrong, but I think you can just substitute $a_k-1=sqrta_k+2$ into your last equation to get $fracsqrta_k+2sqrta_k+2-1=fraca_k+sqrta_k+2+1a_k+1$
    – Shrey Joshi
    Jul 19 at 13:09














up vote
4
down vote

favorite
1












$$a_k=left(a_k-1right)^2-2$$



$a_0=frac52$



Then find $$P=prod_k=0^infty left(1-frac1a_kright)$$



My try:



I rewrote the Recurrence equation as



$$a_k+1=(a_k-1-1)(a_k-1+1)$$ $implies$



$$frac1a_k-1-1=fraca_k-1+1a_k+1$$ $implies$



$$fraca_k-1a_k-1-1=frac(a_k-1)^2+a_k-1a_k+1=fraca_k+a_k-1+2a_k+1$$



any hint here?







share|cite|improve this question



















  • Related: math.stackexchange.com/q/121586, math.stackexchange.com/q/781024.
    – Martin R
    Jul 19 at 9:56










  • Correct me if I'm wrong, but I think you can just substitute $a_k-1=sqrta_k+2$ into your last equation to get $fracsqrta_k+2sqrta_k+2-1=fraca_k+sqrta_k+2+1a_k+1$
    – Shrey Joshi
    Jul 19 at 13:09












up vote
4
down vote

favorite
1









up vote
4
down vote

favorite
1






1





$$a_k=left(a_k-1right)^2-2$$



$a_0=frac52$



Then find $$P=prod_k=0^infty left(1-frac1a_kright)$$



My try:



I rewrote the Recurrence equation as



$$a_k+1=(a_k-1-1)(a_k-1+1)$$ $implies$



$$frac1a_k-1-1=fraca_k-1+1a_k+1$$ $implies$



$$fraca_k-1a_k-1-1=frac(a_k-1)^2+a_k-1a_k+1=fraca_k+a_k-1+2a_k+1$$



any hint here?







share|cite|improve this question











$$a_k=left(a_k-1right)^2-2$$



$a_0=frac52$



Then find $$P=prod_k=0^infty left(1-frac1a_kright)$$



My try:



I rewrote the Recurrence equation as



$$a_k+1=(a_k-1-1)(a_k-1+1)$$ $implies$



$$frac1a_k-1-1=fraca_k-1+1a_k+1$$ $implies$



$$fraca_k-1a_k-1-1=frac(a_k-1)^2+a_k-1a_k+1=fraca_k+a_k-1+2a_k+1$$



any hint here?









share|cite|improve this question










share|cite|improve this question




share|cite|improve this question









asked Jul 19 at 9:41









Ekaveera Kumar Sharma

5,20111122




5,20111122











  • Related: math.stackexchange.com/q/121586, math.stackexchange.com/q/781024.
    – Martin R
    Jul 19 at 9:56










  • Correct me if I'm wrong, but I think you can just substitute $a_k-1=sqrta_k+2$ into your last equation to get $fracsqrta_k+2sqrta_k+2-1=fraca_k+sqrta_k+2+1a_k+1$
    – Shrey Joshi
    Jul 19 at 13:09
















  • Related: math.stackexchange.com/q/121586, math.stackexchange.com/q/781024.
    – Martin R
    Jul 19 at 9:56










  • Correct me if I'm wrong, but I think you can just substitute $a_k-1=sqrta_k+2$ into your last equation to get $fracsqrta_k+2sqrta_k+2-1=fraca_k+sqrta_k+2+1a_k+1$
    – Shrey Joshi
    Jul 19 at 13:09















Related: math.stackexchange.com/q/121586, math.stackexchange.com/q/781024.
– Martin R
Jul 19 at 9:56




Related: math.stackexchange.com/q/121586, math.stackexchange.com/q/781024.
– Martin R
Jul 19 at 9:56












Correct me if I'm wrong, but I think you can just substitute $a_k-1=sqrta_k+2$ into your last equation to get $fracsqrta_k+2sqrta_k+2-1=fraca_k+sqrta_k+2+1a_k+1$
– Shrey Joshi
Jul 19 at 13:09




Correct me if I'm wrong, but I think you can just substitute $a_k-1=sqrta_k+2$ into your last equation to get $fracsqrta_k+2sqrta_k+2-1=fraca_k+sqrta_k+2+1a_k+1$
– Shrey Joshi
Jul 19 at 13:09










1 Answer
1






active

oldest

votes

















up vote
4
down vote













Hint: There are three steps. First, for each $k=0,1,2,ldots$, show that $$a_k=2^2^k+frac12^2^k,.$$
Second, write $$1-frac1a_k=fraca_k-1a_k=left(fraca_k+1+1a_k+1right)frac1a_k,,$$
for all $k=0,1,2,ldots$.
Finally, show that
$$prod_k=0^n,a_k=frac23left(2^2^n+1-frac12^2^n+1right),,$$ using the identity
$$(x-y),prod_k=0^n,left(x^2^k+y^2^kright)=x^2^n+1-y^2^n+1,,$$
for all $n=0,1,2,ldots$.




You should in the end obtain $$prod_k=0^infty,left(1-frac1a_kright)=lim_ntoinfty,frac37left(frac2^2^n+1+1+frac12^2^n+1 2^2^n+1-frac12^2^n+1 right)=frac37,.$$







share|cite|improve this answer























  • @OscarLanzi Not sure what you are talking about? Did you really read what I had written?
    – Batominovski
    Jul 19 at 14:13











  • Not what I first saw, I saw an error. Must be a bug on my end.
    – Oscar Lanzi
    Jul 19 at 20:28











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%2f2856461%2fsolve-recurrence-relation-a-k-a-k-12-2%23new-answer', 'question_page');

);

Post as a guest






























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
4
down vote













Hint: There are three steps. First, for each $k=0,1,2,ldots$, show that $$a_k=2^2^k+frac12^2^k,.$$
Second, write $$1-frac1a_k=fraca_k-1a_k=left(fraca_k+1+1a_k+1right)frac1a_k,,$$
for all $k=0,1,2,ldots$.
Finally, show that
$$prod_k=0^n,a_k=frac23left(2^2^n+1-frac12^2^n+1right),,$$ using the identity
$$(x-y),prod_k=0^n,left(x^2^k+y^2^kright)=x^2^n+1-y^2^n+1,,$$
for all $n=0,1,2,ldots$.




You should in the end obtain $$prod_k=0^infty,left(1-frac1a_kright)=lim_ntoinfty,frac37left(frac2^2^n+1+1+frac12^2^n+1 2^2^n+1-frac12^2^n+1 right)=frac37,.$$







share|cite|improve this answer























  • @OscarLanzi Not sure what you are talking about? Did you really read what I had written?
    – Batominovski
    Jul 19 at 14:13











  • Not what I first saw, I saw an error. Must be a bug on my end.
    – Oscar Lanzi
    Jul 19 at 20:28















up vote
4
down vote













Hint: There are three steps. First, for each $k=0,1,2,ldots$, show that $$a_k=2^2^k+frac12^2^k,.$$
Second, write $$1-frac1a_k=fraca_k-1a_k=left(fraca_k+1+1a_k+1right)frac1a_k,,$$
for all $k=0,1,2,ldots$.
Finally, show that
$$prod_k=0^n,a_k=frac23left(2^2^n+1-frac12^2^n+1right),,$$ using the identity
$$(x-y),prod_k=0^n,left(x^2^k+y^2^kright)=x^2^n+1-y^2^n+1,,$$
for all $n=0,1,2,ldots$.




You should in the end obtain $$prod_k=0^infty,left(1-frac1a_kright)=lim_ntoinfty,frac37left(frac2^2^n+1+1+frac12^2^n+1 2^2^n+1-frac12^2^n+1 right)=frac37,.$$







share|cite|improve this answer























  • @OscarLanzi Not sure what you are talking about? Did you really read what I had written?
    – Batominovski
    Jul 19 at 14:13











  • Not what I first saw, I saw an error. Must be a bug on my end.
    – Oscar Lanzi
    Jul 19 at 20:28













up vote
4
down vote










up vote
4
down vote









Hint: There are three steps. First, for each $k=0,1,2,ldots$, show that $$a_k=2^2^k+frac12^2^k,.$$
Second, write $$1-frac1a_k=fraca_k-1a_k=left(fraca_k+1+1a_k+1right)frac1a_k,,$$
for all $k=0,1,2,ldots$.
Finally, show that
$$prod_k=0^n,a_k=frac23left(2^2^n+1-frac12^2^n+1right),,$$ using the identity
$$(x-y),prod_k=0^n,left(x^2^k+y^2^kright)=x^2^n+1-y^2^n+1,,$$
for all $n=0,1,2,ldots$.




You should in the end obtain $$prod_k=0^infty,left(1-frac1a_kright)=lim_ntoinfty,frac37left(frac2^2^n+1+1+frac12^2^n+1 2^2^n+1-frac12^2^n+1 right)=frac37,.$$







share|cite|improve this answer















Hint: There are three steps. First, for each $k=0,1,2,ldots$, show that $$a_k=2^2^k+frac12^2^k,.$$
Second, write $$1-frac1a_k=fraca_k-1a_k=left(fraca_k+1+1a_k+1right)frac1a_k,,$$
for all $k=0,1,2,ldots$.
Finally, show that
$$prod_k=0^n,a_k=frac23left(2^2^n+1-frac12^2^n+1right),,$$ using the identity
$$(x-y),prod_k=0^n,left(x^2^k+y^2^kright)=x^2^n+1-y^2^n+1,,$$
for all $n=0,1,2,ldots$.




You should in the end obtain $$prod_k=0^infty,left(1-frac1a_kright)=lim_ntoinfty,frac37left(frac2^2^n+1+1+frac12^2^n+1 2^2^n+1-frac12^2^n+1 right)=frac37,.$$








share|cite|improve this answer















share|cite|improve this answer



share|cite|improve this answer








edited Jul 19 at 10:01


























answered Jul 19 at 9:45









Batominovski

23.2k22777




23.2k22777











  • @OscarLanzi Not sure what you are talking about? Did you really read what I had written?
    – Batominovski
    Jul 19 at 14:13











  • Not what I first saw, I saw an error. Must be a bug on my end.
    – Oscar Lanzi
    Jul 19 at 20:28

















  • @OscarLanzi Not sure what you are talking about? Did you really read what I had written?
    – Batominovski
    Jul 19 at 14:13











  • Not what I first saw, I saw an error. Must be a bug on my end.
    – Oscar Lanzi
    Jul 19 at 20:28
















@OscarLanzi Not sure what you are talking about? Did you really read what I had written?
– Batominovski
Jul 19 at 14:13





@OscarLanzi Not sure what you are talking about? Did you really read what I had written?
– Batominovski
Jul 19 at 14:13













Not what I first saw, I saw an error. Must be a bug on my end.
– Oscar Lanzi
Jul 19 at 20:28





Not what I first saw, I saw an error. Must be a bug on my end.
– Oscar Lanzi
Jul 19 at 20:28













 

draft saved


draft discarded


























 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2856461%2fsolve-recurrence-relation-a-k-a-k-12-2%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?

Color the edges and diagonals of a regular polygon

Relationship between determinant of matrix and determinant of adjoint?