2017-06-17 04:25:48 -0500 | received badge | ● Popular Question (source) |

2017-06-09 16:33:25 -0500 | commented question | indicial equation Thank you dan_fulea. Typically N would be <20, and the rest of the constants would not be integers. It is a pity that there is not a readily available general term. I was hoping to find out some general properties about this new function: some derivatives and simple integrals. But 100 terms in the series is not so bad: it should provide a graph good enough. I am not sure if I should dare to ask you for help. In any event, thanks for your attention. Javier Garcia |

2017-06-09 06:38:47 -0500 | commented answer | indicial equation Thank you dan_fulea. Yes, you are right. My problem is related to the hypergeometric function, but it has a greater complexity. I have manually found the first 4 terms of the series, g(1) to g(4), and they look rather complicated. Do you think there is any hope that SageMath could solve this problem? |

2017-06-09 06:38:46 -0500 | answered a question | indicial equation Thank you dan_fulea. Yes, you are right. My problem is related to the hypergeometric function, but it has a greater complexity. I have manually found the first 4 terms of the series, g(1) to g(4), and they look rather complicated. Do you think there is any hope that SageMath could solve this problem? Thanks, Javier Garcia. |

2017-06-08 12:36:27 -0500 | asked a question | indicial equation Let N be an integer. Let a, b, A_1,...,A_N be constant real numbers. Let g(n) be a real function of integer variable n. g(n) satisfies the recurrence equation: (n + 1) with g(n)=0 for n<0 . g(0) is obtained through boundary conditions, so it can be considered a given constant. I need to know the general functional form of the term g(n), as a function of the given constants of the problem: a,b,N,A_1,...,A_N and g(0). Could you help me? Could I programm in SAGE the code to provide the searched general term g(n)? Thanks for your attention. Javier Garcia |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.