2020-04-11 14:05:29 +0200 | commented answer | How can you get the n'th function in a sequence defined by a recurrence relation? Thank you so much! Sorry for my late response. This was exactly what I was looking for. |
2020-03-29 17:57:01 +0200 | asked a question | How can you get the n'th function in a sequence defined by a recurrence relation? Let a_0(x) and b_0(x) be given functions. Then define a_n and b_n by the following relations (or any) a_n(x) = a_{n-1}(x+1) - a_{n-1}(x) + a_0(x+1)a_{n-1}(x) + b_{n-1}(x) b_n(x) = b_{n-1}(x+1) - b_{n-1}(x) + a_{n-1}(x)b_0(x+1) How can I write a program to print the n'th pair of functions in the sequence? I'm new to sagemath and I've been trying to work through this problem on my own, but the bugs I've been running across make me think the way I'm writing my methods is wrong. Here's what I came up with using a different relation |
2020-03-29 17:57:01 +0200 | asked a question | How can I generate functions in a sequence defined by a recurrence relation? Let How can I write a program to print the n'th pair of functions in the sequence? I'm new to SageMath and I've been trying to work through this problem on my own, but the bugs I've been running across make me think the way I'm writing my methods is wrong. Here's what I came up with |