A better closed-form solution to recursive equation
Clash Royale CLAN TAG#URR8PPP
up vote
1
down vote
favorite
Is there a way to represent
beginequation
M(n)=-2times |M(n-1)-0.5|+1
endequation
in closed-form without using the $min$ function? i.e. not:
beginequation
M(n)=2timesminbig2^n-1M(1)-lfloor2^n-1M(1)rfloor,lfloor2^n-1M(1)+1rfloor-2^n-1M(1)big
endequation
where $ 0 leq M(1)leq 1$
sequences-and-series algorithms recurrence-relations closed-form recursion
add a comment |Â
up vote
1
down vote
favorite
Is there a way to represent
beginequation
M(n)=-2times |M(n-1)-0.5|+1
endequation
in closed-form without using the $min$ function? i.e. not:
beginequation
M(n)=2timesminbig2^n-1M(1)-lfloor2^n-1M(1)rfloor,lfloor2^n-1M(1)+1rfloor-2^n-1M(1)big
endequation
where $ 0 leq M(1)leq 1$
sequences-and-series algorithms recurrence-relations closed-form recursion
Is $M$ a function $mathbb N to mathbb R$ ?
– DanielV
Jul 16 at 1:53
@DanielV M is any real number from 0 to 1
– RoryHector
Jul 17 at 15:07
add a comment |Â
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Is there a way to represent
beginequation
M(n)=-2times |M(n-1)-0.5|+1
endequation
in closed-form without using the $min$ function? i.e. not:
beginequation
M(n)=2timesminbig2^n-1M(1)-lfloor2^n-1M(1)rfloor,lfloor2^n-1M(1)+1rfloor-2^n-1M(1)big
endequation
where $ 0 leq M(1)leq 1$
sequences-and-series algorithms recurrence-relations closed-form recursion
Is there a way to represent
beginequation
M(n)=-2times |M(n-1)-0.5|+1
endequation
in closed-form without using the $min$ function? i.e. not:
beginequation
M(n)=2timesminbig2^n-1M(1)-lfloor2^n-1M(1)rfloor,lfloor2^n-1M(1)+1rfloor-2^n-1M(1)big
endequation
where $ 0 leq M(1)leq 1$
sequences-and-series algorithms recurrence-relations closed-form recursion
edited Jul 16 at 9:06
asked Jul 15 at 21:17
RoryHector
9012
9012
Is $M$ a function $mathbb N to mathbb R$ ?
– DanielV
Jul 16 at 1:53
@DanielV M is any real number from 0 to 1
– RoryHector
Jul 17 at 15:07
add a comment |Â
Is $M$ a function $mathbb N to mathbb R$ ?
– DanielV
Jul 16 at 1:53
@DanielV M is any real number from 0 to 1
– RoryHector
Jul 17 at 15:07
Is $M$ a function $mathbb N to mathbb R$ ?
– DanielV
Jul 16 at 1:53
Is $M$ a function $mathbb N to mathbb R$ ?
– DanielV
Jul 16 at 1:53
@DanielV M is any real number from 0 to 1
– RoryHector
Jul 17 at 15:07
@DanielV M is any real number from 0 to 1
– RoryHector
Jul 17 at 15:07
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f2852853%2fa-better-closed-form-solution-to-recursive-equation%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
Is $M$ a function $mathbb N to mathbb R$ ?
– DanielV
Jul 16 at 1:53
@DanielV M is any real number from 0 to 1
– RoryHector
Jul 17 at 15:07