On 11/8/24 12:54, Waldek Hebisch wrote:
In your example solver could cheat, that is recognize that all numbers are rational and hand work to integer solver. But such case is probably quite rare in normal use and when testing there is advantage in passing such problems to general solver.
Yes, probably, my example is in a zero-set. I was not suggesting to create a special case solver, but wouldn't it make sense to add some post-processing to show a nicer result. That should be cheap for constant-coefficient linear recurrences.
Ralf -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To unsubscribe from this group and stop receiving emails from it, send an email to fricas-devel+unsubscr...@googlegroups.com. To view this discussion visit https://groups.google.com/d/msgid/fricas-devel/18e7f3d5-d00a-401a-91f8-78a47799d9d8%40hemmecke.org.
