1
$\begingroup$

enter image description hereI am interested in solving this recurrence relation (equation) with Mathematica code. I am new to Mathematica. I tried RSolve, RSolveValue, AsymptoticRSolveValue commands for this. But I am not getting any result for different values of 'theta'. Any help would be highly appreciated. Thanks in advance.

RSolve[{a[n + 1] == \[Theta]*a[n] (-1 + a[n]), a[0] == 1}, a[n], n]
$\endgroup$
3
  • 3
    $\begingroup$ A nonlinear recurrence is not likely to have an explicit solution known to Mathematica. Of course, you can still use RecurrenceTable[] or the method in Akku's solution to generate the terms. $\endgroup$ Jul 8 '20 at 12:32
  • 1
    $\begingroup$ Asymptotic solutions are a[n] = 0 and a[n] = 4/3. $\endgroup$
    – bbgodfrey
    Jul 9 '20 at 1:51
  • $\begingroup$ Thank you for the suggestion. $\endgroup$
    – Shivam K
    Jul 10 '20 at 18:31
5
$\begingroup$

Define a recursion relation (with memorizing former values, which speeds up) like

a[0] = a0; 
a[n_] := a[n] = \[Theta]*a[n - 1] (-1 + a[n - 1])

a[3]

(*   (-1 + a0) a0 \[Theta]^3 (-1 + (-1 + a0) a0 \[Theta]) (-1 + (-1 + 
  a0) a0 \[Theta]^2 (-1 + (-1 + a0) a0 \[Theta]))   *)

But with a[0]=1, you get zero for n>0.

$\endgroup$
1
  • $\begingroup$ Thank you very much. $\endgroup$
    – Shivam K
    Jul 10 '20 at 18:29

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.