I’m trying to have the recurrence table find roots of a function, but I can only use these numbers in the equation:
RecurrenceTable[{ a[n + 1] == a[n] + 1, a[1] == 0, p[n + 1] == b[n], p[1] == 1, r[n] == p[n]^2*(p[n]^2*(231*p[n]^2 - 315) + 105) - 5, d[n] == p[n]*(p[n]^2*(1386*p[n]^2 - 1260) + 210), b[n] == (d[n]*p[n] - r[n])/d[n]}, {a, p, r, d, b}, {n, 2}, DependentVariables -> {a, p, r, d, b}]
and it gives exact fraction answers.
There are three problems though.
- when I try to have p[1]==0.5 or any decimal, it wants to abort
- when using decimals in p,d,or b, it stalls
- it runs out of memory when n>4
All I want is to have p[1] at a decimal and I also want to have decimal approximation. I would use N but it needs n and Scientific form doesn’t seem to work. How can I get itterations approximate to 10^-10 or even make it to n=20 ?